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...
Prif Awdur: | Motik, B |
---|---|
Awduron Eraill: | Bjørner, N |
Fformat: | Journal article |
Iaith: | English |
Cyhoeddwyd: |
Springer
2012
|
Eitemau Tebyg
-
Consequence-based and fixed-parameter tractable reasoning in description logics
gan: Simancik, F, et al.
Cyhoeddwyd: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
gan: Simancik, F, et al.
Cyhoeddwyd: (2011) -
Tractable reasoning with bayesian description logics
gan: D'Amato, C, et al.
Cyhoeddwyd: (2008) -
Tractable Reasoning with Bayesian Description Logics
gan: d'Amato, C, et al.
Cyhoeddwyd: (2008) -
Tractable query answering and rewriting under description logic constraints.
gan: Pérez-Urbina, H, et al.
Cyhoeddwyd: (2010)