Matrices, connections, matings and

reasoning:
The connection method
Presented
by
Kashif
pathan
Sami Shaikh
Sayyed
mufin
 Matrices and ATP
 Prawitz [1960, 1970] proposed the use of matrices to
express logical formulae
 Proving is path verification

 Example in DNF: F: (¬P ^ Q ^ R) v (¬Q ^ ¬R) v (P ^ Q)

 Matrices and ATP
 Prawitz [1960, 1970] proposed the use of matrices to
express logical formulae
 Proving is path verification

 Example in DNF: F: (¬P ^ Q ^ R) v (¬Q ^ ¬R) v (P ^ Q)

 Same formula negated, in CNF, to be used in refutation

proofs: ¬F: (P v ¬Q v ¬R) ^ (Q v R) ^ (¬P v ¬Q)
 Matrices and ATP
 Prawitz [1960, 1970] proposed the use of matrices to
express logical formulae
 Proving is path verification

 Example in DNF: F: (¬P ^ Q ^ R) v (¬Q ^ ¬R) v (P ^ Q)

 Same formula negated, in CNF, to be used in refutation

proofs: ¬F: (P v ¬Q v ¬R) ^ (Q v R) ^ (¬P v ¬Q)

¬P ¬Q P P ¬Q ¬R
FDNF: Q ¬R Q ¬ FCNF : Q R
R ¬P ¬Q
 Example of Horn Formula
 FDNF : P v (¬P ^ Q) v (¬Q ^ R) v ¬R

 FDNF : P ¬P ¬Q ¬R
Q R

 ¬FCNF : ¬P
P ¬Q
Q ¬R
R
 Changing the Perspective…
 FDNF : P v (¬P ^ Q) v (¬Q ^ R) v ¬R
 Vertically : P ¬P ¬Q ¬R
Q R
 And horizontally?
 Changing the Perspective…
 FDNF : P v (¬P ^ Q) v (¬Q ^ R) v ¬R
 Vertically : P ¬P ¬Q ¬R
Q R
 And horizontally?
 Paths!
 {P, ¬P, ¬Q, ¬R}
 {P, ¬P, R, ¬R}
 {P, Q, ¬Q, ¬R}
 {P, Q, R, ¬R}
 What do they mean w.r.t. to the original DNF
formula?
 The Set of Paths are
 The set of paths is the formula in CNF! See:

 FDNF : P v (¬P ^ Q) v (¬Q ^ R) v ¬R

 {P, ¬P, ¬Q, ¬R}
 {P, ¬P, R, ¬R} P ¬P ¬Q ¬R
 {P, Q, ¬Q, ¬R} Q R
 {P, Q, R, ¬R}
 The Set of Paths are
 The set of paths is the formula in CNF! See:

 FDNF : P v (¬P ^ Q) v (¬Q ^ R) v ¬R

 {P, ¬P, ¬Q, ¬R}
 {P, ¬P, R, ¬R} P ¬P ¬Q ¬R
 {P, Q, ¬Q, ¬R} Q R
 {P, Q, R, ¬R}

 FCNF (not negated!) :

 (P v ¬P v ¬Q v ¬R) ^
 (P v ¬P v R v ¬R) ^
 (P v Q v ¬Q v ¬R) ^
 (P v Q v R v ¬R)
 Validity in DNF Matrices
 ╞ P ¬P ¬Q ¬R ?
Q R
 In other words, a formula in DNF is valid
 when every path is valid (true)!
 When is a path true?
 Validity in DNF Matrices
 ╞ P ¬P ¬Q ¬R ?
Q R
 In other words, a formula in DNF is valid
 when every path is valid (true)!
 When is a path true?
 When it contains a complimentary pair of literals (P v ¬P,
or unifiable predicates, for FOL), a connection:
 {P, ¬P, ¬Q, ¬R}
 {P, ¬P, R, ¬R}
 {P, Q, ¬Q, ¬R}
 {P, Q, R, ¬R}