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...
Hlavní autor: | Motik, B |
---|---|
Další autoři: | Bjørner, N |
Médium: | Journal article |
Jazyk: | English |
Vydáno: |
Springer
2012
|
Podobné jednotky
-
Consequence-based and fixed-parameter tractable reasoning in description logics
Autor: Simancik, F, a další
Vydáno: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
Autor: Simancik, F, a další
Vydáno: (2011) -
Tractable reasoning with bayesian description logics
Autor: D'Amato, C, a další
Vydáno: (2008) -
Tractable Reasoning with Bayesian Description Logics
Autor: d'Amato, C, a další
Vydáno: (2008) -
Tractable query answering and rewriting under description logic constraints.
Autor: Pérez-Urbina, H, a další
Vydáno: (2010)