A SAT-based decision procedure for the Boolean combination of difference constraints

Lecture Notes in Computer Science

Volumn 3542, Issue , 2005, Pages 16-29

  Armando, Alessandro ^a   Castellini, Claudio ^a   Giunchiglia, Enrico ^a   Maratea, Marco ^a  

^a UNIVERSITY OF GENOA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; DECISION MAKING; MATHEMATICAL MODELS; REAL TIME SYSTEMS; SCHEDULING;

SAT-BASED DECISION PROCEDURE; SATISFIABILITY OF BOOLEAN COMBINATIONS; TSAT++;

BOOLEAN ALGEBRA;

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

References (20)

1. +02] Gilles Audemard, Piergiorgio Bertoli, Alessandro Cimatti, Artur Kornilowicz, and Roberto Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In Andrei Voronkov, editor, Automated Deduction - CADE-18, volume 2392 of Lecture Notes in Computer Science, pages 195-210. Springer-Verlag, July 27-30 2002.
2. [ACG00] Alessandro Armando, Claudio Castellini, and Enrico Giunchiglia. SAT-based procedures for temporal reasoning. In Susanne Biundo and Maria Fox, editors, Proceedings of the 5th European Conference on Planning (Durham, UK), volume 1809 of Lecture Notes in Computer Science, pages 97-108. Springer, 2000.
3. +04] Alessandro Armando, Claudio Castellini, Enrico Giunchiglia, Massimo Idini, and Marco Maratea. TSAT++: an open platform for satisfiability modulo theories. Elsevier Science Publishers, 2004. Proceedings of PDPAR 2004 - Pragmatics of Decision Procedures in Automated Reasoning, Cork, Ireland. To appear.
4. [BM96] R. J. Bayardo, Jr. and D. P. Miranker. A complexity analysis of space-bounded learning algorithms for the constraint satisfaction problem. In Proc. AAAI, pages 298-304, 1996.
5. [BS97] 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.
6. [BS03] Le Berre and Simon. The essentials of the SAT 2003 competition. In International Conference on Theory and Applications of Satisfiability Testing (SAT), LNCS, volume 6, 2003.
7. [CLR98] Thomas H. Cormen, Charles E. Leiserson, and Ronald R. Rivest. Introduction to Algorithms. MIT Press, 1998.
8. [Cpl93] CPLEX user's guide. Manual, CPLEX Optimization, Inc., Incline Village, NV, USA, 1993.
9. [DMP91] R. Dechter, I. Meiri, and J. Pearl. Temporal constraint networks. Artificial Intelligence, 49(1-3):61-95, January 1991.
10. [GC97] Alfonso Gerevini and Matteo Cristani. On finding a solution in temporal constraint satisfaction problems. In Proceedings of the 15th International Joint Conference on Artificial Intelligence (IJCAI-97), pages 1460-1465, San Francisco, August 23-29 1997. Morgan Kaufmann Publishers.
11. [GMT03] E. Giunchiglia, M. Maratea, and A. Tacchella. Look-ahead vs. look-back techniques in a modern SAT solver. In Proceedings of the 6th International Conference on Theory and Applications of Satisfiability Testing (SAT)., Portofino, Italy, May 5-8 2003.
12. [LA97] 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.
13. +01] 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.
14. [OC00] 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.
15. [Pro93] Patrick Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
16. [SK98] Kostas Stergiou and Manolis Koubarakis. Backtracking algorithms for disjunctions of temporal constraints. In Proc. AAAI, 1998.
17. [SS99] Joao P. Marques Silva and Karem A. Sakallah. GRASP: A search algorithm for prepositional satisfiability. IEEETC: IEEE Transactions on Computers, 48, 1999.
18. [SSB02] Ofer Strichman, Sanjit A. Seshia, and Randal E. Bryant. Deciding separation formulas with SAT. Lecture Notes in Computer Science, 2404:209-222, 2002.
19. [TP03] Ioannis Tsamardinos and Martha Pollack. Efficient solution techniques for disjunctive temporal reasoning problems. Artificial Intelligence, 2003. To appear.
20. [WW99] Steven Wolfman and Daniel Weld. The LPSAT-engine & its application to resource planning. In Proc. IJCAI-99, 1999.