On the Computational Complexity of Read once Resolution Decidability in 2CNF Formulas.
Hans Kleine BüningPiotr J. WojciechowskiK. SubramaniPublished in: TAMC (2017)
Keyphrases
- cnf formula
- computational complexity
- np complete
- max sat
- propositional formulas
- sat problem
- description logics
- search algorithm
- special case
- lower bound
- conjunctive normal form
- np hard
- tabu search
- sat solvers
- satisfiability problem
- branch and bound
- decision problems
- branch and bound algorithm
- phase transition
- constraint satisfaction problems
- boolean formula
- clause learning
- davis putnam
- database
- constraint satisfaction
- search space
- neural network
- automated reasoning
- randomly generated
- cellular automata
- evolutionary algorithm