Generality in artificial intelligence
Communications of the ACM
Contexts: a formalization and some applications
Contexts: a formalization and some applications
Journal of the ACM (JACM)
The description logic handbook: theory, implementation, and applications
The description logic handbook: theory, implementation, and applications
A decidable multi-modal logic of context
Journal of Applied Logic
Temporalising Tractable Description Logics
TIME '07 Proceedings of the 14th International Symposium on Temporal Representation and Reasoning
Temporal Description Logics: A Survey
TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Multi-dimensional description logics
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Terminological logics with modal operators
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Fundamenta Informaticae
Contextualized knowledge repositories for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
A strongly-local contextual logic
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
We develop a novel description logic (DL) for representing and reasoning with contextual knowledge. Our approach descends from McCarthy's tradition of treating contexts as formal objects over which one can quantify and express first-order properties. As a foundation we consider several common product-like combinations of DLs with multimodal logics and adopt the prominent (Kn)ALC. We then extend it with a second sort of vocabulary for describing contexts, i.e., objects of the second dimension. In this way, we obtain a two-sorted, two-dimensional combination of a pair of DLs ALC, called ALCALC. As our main technical result, we show that the satisfiability problem in this logic, as well as in its proper fragment (Kn)ALC with global TBoxes and local roles, is 2EX- PTIME-complete. Hence, the surprising conclusion is that the significant increase in the expressiveness of ALCALC due to adding the vocabulary comes for no substantial price in terms of its worst-case complexity.