A theory-based decision heuristic for DPLL(T)

Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design, FMCAD

Volumn , Issue , 2008, Pages

  Goldwasser, Dan ^a   Strichman, Ofer ^b   Fine, Shai ^c  

^a UNIVERSITY OF HAIFA   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c IBM HAIFA RESEARCH LAB   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN; DECISION THEORY; FORMAL METHODS; HEURISTIC METHODS;

DECISION PROBLEMS; LINEAR ARITHMETICS; LINEAR ARRANGEMENTS; RUN TIMES;

COMPUTATIONAL GEOMETRY;

EID: 58049144744     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FMCAD.2008.ECP.17     Document Type: Conference Paper

References (21)

1. G. Audemard, P. Bertoli, A. Cimatti, A. Kornilowicz, and R. Sebastiani. A SAT based approach for solving formulas over boolean and linear mathematical propositions. In Proc. 18th International Conference on Automated Deduction (CADE'02), 2002.
2. A. Baker. Intelligent Backtracking on Constraint Satisfaction Problems: Experimental and Theoretical Results. PhD thesis, Univ. of Oregon, 1995.
3. st satisfiability modulo theories competition (SMTCOMP 2005). The Journal of Automated Reasoning, 35:373-390, 2005.
4. Clark Barrett and Cesare Tinelli. CVC3. In Computer Aided Verification (CAV), pages 298-302, 2007.
5. K. L. Clarkson. New applications of random sampling in computational geometry. Discrete Comput. Geom., 2(195-22), 1987.
6. Leonardo de Moura and Nikolaj Bjorner. Z3: An efficient smt solver. In Intl. Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), 2008.
7. David Detlefs, Greg Nelson, and James B. Saxe. Simplify: a theorem prover for program checking. J. ACM, 52(3), 2005.
8. th Intl. Conference on Computer Aided Verification (CAV'06), volume 4144 of Lect. Notes in Comp. Sci., pages 81-94. Springer, 2006.
9. Bruno Dutertre and Leonardo de Moura. Integrating simplex with DPLL(T). Technical Report SRI-CSL-06-01, Stanford Research Institute (SRI), 2006.
10. Herbert Edelsbrunner. Algorithms in combinatorial geometry. Springer-Verlag New York, Inc., New York, NY, USA, 1987.
11. E. Ezra and S. Fine. On the cover of convex polyhedra in d-space. Technical Report H-0259, IBM Haifa Research Lab, Israel, 2008.
12. th Intl. Conference on Computer Aided Verification (CAV'04), number 3114 in Lect. Notes in Comp. Sci., pages 175-188. Springer, 2004.
13. D. Haussler and E. Welzl. Epsilon-nets and simplex range queries. Computational Geometry, 2:127 - 151, 1987.
14. Dorit S. Hochbaum, editor. approximation-algorithms for NP-hard problems. PWS Publishing Company, 1997.
15. Daniel Kroening and Ofer Strichman. Decision procedures - an algorithmic point of view. Theoretical computer science. Springer-Verlag, May 2008.
16. Filip Maric and Predrag Janicic. argo-lib: A generic platform for decision procedures. In IJCAR, pages 213-217, 2004.
17. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. Design Automation Conference (DAC'01), 2001.
18. Knot Pipatsrisawat and Adnan Darwiche. Rsat 2.0: Sat solver description. SAT competition'07, 2007.
19. th Intl. Conference on Computer Aided Verification (CAV'00), Lect. Notes in Comp. Sci. Springer-Verlag, 2000.
20. th Intl. Conference on Computer Aided Verification (CAV'02), 2002.
21. C. Tinelli. A DPLL-based calculus for ground satisfiability modulo theories. In Proc. 8-th European Conference on Logics in Artificial Intelligence, volume 2424, pages 308-319. Springer, 2002.