Solving Satisfiability using Decomposition and the Most Constrained Subproblem (Preliminary Report).
Eyal AmirSheila McllraithPublished in: Electron. Notes Discret. Math. (2001)
Keyphrases
- constrained problems
- integer program
- dynamic programming
- integer programming
- sat encodings
- stochastic local search
- np complete
- davis putnam logemann loveland
- search heuristics
- computational complexity
- phase transition
- cost function
- relational databases
- neural network
- quantified boolean formulas
- terminological reasoning
- data sets