Fast and flexible difference constraint propagation for DPLL(T)

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

Volumn 4121 LNCS, Issue , 2006, Pages 170-183

  Cotton, Scott ^a   Maler, Oded ^a  

^a VERIMAG   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; SET THEORY;

CANDIDATE CONSTRAINTS; DIFFERENCE CONSTRAINTS; THEORY PROPAGATION;

CONSTRAINT THEORY;

EID: 33749549521     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11814948_19     Document Type: Conference Paper

References (20)

1. Boris V. Cherkassky and Andrew V. Goldberg. Negative-cycle detection algorithms. In ESA '96: Proceedings of the Fourth Annual European Symposium on Algorithms, pages 349-363, London, UK, 1996. Springer-Verlag.
2. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to algorithms. MIT Press, 1990.
3. S. Cotton. Satisfiability checking with difference constraints. Master's thesis. Max Planck Institute, 2005.
4. S. Cotton and O. Maler. Satisfiability modulo theory chains with DPLL(T). In Verimag Technical Report http://vfww-verimag.imag.fr/TR/TR-2006-4.pdf, 2006.
5. M. Davis, G. Logemann, and D. Loveland. A machine program for theorem proving. In Communications of the ACM, volume 5(7), pages 394-397, 1962.
6. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7(1):201-215, 1960.
7. E. W. Dijkstra. A note on two problems in connexion with graphs. In Numer. Math., volume 1, pages 269-271, 1959.
8. N. Eèn and N. Sorensson. Minisat - a sat solver with conflict-clause minimization. In SA T 2005, 2005.
9. D. Frigioni, A. Marchetti-Spaccamela, and U. Nanni. Fully dynamic shortest paths and negative cycles detection on digraphs with arbitrary arc weights. In European Symposium on Algorithms, pages 320-331, 1998.
10. H. Ganzinger, G. Hagen, R. Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast decision procedures. In CAV'04, pages 175-188, 2004.
11. A. V. Goldberg. Shortests path algorithms: Engineering aspects. In Proceedings of the Internation Symposium of Algorithms and Computation, 2001.
12. E. Goldberg and Y. Novikov. Berkmin: A fast and robust SAT solver, 2002.
13. D.B. Johnson. Efficient algorithms for shortest paths in sparse networks. J. Assoc. Comput. Mach., 24:1, 1977.
14. J. P. Marquez-Silva and K. A. Sakallah. Grasp - a new search algorithm for satisfiability. In CAV'96, pages 220-227, November 1996.
15. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In DAC'01, 2001.
16. P. Niebert, M. Mahfoudh, E. Asarin, M. Bozga, O. Maler, and N. Jain. Verification of timed automata via satisfiability checking. In Lecture Notes in Computer-Science, volume Volume 2469, pages 225 - 243, Jan 2002.
17. R. Nieuwenhuis and A. Oliveras. DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In CAV05, volume 3576 of LNCS, pages 321-334, 2005.
18. R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Abstract DPLL and abstract DPLL modulo theories. In LPAR'04, volume 3452 of LNCS, pages 36-50. Springer, 2005.
19. S. Ranise and C. Tinelli. The SMT-LIB format: An initial proposal. In PDPAR, July 2003.
20. R. E. Tarjan. Shortest paths. In AT&T Technical Reports. AT&T Bell Laboratories, 1981.