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...
Үндсэн зохиолч: | Motik, B |
---|---|
Бусад зохиолчид: | Bjørner, N |
Формат: | Journal article |
Хэл сонгох: | English |
Хэвлэсэн: |
Springer
2012
|
Ижил төстэй зүйлс
Ижил төстэй зүйлс
-
Consequence-based and fixed-parameter tractable reasoning in description logics
-н: Simancik, F, зэрэг
Хэвлэсэн: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
-н: Simancik, F, зэрэг
Хэвлэсэн: (2011) -
Tractable reasoning with bayesian description logics
-н: D'Amato, C, зэрэг
Хэвлэсэн: (2008) -
Tractable Reasoning with Bayesian Description Logics
-н: d'Amato, C, зэрэг
Хэвлэсэн: (2008) -
Tractable query answering and rewriting under description logic constraints.
-н: Pérez-Urbina, H, зэрэг
Хэвлэсэн: (2010)