Evaluating search heuristics and optimization techniques in propositional satisfiability

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

Volumn 2083 LNAI, Issue , 2001, Pages 347-363

  Giunchiglia, Enrico ^a   Maratea, Massimo ^a   Tacchella, Armando ^a   Zambonin, Davide ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; MODEL CHECKING; NETWORK SECURITY; FORMAL LOGIC; SEMANTICS;

BOUNDED MODEL CHECKING; COMMON PLATFORM; EXPERIMENTAL EVALUATION; OPTIMIZATION TECHNIQUES; PROPOSITIONAL SATISFIABILITY; SEARCH HEURISTICS; SECURITY PROTOCOLS; STATE OF THE ART;

OPTIMIZATION;

EID: 84867787499     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45744-5_26     Document Type: Conference Paper

References (18)

1. J. Gu, P. W. Purdom, J. Franco, and B. W. Wah. Algorithms for the satisfiability (sat) problem: A survey. In Satisfiability Problem: Theory and Applications, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 19-153. AMS, 1997.
2. D. G. Mitchell, B. Selman, and H. J. Levesque. Hard and Easy Distributions for SAT Problems. In Proc. of AAAI, pages 459-465. AAAI Press, 1992.
3. J. Franco and M. Paull. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5:77-87, 1983.
4. Bart Selman, Henry Kautz, and David McAllester. Ten Challenges in Propositional Reasoning and Search. In Proc. of IJCAI, pages 50-54. Morgan-Kauffmann, 1997.
5. Massacci and Marraro. Logical Cryptanalysis as a SAT Problem. JAR: Journal of Automated Reasoning, 24, 2000.
6. Chu Min Li. Integrating Equivalency Reasoning into Davis-Putnam Procedure. In Proc. of AAAI. AAAI Press, 2000.
7. T. E. Uribe and M. E. Stickel. Ordered Binary Decision Diagrams and the Davis-Putnam Procedure. In Proc. of the 1st International Conference on Constraints in Computational Logics, 1994.
8. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. In Proceedings of TACAS, volume 1579 of LNCS, pages 193-207. Springer Verlag, 1999.
9. H. Zhang and M. E. Stickel. Implementing the Davis-Putnam Method. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
10. R. J. Bayardo, Jr. and R. C. Schrag. Using CSP Look-Back Techniques to Solve Real-World SAT instances. In Proc. of AAAI, pages 203-208. AAAI Press, 1997.
11. Chu Min Li and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proc. of IJCAI, pages 366-371. Morgan-Kauffmann, 1997.
12. Jon W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
13. H. Zhang. SATO: An efficient propositional prover. In Proc. of CADE, volume 1249 of LNAI, pages 272-275. Springer Verlag, 1997.
14. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7):394-397, 1962.
15. T. H. Cormen, C. E. Leiserson, and R. R. Rivest. Introduction to Algorithms. MIT Press, 1998.
16. P. Liberatore. On the complexity of choosing the branching literal in DPLL. Artificial Intelligence, 116(1-2):315-326, 2000.
17. R. Dechter, I. Meiri, and J. Pearl. Temporal Constraint Networks. Artificial Intelligence, 49:61-95, 1991.
18. F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proc. of CAV, LNCS. Springer Verlag, 2001. To appear.