Converting SAT Problem into Lattice Basis.
Jihad Mohamad JaamDhia HussainAhmad HasnahPublished in: IC-AI (2002)
Keyphrases
- sat problem
- satisfiability problem
- sat solvers
- np complete
- constraint satisfaction problems
- phase transition
- max sat
- sat solving
- davis putnam
- boolean satisfiability
- propositional satisfiability
- propositional logic
- sat instances
- weighted max sat
- randomly generated
- stochastic local search
- branch and bound
- information retrieval systems
- np hard
- lower bound
- search algorithm