Polynomial-Time Recognition of Minimal Unsatisfiable Formulas with Fixed Clause-Variable Difference
Herbert FleischnerStefan SzeiderPublished in: Electron. Colloquium Comput. Complex. (2000)
Keyphrases
- boolean formula
- unsatisfiable cores
- cnf formula
- sat solvers
- np complete
- practical problems
- boolean variables
- read once formulas
- recognition rate
- conjunctive normal form
- boolean satisfiability
- object recognition
- automatic recognition
- linear constraints
- membership queries
- recognition accuracy
- pattern recognition
- max sat
- equivalence queries
- binary decision diagrams
- recognition algorithm
- sat problem
- hidden structure
- phase transition
- constraint satisfaction
- orders of magnitude
- fixed parameter tractable
- description logics
- truth assignment
- recognition process