PS\textsc{pace} tableau algorithms for acyclic modalized ALC
DOI10.1007/S10817-011-9232-3zbMATH Open1291.68387DBLPjournals/jar/TaoSH12OpenAlexW2002928961WikidataQ57015133 ScholiaQ57015133MaRDI QIDQ352965FDOQ352965
Authors: Jia Tao, Giora Slutzki, Vasant Honavar
Publication date: 5 July 2013
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10817-011-9232-3
Recommendations
Analysis of algorithms and problem complexity (68Q25) Logics of knowledge and belief (including belief change) (03B42) Logic in artificial intelligence (68T27) Mechanization of proofs and logical operations (03B35)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Handbook of modal logic
- Title not available (Why is that?)
- Practical reasoning for very expressive description logics
- Attributive concept descriptions with complements
- An epistemic operator for description logics
- Description logics of minimal knowledge and negation as failure
- A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains
- Terminological reasoning is inherently intractable
- PSpace reasoning for graded modal logics
- Reasoning in expressive description logics
- Decidable fragments of first-order modal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A multi-dimensional terminological knowledge representation language
- Title not available (Why is that?)
- Title not available (Why is that?)
- An overview of tableau algorithms for description logics
- Automata can show PSpace results for description logics
Cited In (4)
Uses Software
This page was built for publication: PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q352965)