Using SAT-Solvers to Compute Inference-Proof Database Instances.
Cornelia TadrosLena WiesePublished in: DPM/SETOP (2009)
Keyphrases
- sat solvers
- propositional satisfiability
- sat instances
- clause learning sat solvers
- backtrack search
- sat problem
- max sat
- sat solving
- randomly generated
- orders of magnitude
- boolean satisfiability
- search tree
- propositional logic
- search strategies
- constraint satisfaction
- search space
- weighted max sat
- max sat solver
- genetic algorithm
- satisfiability problem
- boolean formula
- linear programming
- lower bound