Unsatisfiable hitting clause-sets with three more clauses than variables.
Oliver KullmannXishun ZhaoPublished in: CoRR (2016)
Keyphrases
- propositional formulas
- cnf formula
- prime implicants
- propositional variables
- boolean formula
- propositional logic
- horn clauses
- np complete
- normal form
- conjunctive normal form
- sat solvers
- boolean variables
- max sat
- search space
- sat problem
- propositional satisfiability
- truth assignment
- unsatisfiable cores
- belief revision
- lower bound
- satisfiability testing
- membership queries
- boolean functions
- clause learning
- modal logic
- inductive logic programming
- first order logic