From Wikipedia, the free encyclopedia
In propositional logic , a resolution inference is an instance of the following rule [ 1] :
Γ
1
∪
{
ℓ
}
Γ
2
∪
{
ℓ
¯
}
Γ
1
∪
Γ
2
|
ℓ
|
{\displaystyle {\frac {\Gamma _{1}\cup \left\{\ell \right\}\,\,\,\,\Gamma _{2}\cup \left\{{\overline {\ell }}\right\}}{\Gamma _{1}\cup \Gamma _{2}}}|\ell |}
We call:
The clauses
Γ
1
∪
{
ℓ
}
{\displaystyle \Gamma _{1}\cup \left\{\ell \right\}}
and
Γ
2
∪
{
ℓ
¯
}
{\displaystyle \Gamma _{2}\cup \left\{{\overline {\ell }}\right\}}
are the inference’s premises
Γ
1
∪
Γ
2
{\displaystyle \Gamma _{1}\cup \Gamma _{2}}
(the resolvent of the premises) is its conclusion.
The literal
ℓ
{\displaystyle \ell }
is the left resolved literal,
The literal
ℓ
¯
{\displaystyle {\overline {\ell }}}
is the right resolved literal,
|
ℓ
|
{\displaystyle |\ell |}
is the resolved atom or pivot.
This rule can be generalized to first-order logic to[ 2] :
Γ
1
∪
{
L
1
}
Γ
2
∪
{
L
2
}
(
Γ
1
∪
Γ
2
)
ϕ
ϕ
{\displaystyle {\frac {\Gamma _{1}\cup \left\{L_{1}\right\}\,\,\,\,\Gamma _{2}\cup \left\{L_{2}\right\}}{(\Gamma _{1}\cup \Gamma _{2})\phi }}\phi }
where
ϕ
{\displaystyle \phi }
is a most general unifier of
L
1
{\displaystyle L_{1}}
and
L
2
¯
{\displaystyle {\overline {L_{2}}}}
and
Γ
1
{\displaystyle \Gamma _{1}}
and
Γ
2
{\displaystyle \Gamma _{2}}
have no common variables.
Example
The clauses
P
(
x
)
,
Q
(
x
)
{\displaystyle P(x),Q(x)}
and
¬
P
(
b
)
{\displaystyle \neg P(b)}
can apply this rule with
[
b
/
x
]
{\displaystyle [b/x]}
as unifier.
Here x is a variable and b is a constant.
P
(
x
)
,
Q
(
x
)
¬
P
(
b
)
Q
(
B
)
[
b
/
x
]
{\displaystyle {\frac {P(x),Q(x)\,\,\,\,\neg P(b)}{Q(B)}}[b/x]}
Here we see that
The clauses
P
(
x
)
,
Q
(
x
)
{\displaystyle P(x),Q(x)}
and
¬
P
(
x
)
{\displaystyle \neg P(x)}
are the inference’s premises
Q
(
b
)
{\displaystyle Q(b)}
(the resolvent of the premises) is its conclusion.
The literal
P
(
x
)
{\displaystyle P(x)}
is the left resolved literal,
The literal
¬
P
(
b
)
{\displaystyle \neg P(b)}
is the right resolved literal,
P
{\displaystyle P}
is the resolved atom or pivot.
[
b
/
x
]
{\displaystyle [b/x]}
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).