Fixpoints in temporal description logics

Authors:
Enrico Franconi;David Toman
Affiliations:
Faculty of Computer Science, Free University of Bozen-Bolzano, Italy;D.R. Chariton School of Computer Science, University of Waterloo, Canada
Venue:
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Year:
2011

Citing 6
Cited 1

A temporal fixpoint calculus

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Monodic fragments of first-order temporal logics: 2000-2001 A.D

LPAR '01 Proceedings of the Artificial Intelligence on Logic for Programming
The Propositional Mu-Calculus is Elementary

Proceedings of the 11th Colloquium on Automata, Languages and Programming
A Temporal Description Logic for Reasoning over Conceptual Schemas and Queries

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Temporal Description Logics: A Survey

TIME '08 Proceedings of the 2008 15th International Symposium on Temporal Representation and Reasoning
Reasoning in expressive description logics with fixpoints based on automata on infinite trees

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1

Temporal description logic for ontology-based data access

IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a decidable fixpoint extension of temporal description logics. To this end we employ and extend decidability results obtained for various temporally first-order monodic extensions of (firstorder) description logics. Using these techniques we obtain decidability and tight complexity results for various fixpoint extensions of temporal description logics.