On SAT modulo theories and optimization problems

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

Volumn 4121 LNCS, Issue , 2006, Pages 156-169

  Nieuwenhuis, Robert ^b   Oliveras, Albert ^a  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SOFTWARE; FORMAL LOGIC; HEURISTIC METHODS; INTEGER PROGRAMMING; OPTIMIZATION;

DIFFERENCE LOGICS; SATISFIABILITY MODULO THEORIES (SMT); SOFTWARE VERIFICATION;

PROBLEM SOLVING;

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

References (19)

1. [ARMS02] F. A. Aloul, A. Ramani, I. L. Markov, and K. A. Sakallah. PBS: A backtrack-scarch pseudo-boolean solver and optimizer. In SAT'02. LNCS, pp. 346-353.
2. [BdMS05] C. Barrett, L. de Moura, and A. Stump. SMT-COMP: Satisfiability Modulo Theories Competition. In CAV'05, LNCS 3576, pp. 20-23. http://www.csl.sri.com/users/demoura/smt-comp/
3. [CdGL99] B. Cabon, S. de Givry, L. Lobjois, T. Schiex, and J. P. Warners. Radio link frequency assignment. Constraints, 4(1):79-89, 1999.
4. [CMSM04] S. Colton. A. Meier. V. Sorge, and R. McCasland. Automatic generation of classification theorems for finite algebras. In IJCAR'04, LNCS 3097, pp. 400-414.
5. [dGHZL05] S. de Givry, F. Heras, M. Zytnicki, and J. Larrosa. Existential arc consistency: Getting closer to full arc consistency in weighted CSPs. In IJCAI'05, pp. 84-89, 2005.
6. [dGLMSO3] Simon de Givry, Javier Larrosa, Pedro Meseguer, and Thomas Schiex. Solving max-sat as weighted csp. In CP'03, LNCS 2833, 363-376, 2003.
7. [DLL62] M. Davis, G. Logemann, and D. Loveland. A machine program for theorem-proving. Comm. of the ACM, 5(7):394-397, 1962.
8. [DP60] M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the ACM, 7:201-215, 1960.
9. [ES06] N. Eén and N. Sörensson. Translating pseudo-boolean constraints into SAT. Journal on Satisfiability, Boolean Modeling and Computation. 2:1-26, 2006.
10. [GHN + 04] H, Ganzinger, G. Hagen, R., Nieuwenhuis, A. Oliveras, and C. Tinelli. DPLL(T): Fast. Decision Procedures. In CAV'04, LNCS 3114, 175-188.
11. [LH05] J. Larrosa and F. Heras, Resolution in Max-SAT and its relation to local consistency in weighted CSPs. In IJCAI'05, pp. 193-198, 2005.
12. [LMP05] C. Li, F. Manyà, and J. Planes. Solving Over-Constrained Problems with SAT. In CP'05, LNCS 3709, pp. 403-414.
13. [MMZ+01] M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In DAC'01, 2001.
14. [NO05] R. Nieuwenhuis and A. Oliveras. DPLL(T) with Exhaustive Theory Propagation and its Application to Difference Logic. In CAV'05 LNCS 3576, pp. 321-334.
15. [NOT05] R. Nieuwenhuis, A. Oliveras, and C. Tinelli. Abstract DPLL and Abstract DPLL Modulo Theories. In LPAR'04, LNAI 3452, pp. 36-50.
16. [SPSP05] H. Sheini, B. Peintner, K. Sakallah, and M. Pollack. On solving soft temporal constraints using SAT techniques. In CP'05, LNCS 3709. pp. 607-621.
17. [SS06] H. M. Sheini and K. A. Sakallah. Pueblo: A hybrid pseudo-boolean SAT solver. J. Satisfiability. Boolean Modeling and, Comp., 2:.165-189, 2006.
18. [TR05] C. Tinelli and S. Ranise. SMT-LIB: The Satisfiability Modulo Theories Library, July 2005. http://goedel.cs.uiowa.edu/smtlib/.
19. [XZ05] Z. Xing and W. Zhang. Maxsolver: an efficient exact algorithm for (weighted) maximum satisfiability. Artif. Intell, 164(1-2):47-80, 2005.