SAT-based decision procedures for automated reasoning: A unifying perspective

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

Volumn 2605 LNAI, Issue , 2005, Pages 46-58

  Armando, Alessandro ^a   Castellini, Claudio ^a   Giunchiglia, Enrico ^a   Giunchiglia, Fausto ^b,c   Tacchella, Armando ^a  

^a UNIVERSITY OF GENOA   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

^c ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; DECISION THEORY; PROBLEM SOLVING;

DECISION PROCEDURES; PROPOSITIONAL REASONING;

FORMAL LOGIC;

EID: 33750300438     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-32254-2_4     Document Type: Article

References (33)

1. A. Armando and F. Giunchiglia. On tautology decision techniques: Complexity and implementation considerations. Technical Report 8911-08, IRST, Trento, Italy, 1989.
2. A. Armando and E. Giunchiglia. Embedding Complex Decision Procedures inside an Interactive Theorem Prover. Annals of Mathematics and Artificial Intelligence, 8(3-4) :475-502, 1993.
3. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Lecture Notes in Computer Science, volume 1809, pages 97-108, 1999.
4. Roberto J. Bayardo, Jr. and Robert C. Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the 14th National Conference on Artificial Intelligence and 9th Innovative Applications of Artificial Intelligence Conference (AAAI-97/IAAI-97), pages 203-208, Menlo Park, July 27-31 1997. AAAI Press.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proceedings of the Fifth International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS '99), 1999.
6. M. Böhm and E Speckenmeyer. A fast parallel SAT-solver - efficient workload balancing. Annals of Mathematics and Artificial Intelligence, 17:381-400, 1996.
7. M. Bu;ro and H. Buning. Report on a SAT competition. Technical Report 110, University of Paderborn, Germany, November 1992.
8. Claudio Castellini, Enrico Giunchiglia, and Armando Tacchella. Improvements to sat-based conformant planning. In ECP, 2001.
9. B. F. Chellas. Modal Logic - an Introduction. Cambridge University Press, 1980.
10. N. Chleq. Efficient algorithms for networks of quantitative temporal constraints. In Proceedings of CONSTRAINTS-95, pages 40-45, April 1995.
11. Thomas H. Cormen, Charles E. Leiserson, and Ronald R. Rivest. Introduction to Algorithms. MIT Press, 1998.
12. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
13. Burton Dreben and Warren D. Goldfarb. The Decision Problem: Solvable Classes of Quantificational Formulas. Addison-Wesley Publishing Company, Reading, MA, 1979.
14. Ian Gent, Hans Van Maaren, and Toby Walsh, editors. SAT2000. Highlights of Satisfiability Research in the Year 2000. IOS Press, 2000.
15. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures - the case study of modal K. In Proc. CADE-96, Lecture Notes in Artificial Intelligence, New Brunswick, NJ, USA, August 1996. Springer Verlag.
16. F. Giunchiglia and R. Sebastiani. A SAT-based decision procedure for ALC. In Proc. of the 5th International Conference on Principles of Knowledge Representation and Reasoning - KR'96, Cambridge, MA, USA, November 1996. Also DIST-Technical Report 9607-08 and IRST-Technical Report 9601-02.
17. Enrico Giunchiglia and Armando Tacchella. A subset-matching size-bounded cache for testing satisfiability in modal logics. Annals of Mathematics and Artificial Intelligence, 33:39-67, 2001.
18. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. More evaluation of decision procedures for modal logics. In Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), 1998.
19. E. Giunchiglia, F. Giunchiglia, R. Sebastiani, and A. Tacchella. SAT vs. Translation Based decision procedures for modal logics: a comparative evaluation. Journal of Applied Non Classical Logics, 10(2):145-172, 2000.
20. E. Giunchiglia, F. Giunchiglia, and A. Tacchella. SAT-Based Decision Procedures for Classical Modal Logics. Journal of Automated Reasoning, 2000. To appear. Reprinted in [Gent et al., 2000].
21. Enrico Giunchiglia, Marco Maratea, Armando Tacchella, and Davide Zambonin. Evaluating search heuristics and optimization techniques in propositional satisfiability. In Proc. of the International Joint Conference on Automated Reasoning (IJCAR'2001), LNAI 2083, 2001.
22. Enrico Giunchiglia. Planning as satisfiability with expressive action languages: Concurrency, constraints and nondeterminism. In Seventh International Conference on Principles of Knowledge Representation and Reasoning (KR'00), 2000.
23. Jun Gu, Paul W. Purdom, John Franco, and Benjamin W. Wah. Algorithms for the satisfiability (sat) problem: A survey. Satisfiability Problem: Theory and Applications, pages 19-153, 1997.
24. Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359-363, 1992.
25. Henry Kautz and Bart Selman. Pushing the envelope: planning, propositional logic and stochastic search. In Proc. AAAI-96, pages 1194-1201, 1996.
26. Chu Min Li and Anbulagan. Heuristics based on unit propagation for satisfiability problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 366-371, San Francisco, August 23-29 1997. Morgan Kaufmann Publishers.
27. Matthew W. Moskewicz, Conor F. Madigan, Ying Zhao, Lintao Zhang, and Sharad Malik. Chaff: Engineering an Efficient SAT Solver. In Proceedings of the 38th Design Automation Conference (DAC'01), June 2001.
28. Greg Nelson and Derek C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, 1980.
29. A. Oddi and A. Cesta. Incremental forward checking for the disjunctive temporal problem. In Proceedings of the 14th European Conference on Artificial Intelligence (ECAI-2000), pages 108-112, Berlin, 2000.
30. Patrick Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
31. Kostas Stergiou and Manolis Koubarakis. Backtracking algorithms for disjunctions of temporal constraints. In Proc. AAAI, 1998.
32. Steven Wolfman and Daniel Weld. The LPSAT-engine & its application to resource planning. In Proc. IJCAI-99, 1999.
33. H. Zhang. SATO: An efficient propositional prover. In William McCune, editor, Proceedings of the 14th International Conference on Automated deduction, volume 1249 of LNAI, pages 272-275, Berlin, July 13-17 1997. Springer.