On the computational complexity of read once resolution decidability in 2CNF formulas.
Hans Kleine BüningPiotr J. WojciechowskiK. SubramaniPublished in: CoRR (2016)
Keyphrases
- cnf formula
- np complete
- computational complexity
- max sat
- propositional formulas
- sat problem
- boolean formula
- constraint satisfaction problems
- np hard
- conjunctive normal form
- satisfiability problem
- query answering
- tabu search
- sat solvers
- description logics
- special case
- search algorithm
- branch and bound algorithm
- branch and bound
- randomly generated
- constraint satisfaction
- knowledge compilation
- database systems
- clause learning
- linear programming
- davis putnam