PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)

DOI10.1007/s10817-011-9232-3zbMath1291.68387DBLPjournals/jar/TaoSH12OpenAlexW2002928961WikidataQ57015133 ScholiaQ57015133MaRDI QIDQ352965

Giora Slutzki, Vasant Honavar, Jia Tao

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

zbMATH Keywords

modal logicdescription logic\(\mathcal{ALC}\)\textsc{PSpace}tableau algorithm

Mathematics Subject Classification ID

Related Items (1)

A PSpace algorithm for acyclic epistemic DL \(\mathcal{ALCS}5_m\)

Uses Software

• KL-ONE

Cites Work

• Attributive concept descriptions with complements
• Automata can show PSpace results for description logics
• An epistemic operator for description logics
• 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
• Decidable fragments of first-order modal logics
• Practical reasoning for very expressive description logics
• A multi-dimensional terminological knowledge representation language
• Description logics of minimal knowledge and negation as failure
• An overview of tableau algorithms for description logics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: PS\textsc{pace} tableau algorithms for acyclic modalized \({\mathcal{ALC}}\)