Linear CNF formulas and satisfiability.

Stefan Porschen Ewald Speckenmeyer Xishun Zhao

Published in: Discret. Appl. Math. (2009)

Keyphrases

cnf formula
np complete
max sat
sat problem
conjunctive normal form
satisfiability problem
knowledge compilation
davis putnam
computational complexity
database design
information retrieval
randomly generated
propositional formulas
linear constraints
propositional logic
object oriented
knowledge base