MathSAT: Tight Integration of SAT and Mathematical Decision Procedures.
Marco BozzanoRoberto BruttomessoAlessandro CimattiTommi A. JunttilaPeter van RossumStephan SchulzRoberto SebastianiPublished in: J. Autom. Reason. (2005)
Keyphrases
- decision procedures
- tight integration
- satisfiability problem
- theorem proving
- modal logic
- automated reasoning
- sat problem
- search algorithm
- np complete
- temporal logic
- quantified boolean formulas
- propositional satisfiability
- reasoning problems
- sat instances
- stochastic local search
- sat solvers
- tight complexity bounds
- query containment
- phase transition
- conjunctive queries
- presburger arithmetic
- orders of magnitude
- knowledge base
- databases