Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning.
Boris MotikPublished in: LPAR (2012)
Keyphrases
- description logics
- fixed parameter tractable
- reasoning tasks
- computational problems
- knowledge base
- knowledge representation
- abstract argumentation
- np hard
- np complete
- conjunctive queries
- answer set programming
- temporal reasoning
- automated reasoning
- machine learning
- database
- situation calculus
- logic programming
- natural language
- database systems