Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing.
Ondrej CepekPetr KuceraPublished in: Discret. Appl. Math. (2005)
Keyphrases
- recognition accuracy
- recognition rate
- object recognition
- tractable classes
- recognition algorithm
- pattern recognition
- automatic recognition
- np hard
- action recognition
- satisfiability problem
- sat solvers
- feature extraction
- logic programs
- sat instances
- search space
- constraint satisfaction problems
- recognition process
- horn clauses