Lazy proofs for DPLL(T)-based SMT solvers.
Guy KatzClark W. BarrettCesare TinelliAndrew ReynoldsLiana HadareanPublished in: FMCAD (2016)
Keyphrases
- sat solvers
- clause learning
- sat solving
- modulo theories
- sat instances
- satisfiability modulo theories
- orders of magnitude
- propositional satisfiability
- constraint satisfaction
- search space
- search tree
- sat problem
- statistical machine translation
- theorem proving
- max sat
- propositional logic
- theorem prover
- satisfiability problem
- first order logic
- boolean satisfiability
- mathematical proofs
- search strategies
- answer set programming
- lazy learning
- constraint solver
- np complete
- multiply sectioned bayesian networks
- equational theories
- quantified boolean formulas
- constraint satisfaction problems
- sat encodings
- natural deduction
- decision procedures
- randomly generated