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)