Clause form conversions for Boolean circuits

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 183-198

  Jackson, Paul ^a   Sheridan, Daniel ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; ENCODING (SYMBOLS); MATHEMATICAL MODELS; NUMBER THEORY; PROBLEM SOLVING;

BOOLEAN CIRCUITS; CONVERSION PROCEDURES; PREPOSITIONAL ENCODINGS; SATISFIABILITY SOLVING;

BOOLEAN ALGEBRA;

EID: 26444437248     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11527695_15     Document Type: Conference Paper

References (10)

1. Parosh Aziz Abdulla, Per Bjesse, and Niklas Eén. Symbolic reachability analysis based on SAT-solvers. In S. Graf and M. Schwartzbach, editors, Tools and Algorithms for the Construction and Analysis of Systems, 6th International Conference, TACAS'00, volume 1785 of Lecture Notes in Computer Science, pages 411-425. Springer-Verlag, March 2000.
2. Olivier Bailleux and Yacine Boufkhad. Efficient CNF encoding of Boolean cardinality constraints. In Principles and Practice of Constraint Programming - 9th International Conference, CP 2003, Lecture Notes in Computer Science, 2003.
3. Armin Biere, Alessandro Cimatti, Edmund Clarke, and Yunshan Zhu. Symbolic model checking without BDDs. In W.R. Cleaveland, editor, Tools and Algorithms for the Construction and Analysis of Systems. 5th International Conference, TACAS'99, volume 1579 of Lecture Notes in Computer Science, pages 193-207. Springer-Verlag, July 1999.
4. Thierry Boy de la Tour. An optimality result for clause form translation. Journal of Symbolic Computation, 14:283-301, 1992.
5. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings of the Eleventh Conference on Computer-Aided Verification (CAV'99), number 1633 in Lecture Notes in Computer Science, pages 495-499, Trento, Italy, July 1999. Springer-Verlag.
6. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In 39th Design Automation Conference, pages 530-535, Las Vegas, June 2001.
7. Alexander Nadel. Backtrack search algorithms for propositional logic satisfiability: Review and innovations. Master's thesis, Tel-Aviv University, November 2002.
8. Andreas Nonnengart, Georg Rock, and Christoph Weidenbach. On generating small clause normal forms. In Claude Kirchner and Hélène Kirchner, editors, Fifteenth International Conference on Automated Deduction, volume 1421 of Lecture Notes in Artificial Intelligence, pages 397-411. Springer-Verlag, 1998.
9. David A. Plaisted and Steven Greenbaum. A structure-preserving clause form translation. Journal of Symbolic Computation, 2(3):293-304, September 1986.
10. M. N. Velev. Efficient translation of Boolean formulas to CNF in formal verification of microprocessors. In Asia and South Pacific Design Automation Convference (ASP-DAC '04), January 2004.