Decision heuristic for Davis Putnam, Loveland and Logemann algorithm satisfiability solving based on cube subtraction.
Romanelli Lodron ZuimJosé T. de SousaClaudionor CoelhoPublished in: IET Comput. Digit. Tech. (2008)
Keyphrases
- davis putnam
- satisfiability problem
- propositional logic
- propositional satisfiability
- tree search
- sat problem
- optimal solution
- learning algorithm
- phase transition
- stochastic local search
- computational complexity
- search algorithm
- search strategy
- dynamic programming
- random sat
- constraint satisfaction
- cnf formula
- decision procedures
- industrial applications
- search space
- max sat
- simulated annealing
- automated reasoning
- temporal logic
- combinatorial optimization
- monte carlo
- constraint propagation
- logic programs
- search tree
- np complete
- sat instances
- cellular automata
- search strategies
- belief revision
- clause learning
- path planning