Anytime Algorithms for Constraint Satisfaction and SAT Problems.
Richard J. WallaceEugene C. FreuderPublished in: SIGART Bull. (1996)
Keyphrases
- constraint satisfaction
- sat problem
- anytime algorithms
- constraint satisfaction problems
- phase transition
- sat solvers
- dynamic programming
- data streams
- real time systems
- heuristic search algorithms
- heuristic search
- satisfiability problem
- constraint programming
- np complete
- combinatorial problems
- davis putnam
- max sat
- search space
- solution quality
- optimal solution
- sat instances
- constraint propagation
- constraint networks
- propositional satisfiability
- probabilistic reasoning
- stochastic local search
- randomly generated
- solving hard
- arc consistency
- search problems
- backtracking search
- forward checking
- search strategies
- state space
- markov decision problems
- search algorithm
- cnf formula
- clause learning
- beam search
- industrial applications
- decision makers
- upper bound
- computational complexity