Resolution inference

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


\frac{\Gamma_1 \cup\left\{ \ell\right\} \,\,\,\, \Gamma_2 \cup\left\{ \overline{\ell}\right\} }{\Gamma_1 \cup\Gamma_2}|\ell|

We call:

This rule can be generalized to first-order logic to:[2]


\frac{\Gamma_1 \cup\left\{ L_1\right\} \,\,\,\, \Gamma_2 \cup\left\{ L_2\right\} }{ (\Gamma_1 \cup \Gamma_2)\phi } \phi

where \phi is a most general unifier of L_1 and \overline{L_2} and \Gamma_1 and \Gamma_2 have no common variables.

Example

The clauses P(x),Q(x) and \neg P(b) can apply this rule with [b/x] as unifier.

Here x is a variable and b is a constant.


\frac{P(x),Q(x) \,\,\,\, \neg P(b)}
{Q(b)}[b/x]

Here we see that

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).
This article is issued from Wikipedia - version of the Friday, January 15, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.