Parameterized Complexity and Fixed-Parameter Tractability of Description Logic Reasoning.
An important goal of research in description logics (DLs) and related logic-based KR formalisms is to identify the worst-case complexity of reasoning. Such results, however, measure the complexity of a logic as a whole. For example, reasoning in the basic DL is ExpTime-complete, which means that con...
| Autor principal: | |
|---|---|
| Otros Autores: | |
| Formato: | Journal article |
| Lenguaje: | English |
| Publicado: |
Springer
2012
|