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)