Integrating boolean and mathematical solving: Foundations, basic algorithms, and requirements

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

Volumn 2385, Issue , 2002, Pages 231-245

  Audemard, Gilles ^a,b   Bertoli, Piergiorgio ^a   Cimatti, Alessandro ^a   Korniłowicz, Artur ^a,c   Sebastiani, Roberto ^a,d  

^a ITC IRST   (Italy)

^b AIX MARSEILLE UNIV   (France)

^c UNIVERSITY OF BIALYSTOK   (Poland)

^d UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA; ALGORITHMS;

BOOLEAN COMBINATIONS; BOOLEAN EXPRESSIONS; COMPUTER ALGEBRA SYSTEMS; CONSTRAINT SOLVERS; EXISTING SYSTEMS; REAL VALUES; REAL-WORLD PROBLEM; STATE OF THE ART;

ARTIFICIAL INTELLIGENCE;

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

References (17)

1. G. Audemard, P. Bertoli, A. Cimatti, A. Korniłowicz, and R. Sebastiani. A SAT Based Approach for Solving Formulas over Boolean and Linear Mathematical Propositions. In Proc. CADE’2002., 2002. To appear. Available at http://www. dit. unitn. it/˜rseba/publist. html.
2. A. Armando, C. Castellini, and E. Giunchiglia. SAT-based procedures for temporal reasoning. In Proc. European Conference on Planning, CP-99, 1999.
3. G. Audemard, A. Cimatti, A. Korniłowicz, and R. Sebastiani. SAT-Based Bounded Model Checking for Timed Systems. 2002. Available at http://www. dit. unitn. it/˜rseba/publist. html.
4. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic model checking without BDDs. In Proc. CAV’99, 1999.
5. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.
6. W. Chan, R. J. Anderson, P. Beame, and D. Notkin. Combining constraint solving and symbolic model checking for a class of systems with non-linear constraints. In Proc. CAV’97, volume 1254 of LNCS, pages 316–327, Haifa, Israel, June 1997. Springer-Verlag.
7. M. Davis, G. Longemann, and D. Loveland. A machine program for theorem proving. Journal of the ACM, 5(7), 1962.
8. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures-the case study of modal K. In Proc. of the 13th Conference on Automated Deduction, LNAI, New Brunswick, NJ, USA, August 1996. Springer Verlag.
9. F. Giunchiglia and R. Sebastiani. Building decision procedures for modal logics from propositional decision procedures-the case study of modal K(m). Information and Computation, 162(1/2), October/November 2000.
10. I. Horrocks and P. F. Patel-Schneider. FaCT and DLP. In Procs. Tableaux’98, number 1397 in LNAI, pages 27–30. Springer-Verlag, 1998.
11. H. Kautz, D. McAllester, and Bart Selman. Encoding Plans in Propositional Logic. In Proc. KR’96, 1996.
12. J. Moeller, J. Lichtenberg, H. Andersen, and H. Hulgaard. Fully Symbolic Model Checking of Timed Systems using Difference Decision Diagrams. In Electronic Notes in Theoretical Computer Science, volume 23. Elsevier Science, 2001.
13. W. Pugh. The Omega Test: a fast and practical integer programming algoprithm for dependence analysis. Communication of the ACM, August 1992.
14. A. Robinson and A. Voronkov, editors. Handbook of Automated Reasoning. Elsevier Science Publishers, 2001.
15. R. Sebastiani. Integrating SAT Solvers with Math Reasoners: Foundations and Basic Algorithms. Technical Report 0111-22, ITC-IRST, November 2001. Available at http://www. dit. unitn. it/˜rseba/publist. html.
16. R. M. Smullyan. First-Order Logic. Springer-Verlag, NY, 1968.
17. S. Wolfman and D. Weld. The LPSAT Engine & its Application to Resource Planning. In Proc. IJCAI, 1999.