💡 Words with a Similar Meaning to "Inductive logic programming"
Found via reverse dictionary — words that share a conceptual meaning.
| Word | Definition |
|---|---|
| constraint logic programming | a form of constraint programming, in which logic programming is extended to include concepts from constraint satisfaction. |
| probabilistic programming | a programming paradigm in which probabilistic models are specified and inference for these models is performed automatically. |
| automated theorem proving | (also known as ATP or automated deduction) a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. |
| first-order logicnoun | (logic) A formal deductive system extended from propositional logic with the possibility to quantify over individuals of the domain of discourse. |
| abstract algebraic logic | In mathematical logic, abstract algebraic logic is the study of the algebraization of deductive systems |
| probabilistic logic | Probabilistic logic (also probability logic and probabilistic reasoning) involves the use of probability and logic to deal with uncertain situations. |
| lambda calculusnoun | (computing theory) Any of a family of functionally complete algebraic systems in which lambda expressions are evaluated according to a fixed set of rules to produce values, which may themselves be lambda expressions. |
| formal epistemology | Formal epistemology uses formal methods from decision theory, logic, probability theory and computability theory to model and reason about issues of epistemological interest. |
| computer algebra | In mathematics and computer science, computer algebra, also called symbolic computation or algebraic computation, is a scientific area that refers to the study and development of algorithms and software for manipulating mathematical expressions and other mathematical objects. |
| sld resolution | (Selective Linear Definite clause resolution) the basic inference rule used in logic programming. |
| theoretical computer science | a subfield of computer science and mathematics that focuses on the abstract and mathematical foundations of computation. |
| formal sciencenoun | A study that is concerned with theoretical formal systems, such as logic, mathematics, systems theory and the theoretical branches of computer science, information theory, statistics, and linguistics. |
| natural deductionnoun | A kind of proof calculus in which logical reasoning is expressed by inference rules closely related to the "natural" way of reasoning, in contrast to axiomatic systems. |
| formal concept analysis | In information science, formal concept analysis is a principled way of deriving a concept hierarchy or formal ontology from a collection of objects and their properties. |
| case-based reasoningnoun | (computing) The process of solving new problems based on the known solutions of similar problems encountered in the past. |
| structural induction | a proof method that is used in mathematical logic (e.g., in the proof of Łoś' theorem), computer science, graph theory, and some other mathematical fields. |
| statistical learning theory | a framework for machine learning drawing from the fields of statistics and functional analysis. |
| markov logic network | A Markov logic network is a probabilistic logic which applies the ideas of a Markov network to first-order logic, defining probability distributions on possible worlds on any given domain . |
| deep reinforcement learning | (deep RL) a subfield of machine learning that combines reinforcement learning and deep learning. |
| computational topology | Algorithmic topology, or computational topology, is a subfield of topology with an overlap with areas of computer science, in particular, computational geometry and computational complexity theory. |
Translate “Inductive logic programming” into Another Language
Pick a language — the word will be pre-filled in the translator.