Login / Signup
Satisfiability of Almost Disjoint CNF Formulas
Dominik Scheder
Published in:
CoRR (2008)
Keyphrases
</>
cnf formula
np complete
max sat
sat problem
knowledge compilation
conjunctive normal form
davis putnam
propositional formulas
cellular automata
state space
np hard
search strategy
particle swarm optimization
information extraction
sat instances
boolean formula
computational complexity