Heuristic-Based Backtracking Relaxation for Propositional Satisfiability.
Ateet BhallaInês LynceJosé T. de SousaJoão Marques-SilvaPublished in: J. Autom. Reason. (2005)
Keyphrases
- propositional satisfiability
- variable ordering
- clause learning
- sat solvers
- propositional logic
- constraint programming
- constraint satisfaction
- automated reasoning
- industrial applications
- solving hard
- search tree
- sat problem
- search space
- davis putnam
- constraint propagation
- max sat
- sat instances
- search algorithm
- bayesian networks
- constraint satisfaction problems
- unit propagation
- genetic algorithm
- tree search
- search strategies
- first order logic
- information retrieval systems
- expert systems
- objective function
- information retrieval