Challenges in Satisfiability Modulo Theories

DOI10.1007/978-3-540-73449-9_2MaRDI QIDQ5432330zbMATH OpenOpenAlexFDO

Authors Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Albert Rubio

Publication date 2 January 2008

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-73449-9_2

Mathematics Subject Classification ID

Recommendations

• A survey of satisfiability modulo theory
• Satisfiability modulo theories
• Solving SAT and SAT modulo theories, from an abstract Davis-Putnam-Logemann-Loveland procedure to \(\operatorname{DPLL}(T)\)
• Foundations of satisfiability modulo theories
• A Tutorial on Satisfiability Modulo Theories

Cited in

(11)

• Constructing cycles in the simplex method for DPLL(T)
• Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint
• SAT and SMT are still resolution: questions and challenges
• Satisfiability solving and model generation for quantified first-order logic formulas
• Natural domain SMT: a preliminary assessment
• Putting ABox updates into action
• Solving constraint satisfaction problems with SAT modulo theories
• The strategy challenge in SMT solving
• A system for solving constraint satisfaction problems with SMT
• Decision Procedures for SAT, SAT Modulo Theories and Beyond. The BarcelogicTools
• CPBPV: a constraint-programming framework for bounded program verification

Describes a project that uses

Uses Software

• cvc3

This page was built for publication: Challenges in Satisfiability Modulo Theories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5432330)