Bisimulation through probabilistic testing
Information and Computation
Automata logics, and infinite games
Automata logics, and infinite games
The Description Logic Handbook
The Description Logic Handbook
Hybrid Logics and Ontology Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Expressive probabilistic description logics
Artificial Intelligence
Admissibility of Cut in Coalgebraic Logics
Electronic Notes in Theoretical Computer Science (ENTCS)
PSPACE bounds for rank-1 modal logics
ACM Transactions on Computational Logic (TOCL)
Managing uncertainty and vagueness in description logics for the Semantic Web
Web Semantics: Science, Services and Agents on the World Wide Web
Journal of Artificial Intelligence Research
Modular algorithms for heterogeneous modal logics
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Flat coalgebraic fixed point logics
CONCUR'10 Proceedings of the 21st international conference on Concurrency theory
Modular algorithms for heterogeneous modal logics via multi-sorted coalgebra
Mathematical Structures in Computer Science
Optimal tableau algorithms for coalgebraic logics
TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Global caching for coalgebraic description logics
IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
| Hi-index | 0.00 |
It has been recognised that the expressivity of description logics benefits from the introduction of non-standard modal operators beyond existential and number restrictions. Such operators support notions such as uncertainty, defaults, agency, obligation, or evidence, whose semantics often lies outside the realm of relational structures. Coalgebraic hybrid logic serves as a unified setting for logics that combine non-standard modal operators and nominals, which allow reasoning about individuals. In this framework, we prove a generic EXPTIME upper bound for concept satisfiability over general TBoxes, which instantiates to novel upper bounds for many individual logics including probabilistic logic with nominals.