P ≠ P - Why Some Reasoning Problems Are More Tractable Than Others.
Markus KrötzschPublished in: RR (2014)
Keyphrases
- reasoning problems
- tractable classes
- interval algebra
- peer to peer
- description logics
- computational properties
- decision procedures
- reasoning tasks
- constraint satisfaction problems
- tree decomposition
- overlay network
- np hard
- computational complexity
- machine learning
- np complete
- decomposition method
- theorem proving
- ontology languages
- model theoretic
- special case
- expert systems