CMPS240, Spring 2013, Section 01: Lecture 12 05/09 /13

We covered

       SAT:

              factoring

              BCXF

 

        We also learned how to prove things in propostional logic using existential graphs:

        (A) not A

         ((A) (B)) A or B

         (A (B))  A implies B

         A B      A and B

         () contradiction

 

3 rules:

     Double Negation Removal   ((x))  ---> x

     Deletion   (x (x))--->(x ())

 

    Superesolution:

              G      ---> ((A G) ((A) G))

 

without superresolution would have proved P=NP>