Challenges in Satisfiability Modulo Theories
From MaRDI portal
Publication:5432330
DOI10.1007/978-3-540-73449-9_2zbMath1203.68189MaRDI QIDQ5432330
Robert Nieuwenhuis, Albert Oliveras, Albert Rubio, Enric Rodríguez-Carbonell
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
Related Items
Solving constraint satisfaction problems with SAT modulo theories, CPBPV: a constraint-programming framework for bounded program verification, Extending SMT solvers with support for finite domain \texttt{alldifferent} constraint, Satisfiability Solving and Model Generation for Quantified First-Order Logic Formulas, Putting ABox Updates into Action
Uses Software