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...
Príomhchruthaitheoir: | Motik, B |
---|---|
Rannpháirtithe: | Bjørner, N |
Formáid: | Journal article |
Teanga: | English |
Foilsithe / Cruthaithe: |
Springer
2012
|
Míreanna comhchosúla
Míreanna comhchosúla
-
Consequence-based and fixed-parameter tractable reasoning in description logics
de réir: Simancik, F, et al.
Foilsithe / Cruthaithe: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
de réir: Simancik, F, et al.
Foilsithe / Cruthaithe: (2011) -
Tractable reasoning with bayesian description logics
de réir: D'Amato, C, et al.
Foilsithe / Cruthaithe: (2008) -
Tractable Reasoning with Bayesian Description Logics
de réir: d'Amato, C, et al.
Foilsithe / Cruthaithe: (2008) -
Tractable query answering and rewriting under description logic constraints.
de réir: Pérez-Urbina, H, et al.
Foilsithe / Cruthaithe: (2010)