Algebraic simplification techniques for propositional satisfiability

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1894, Issue , 2000, Pages 537-542

  Marques Silva, João ^a  

^a UNIVERSITY OF LISBON   (Portugal)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTER PROGRAMMING; CONSTRAINT THEORY;

ALGEBRAIC SIMPLIFICATION; COMPUTATIONAL EFFORT; CONJUNCTIVE NORMAL FORMS; PROBLEM INSTANCES; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY PROBLEMS;

FORMAL LOGIC;

EID: 84861431321     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45349-0_45     Document Type: Conference Paper

References (4)

1. J. F. Groote and J. P. Warners. The propositional formula checker heerhugo. Technical Report SEN-R9905, CWI, January 1999.
2. C.-M. Li. Integrating equivalency reasoning into davis-putnam procedure. In Proceedings of the National Conference on Artificial Intelligence, August 2000. Accepted for publication.
3. J. P. Marques-Silva. Algebraic simplification techniques for propositional satisfiability. Technical Report RT/01/2000, INESC, March 2000.
4. G. Stålmarck. A system for determining propositional logic theorems by applying values and rules to triplets that are generated from a formula, 1989. Swedish Patent 467 076 (Approved 1992), US Patent 5 276 897 (approved 1994), European Patent 0 403 454 (approved 1995).