A Model-Constructing Satisfiability Calculus
Authors:
- 1 January 2013
- book chapter
- Published by Springer Nature
- p. 1-12
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Solving Non-linear Arithmetic2012
- Cutting to the Chase Solving Linear Integer Arithmetic2011
- Natural Domain SMT: A Preliminary AssessmentLecture Notes in Computer Science, 2010
- Boolean satisfiability from theoretical hardness to practical successCommunications of the ACM, 2009
- Generalizing DPLL to Richer Logics2009
- Conflict Resolution2009
- Lemmas on demand for the extensional theory of arrays2008
- Model-based Theory CombinationElectronic Notes in Theoretical Computer Science, 2008
- Architecting Solvers for SAT Modulo Theories: Nelson-Oppen with DPLL2007
- Splitting on Demand in SAT Modulo Theories2006