for sentences in propositional logic and first-order logic. For propositional logic, systematically applying the resolution rule acts as a decision procedure...

Day Dispute resolution, the settlement of a disagreement Resolution (algebra), an exact sequence in homological algebra Resolution (logic), a rule of...

learning and logic programming. Muggleton and Wray Buntine introduced predicate invention and inverse resolution in 1988. Several inductive logic programming...

Logic programming is a programming, database and knowledge representation paradigm based on formal logic. A logic program is a set of sentences in logical...

calculus Calculus of structures Formal proof Method of analytic tableaux Resolution (logic) Anita Wasilewska. "General proof systems" (PDF). "Definition:Proof...

SLD resolution (Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which...

Classical logic Computability logic Deontic logic Dependence logic Description logic Deviant logic Doxastic logic Epistemic logic First-order logic Formal...

Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory...

First-order logic—also called predicate logic, predicate calculus, quantificational logic—is a collection of formal systems used in mathematics, philosophy...

numbers Decomposition (computer science) A rule in resolution theorem proving, see Resolution (logic)#Factoring Code refactoring Factor (disambiguation)...

mathematical logic and logic programming, a Horn clause is a logical formula of a particular rule-like form that gives it useful properties for use in logic programming...

In mathematics and logic, a higher-order logic (abbreviated HOL) is a form of logic that is distinguished from first-order logic by additional quantifiers...

to: an analogy symbolism operator, in logic and mathematics a notation for equality of ratios a scope resolution operator, in computer programming languages...

refutation-complete systems include: SLD resolution on Horn clauses, superposition on equational clausal first-order logic, Robinson's resolution on clause sets. The latter...

Cirrus Logic Inc. is an American fabless semiconductor supplier that specializes in analog, mixed-signal, and audio DSP integrated circuits (ICs). Since...

paraconsistent logic is the subfield of logic that is concerned with studying and developing "inconsistency-tolerant" systems of logic, which reject the...

requiring relatively expensive dictionary search and possibly overload resolution logic. In most applications, the extra compute and time required is negligible...

assumed false at its right. Resolution (logic) Howson, Colin (1997). Logic with trees: an introduction to symbolic logic. London ; New York: Routledge...

Algebraic Logic Functional (ALF) programming language combines functional and logic programming techniques. Its foundation is Horn clause logic with equality...

Production systems, which use if-then rules to derive actions from conditions. Logic programming systems, which use conclusion if conditions rules to derive...

Prolog is a logic programming language that has its origins in artificial intelligence, automated theorem proving and computational linguistics. Prolog...

non-normal modal logic is a variant of modal logic that deviates from the basic principles of normal modal logics. Normal modal logics adhere to the distributivity...

In mathematical logic, sequent calculus is a style of formal logical argumentation in which every line of a proof is a conditional tautology (called a...

(1972) stands for "PROgramming in LOGic." It was developed for natural language question answering, using SL resolution both to deduce answers to queries...

checking the validity of a first-order logic formula using a resolution-based decision procedure for propositional logic. Since the set of valid first-order...

tabling, tabling might react to changes. The adaptation of tabling into a logic programming proof procedure, under the name of Earley deduction, dates from...

automated deduction) is a subfield of automated reasoning and mathematical logic dealing with proving mathematical theorems by computer programs. Automated...

unsatisfiability of clauses in first-order predicate logic. Kundu, S (1986-12-01). "Tree resolution and generalized semantic tree". Proceedings of the ACM...

In mathematical logic, geometric logic is an infinitary generalisation of coherent logic, a restriction of first-order logic due to Skolem that is proof-theoretically...

The logic of argumentation (LA) is a formalised description of the ways in which humans reason and argue about propositions. It is used, for example,...