From Wikipedia, the free encyclopedia
In propositional logic, a resolution inference is an instance of the following rule[1]:

We call:
- The clauses
and
are the inference’s premises
(the resolvent of the premises) is its conclusion.
- The literal
is the left resolved literal,
- The literal
is the right resolved literal,
is the resolved atom or pivot.
This rule can be generalized to first order logic to[2]:

where
is a most general unifier of
and
and
and
share no common variables
Example
The clauses
and
can apply this rule with
as unifier.
Here x is a variable and B is a constant.
![{\displaystyle {\displaystyle {\frac {P(x),Q(x)\,\,\,\,\neg P(B)}{Q(B)}}}[B/x]}](/media/api/rest_v1/media/math/render/svg/f3962ce22874a35917a0e7c16ed96e399c6c1046)
Here we see that
- The clauses
and
are the inference’s premises
(the resolvent of the premises) is its conclusion.
- The literal
is the left resolved literal,
- The literal
is the right resolved literal,
is the resolved atom or pivot.
is the most general unifier of the resolved literals.
Notes
- ^ Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. Compression of Propositional Resolution Proofs via Partial Regularization. 23rd International Conference on Automated Deduction, 2011.
- ^ Enrique P. Arís, Juan L. González y Fernando M. Rubio, Lógica Computacional, Thomson, (2005).