On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas.
Vikraman ArvindSomenath BiswasPublished in: Theor. Comput. Sci. (1989)
Keyphrases
- satisfiability problem
- cnf formula
- np complete
- sat problem
- conjunctive normal form
- max sat
- temporal logic
- phase transition
- propositional formulas
- weighted max sat
- search algorithm
- davis putnam
- constraint satisfaction problems
- pspace complete
- randomly generated
- stochastic local search algorithms
- sat instances
- np hard
- stochastic local search
- conjunctive queries
- integrity constraints
- knowledge compilation
- state space
- reinforcement learning