Linear Resolution[Chang and Lee,
Symbolic Logic and Mechanical Theorem Proving, Academic Press, 1973.]
Given a set S of clauses and a clause C0 in S ,
a linear deduction of Cn from S with top clause
C0 is a deduction where:
- for i = 0, 1, ..., n-1, Ci+1 is a resolvent of
Ci (called a center clause) and Bi (called a
side clause), and
- each Bi is either in S , or is a Cj for some
j, j < i .
(320,420)(0,0)
(210,404) C0
(280,404) B0
(220,325) (0,1)70
(236,325) (5,6)57
(210,304) C1
(280,304) B1
(220,225) (0,1)70
(236,225) (5,6)57
(210,204) C2
(220,170) (0,1)25
(208,160) ...
(220,125) (0,1)25
(236,125) (5,6)20
(210,104) Cn - 1
(280,104) Bn - 1
(220, 25) (0,1)70
(236, 25) (5,6)57
(210, 4) Cn
Contents
Page-10
Prev
Next
Page+10
Index