Towards an efficient library for SAT: A manifesto

Electronic Notes in Discrete Mathematics

Volumn 9, Issue , 2001, Pages 290-310

  Giunchiglia, Enrico ^a   Narizzano, Massimo ^a   Tacchella, Armando ^b   Vardi, Moshe Y ^b  

^a UNIVERSITY OF GENOA   (Italy)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 34247138917     PISSN: 15710653     EISSN: 15710653     Source Type: Journal    
DOI: 10.1016/S1571-0653(04)00329-4     Document Type: Article

References (47)

1. P. A. Abdulla, P. Bjesse, and N. Eén. Symbolic Reachability Analisys Based on SAT-Solvers. In Proceedings of TACAS, volume 1785 of LNCS, pages 411-425. Springer Verlag, 2000.
2. 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.
3. J.R. Burch, E.M. Clarke, and K.L. McMillan. Symbolic Model Checking: 1020 states and beyond. Information and Computation, 98(2):142-170, 1992.
4. M. Buro and H. Kleine-Büning. Report on a SAT competition. Technical Report 110, University of Paderborn, November 1992.
5. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, 1992.
6. 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.
7. M. Cadoli. Tractable Reasoning in Artificial Intelligence. Number 941 in LNAI. Springer Verlag, 1995.
8. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new symbolic model checker. Journal on Software Tools for Technology Transfer, 2(4):410-425, 2000.
9. F. Copty, L. Fix, Ranan Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proc. of CAV, LNCS. Springer Verlag, 2001. To appear.
10. C. Castellini, E. Giunchiglia, and A. Tacchella. SAT-based planning in complex domains: Concurrency, constraints and nondeterminism, 2001. Unpublished manuscript.
11. T. H. Cormen, C. E. Leiserson, and R. R. Rivest. Introduction to Algorithms. MIT Press, 1998.
12. M. Cadoli, M. Schaerf, A. Giovanardi, and M. Giovanardi. An Algorithm to Evaluate Quantified Boolean Formulae and its Experimental Evaluation. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
13. The Second Dimacs Challenge: Satisfiability Suggested Format. ftp://dimacs.rutgers.edu/pub/challenge/satisfiability/.
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. Eiter, G. Gottlob, and N. Leone. Semantics and Complexity of Abduction from Default Theories. Artificial Intelligence, 1-2 (90):177-223, 1997.
16. R. Fagin, J.Y. Halpern, Y. Moses, and M. Y. Vardi. Reasoning about knowledge. MIT Press, 1995.
17. R. Feldmann, B. Monien, and S. Schamberger. A Distributed Algorithm to Evaluate Quantified Boolean Formulae. In Proc. of AAAI, 2000.
18. J. Franco and M. Pauli. Probabilistic analysis of the Davis-Putnam procedure for solving the satisfiability problem. Discrete Applied Mathematics, 5:77-87, 1983.
19. J. W. Freeman. Improvements to propositional satisfiability search algorithms. PhD thesis, University of Pennsylvania, 1995.
20. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Proc. of KR. Morgan-Kauffmann, 1998.
21. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT-Based Decision Procedures for Classical Modal Logics. Highlights of Satisfiability Research in the Year 2000, 2000.
22. E. Giunchiglia and V. Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. of AAAI. AAAI Press, 1998.
23. E. Giunchiglia, M. Maratea, A. Tacchella, and D. Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. In Proc. of IJCAR, LNCS. Springer Verlag, 2001. To appear.
24. E. Giunchiglia, M. Narizzano, and A. Tacchella. Backjumping for Quantified Boolean Logic Satisfiability. In Proc. of IJCAI, 2001. To appear.
25. E. Giunchiglia, M. Narizzano, and A. Tacchella. On the effectiveness of backjumping and trivial truth in quantified boolean formulas satisfiability. In IJCAR workshop on Theory and Application of Quantified Boolean Formulas, 2001.
26. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proc. of CADE, LNAI. Springer Verlag, 1996.
27. C. P. Gomes, B. Selman, N. Crato, and H. Kautz. Heavy-Tailed Phenomena in Satisfiability and Constraint Satisfaction Problems. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
28. E. Giunchiglia and A. Tacchella. A Size-bounded Subset-matching cache for Satisfiability in Modal Logics. Annals of Mathematics and Artificial Intelligence, 2000. To appear.
29. J. F. Groote and J. P. Warners. The propositional formula checker heerhugo. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
30. A. Gupta, Z. Yang, P. Ashar, and A. Gupta. SAT-Based Image Computation with Application in Reachability Analisys. In Proceedings of FMCAD, volume 1954 of LNCS, pages 354-371. Springer Verlag, 2000.
31. J. N. Hooker. Testing Heuristics: We Have It All Wrong. Journal of Heuristics, 1:33-42, 1996.
32. I. Horrocks. Optimizing Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester, 1997.
33. U. Hustadt and R.A. Schmidt. On evaluating decision procedures for modal logic. In Proc. of IJCAI, 1997.
34. H. Kautz and B. Selman. Planning as satisfiability. In Proc. of ECAI, pages 359-363, 1992.
35. H. Kautz and B. Selman. Blackbox: A new approach to the application of theorem proving to problem solving. In Working notes of the Workshop on Planning as Combinatorial Search, held in conjunction with AIPS-98, 1998.
36. C. M. Li and Anbulagan. Heuristics Based on Unit Propagation for Satisfiability Problems. In Proc. of IJCAI, pages 366-371. Morgan-Kauffmann, 1997.
37. C. M. Li. Integrating Equivalency Reasoning into Davis-Putnam Procedure. In Proc. of AAAI. AAAI Press, 2000.
38. K.L. McMillan. Symbolic Model Checking: an Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
39. B. Mazure, L. Sais, and É. Grégoire. Boosting complete techniques thanks to local search methods. Annals of Mathematics and Artificial Intelligence, 22:319-331, 1998.
40. P. F. Patel-Schneider. DLP System Description. In Collected Papers from the International Description Logics Workshop (DL'98). CEUR Workshop Proceedings, 1998.
41. J. T. Rintanen. Improvements to the Evaluation of Quantified Boolean Formulae. In Proc. of IJCAI, pages 1192-1197, 1999.
42. F. Somenzi. CUDD: CU Decision Diagram Package. Release 2.3.0.
43. J. P. M. Silva and K. A. Sakallah. GRASP - A new Search Algorithm for Satisfiability. Technical report, University of Michigan, 1996.
44. G. Stålmarck. System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated From Boolean Formula, 1994. United States Patent, No. 5276897.
45. A. Tacchella. *SAT system description. In Collected Papers from the International Description Logics Workshop (DL'99). CEUR Workshop Proceedings, 1999.
46. T. Walsh. Search in a Small World. In Proc. of the 16th International Joint Conference on Artificial Intelligence (IJCAI '99), 1999.
47. H. Zhang and M. E. Stickel. Implementing the Davis-Putnam Method. In Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.