A Modular Integration of SAT/SMT Solvers to Coq through Proof Witnesses.
Michaël ArmandGermain FaureBenjamin GrégoireChantal KellerLaurent ThéryBenjamin WernerPublished in: CPP (2011)
Keyphrases
- modulo theories
- sat solvers
- theorem prover
- answer set programming
- sat solving
- satisfiability modulo theories
- stable model semantics
- sat instances
- logic programs
- sat encodings
- data integration
- sat problem
- backtracking search
- search strategies
- satisfiability problem
- theorem proving
- propositional satisfiability
- global constraints
- quantified boolean formulas
- boolean satisfiability
- search algorithm
- constraint satisfaction
- orders of magnitude
- search space