Satisfiability of Co-Nested Formulas.
Jan KratochvílMirko KrivánekPublished in: Acta Informatica (1993)
Keyphrases
- cnf formula
- satisfiability problem
- propositional formulas
- conjunctive normal form
- boolean formula
- np complete
- random sat
- propositional logic
- computational complexity
- phase transition
- terminological reasoning
- lower bound
- satisfiability testing
- hierarchical data
- max sat
- sat problem
- propositional satisfiability
- knowledge compilation
- orders of magnitude
- description logics