Equivalency reasoning to solve a class of hard SAT problems.
Chu Min LiPublished in: Inf. Process. Lett. (2000)
Keyphrases
- sat problem
- solving hard
- propositional satisfiability
- randomly generated
- knowledge representation
- constraint satisfaction problems
- satisfiability problem
- sat solvers
- combinatorial problems
- search algorithm
- boolean satisfiability
- propositional logic
- search problems
- automated reasoning
- cnf formula
- constraint programming
- np complete
- information retrieval
- davis putnam
- backtracking search