From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain.
Roberto SebastianiPublished in: FroCoS (2007)
Keyphrases
- sat solvers
- sat problem
- propositional satisfiability
- sat solving
- propositional logic
- sat instances
- theoretical framework
- davis putnam
- boolean satisfiability
- orders of magnitude
- domain independent
- search algorithm
- np complete
- max sat
- domain specific
- satisfiability problem
- satisfiability modulo theories
- quantifier free
- search strategies
- constraint satisfaction
- first order logic
- logic programs
- lower bound