Parameterized Compilation Lower Bounds for Restricted CNF-formulas.
Stefan MengelPublished in: CoRR (2016)
Keyphrases
- lower bound
- cnf formula
- max sat
- knowledge compilation
- upper bound
- np complete
- branch and bound algorithm
- branch and bound
- np hard
- conjunctive normal form
- objective function
- sat problem
- search algorithm
- vc dimension
- propositional formulas
- optimization problems
- sat solvers
- constraint satisfaction
- satisfiability problem
- information retrieval
- model checking
- expert systems
- optimal solution
- knowledge base