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...
Yazar: | Motik, B |
---|---|
Diğer Yazarlar: | Bjørner, N |
Materyal Türü: | Journal article |
Dil: | English |
Baskı/Yayın Bilgisi: |
Springer
2012
|
Benzer Materyaller
-
Consequence-based and fixed-parameter tractable reasoning in description logics
Yazar:: Simancik, F, ve diğerleri
Baskı/Yayın Bilgisi: (2014) -
Fixed Parameter Tractable Reasoning in DLs via Decomposition.
Yazar:: Simancik, F, ve diğerleri
Baskı/Yayın Bilgisi: (2011) -
Tractable reasoning with bayesian description logics
Yazar:: D'Amato, C, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Tractable Reasoning with Bayesian Description Logics
Yazar:: d'Amato, C, ve diğerleri
Baskı/Yayın Bilgisi: (2008) -
Tractable query answering and rewriting under description logic constraints.
Yazar:: Pérez-Urbina, H, ve diğerleri
Baskı/Yayın Bilgisi: (2010)