Jump to content

Resolution inference

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Gregbard (talk | contribs) at 00:03, 7 March 2014 (format/links). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 and are of different sign, is a most general unifier of and and and have no common variables.

Example

The clauses and can apply this rule with as unifier.

Here x is a variable and B is a constant.

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

  1. ^ Fontaine, Pascal; Merz, Stephan; Woltzenlogel Paleo, Bruno. Compression of Propositional Resolution Proofs via Partial Regularization. 23rd International Conference on Automated Deduction, 2011.
  2. ^ Enrique P. Arís, Juan L. González y Fernando M. Rubio, Lógica Computacional, Thomson, (2005).