Aligning CNF - And equivalence-reasoning

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 145-156

  Heule, Marijn ^a   Van Maaren, Hans ^a  

^a DELFT UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; COMPUTATIONAL METHODS; EQUIVALENCE CLASSES; PARAMETER ESTIMATION; PROBABILITY;

EQUIVALENCE REASONING; OPTIMAL VALUES; PARITY-FAMILY; STRUCTURAL LOGICAL FORMULAS;

FORMAL LOGIC;

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

References (13)

1. D. Le Berre and L. Simon, The essentials of the SAT'03 Competition. Springer Verlag, Lecture Notes in Comput. Sci. 2919 (2004), 452-467.
2. A. Biere, A. Cimatti, E.M. Clarke, Y. Zhu, Symbolic model checking without BDDs. in Proc. Int. Conf. Tools and Algorithms for the Construction and Analysis of Systems, Springer Verlag, Lecture Notes in Comput. Sci. 1579 (1999), 193-207.
3. J.M. Crawford, M.J. Kearns, R.E. Schapire, The Minimal Disagreement parity problem as a hard satisfiability problem. Draft version (1995).
4. M.J.H. Heule, J.E. van Zwieten, M. Dufour and H. van Maaren, March_eq, Implementing Efficiency and Additional Reasoning in a Look-ahead SAT Solver. Appearing in the same volume.
5. O. Kullmann, Investigating the behaviour of a SAT solver on random formulas. Submitted to Annals of Mathematics and Artificial Intelligence (2002).
6. C.M. Li, Equivalent literal propagation in the DLL procedure. The Renesse issue on satisfiability (2000).
7. Discrete Appl. Math. 130 (2003), no. 2, 251-276.
8. L. Simon, D. Le Berre, and E. Hirsch, The SAT 2002 competition. Accepted for publication in Annals of Mathematics and Artificial Intelligence (AMAI) 43 (2005), 343-378.
9. L. Simon, Sat'03 competition homepage. http://www.lri.fr/~simon/ contest03/results/
10. L. Simon, Sat'04 competition homepage. http://www.lri.fr/~simon/contest/ results/
11. R. Ostrowski, E. Gregoire, B. Mazure, L. Sais, Recovering and exploiting structural knowledge from CNF formulas, in Proc. of the Eighth International Conference on Principles and Practice of Constraint Programming, Springer Verlag, Lecture Notes in Comput. Sci. 2470 (2002), 185-199.
12. P. Purdom and A. Sabry, CNF Generator for Factoring Problems. http://www.cs.indiana.edu/cgi-pub/sabry/cnf.htm
13. J.P. Warners, H. van Maaren, A two phase algorithm for solving a class of hard satisfiability problems. Oper. Res. Lett. 23 (1998), no. 3-5, 81-88.