On the Parameterized Complexity of Finding Small Unsatisfiable Subsets of CNF Formulas and CSP Instances.
Ronald de HaanIyad A. KanjStefan SzeiderPublished in: ACM Trans. Comput. Log. (2017)
Keyphrases
- cnf formula
- np complete
- parameterized complexity
- sat problem
- propositional formulas
- constraint satisfaction problems
- randomly generated
- fixed parameter tractable
- random instances
- phase transition
- sat instances
- constraint satisfaction
- global constraints
- max sat
- sat solvers
- boolean formula
- np hard
- constraint propagation
- propositional satisfiability
- knowledge compilation
- propositional logic
- satisfiability problem
- bounded treewidth
- conjunctive normal form
- computational complexity
- database systems
- arc consistency
- lower bound