Polynomial-time recognition of minimal unsatisfiable formulas with fixed clause-variable difference.
Herbert FleischnerOliver KullmannStefan SzeiderPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- boolean formula
- unsatisfiable cores
- cnf formula
- sat solvers
- practical problems
- np complete
- boolean variables
- conjunctive normal form
- recognition rate
- read once formulas
- boolean satisfiability
- max sat
- recognition accuracy
- membership queries
- pattern recognition
- object recognition
- linear constraints
- sat problem
- equivalence queries
- propositional formulas
- sat instances
- recognition algorithm
- action recognition
- automatic recognition
- special case
- binary decision diagrams
- activity recognition
- prime implicants
- hidden structure
- boolean functions
- feature extraction
- propositional satisfiability
- orders of magnitude
- approximation algorithms
- recognition process
- search space
- davis putnam
- polynomial hierarchy
- computational complexity