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...
| Váldodahkki: | Motik, B |
|---|---|
| Eará dahkkit: | Bjørner, N |
| Materiálatiipa: | Journal article |
| Giella: | English |
| Almmustuhtton: |
Springer
2012
|
Geahča maid
-
Consequence-based and fixed-parameter tractable reasoning in description logics
Dahkki: Simancik, F, et al.
Almmustuhtton: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
Dahkki: Simancik, F, et al.
Almmustuhtton: (2011) -
Tractable reasoning with bayesian description logics
Dahkki: D'Amato, C, et al.
Almmustuhtton: (2008) -
Tractable Reasoning with Bayesian Description Logics
Dahkki: d'Amato, C, et al.
Almmustuhtton: (2008) -
Tractable query answering and rewriting under description logic constraints.
Dahkki: Pérez-Urbina, H, et al.
Almmustuhtton: (2010)