Modal description logics: modalizing roles
Fundamenta Informaticae
Multi-Dimensional Description Logics
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Tableaux for Temporal Description Logic with Constant Domains
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
Alternating-time Temporal Logic
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
The description logic handbook
Implementation and optimization techniques
The description logic handbook
A Tableau Decision Procedure for $\mathcal{SHOIQ}$
Journal of Automated Reasoning
Terminological logics with modal operators
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
| Hi-index | 0.00 |
Modal description logics provide a more expressive framework than their propositional counterparts by allowing one to define the individuals and concepts of a particular application domain. In the literature, tableau decision algorithms have been given for various normal modal and temporal description logics. There is however a trend towards the use of coalition logics in the intelligent agents community. Coalition logics are extensions of the basic monotonic modal logic M which is a non-normal modal logic. This paper presents a tableau decision procedure for the formula satisfiability problem of the constant domain variant of M"A"L"C, i.e., ALC extended with modal operators from M that can be applied both to formulas and concepts. The presented algorithm can be used as the basis of a tableau decision procedure for coalition description logic.