Modelling More Realistic SAT Problems.
Andrew SlaterPublished in: Australian Joint Conference on Artificial Intelligence (2002)
Keyphrases
- sat problem
- satisfiability problem
- constraint satisfaction problems
- sat solvers
- np complete
- randomly generated
- phase transition
- sat instances
- sat solving
- stochastic local search
- boolean satisfiability
- max sat
- decision problems
- davis putnam
- propositional satisfiability
- solving hard
- branch and bound
- search algorithm
- orders of magnitude
- knowledge representation
- np complete problems
- information retrieval