The satisfiability problem in regular CNF-formulas.
Felip ManyàRamón BéjarGonzalo Escalada-ImazPublished in: Soft Comput. (1998)
Keyphrases
- satisfiability problem
- cnf formula
- np complete
- sat problem
- max sat
- davis putnam
- conjunctive normal form
- search algorithm
- phase transition
- stochastic local search
- temporal logic
- sat instances
- computational complexity
- randomly generated
- stochastic local search algorithms
- weighted max sat
- constraint satisfaction problems
- np hard
- propositional satisfiability
- bounded treewidth
- propositional formulas
- cellular automata
- lower bound
- optimal solution