A Cookbook for Temporal Conceptual Data Modelling with Description Logics
From MaRDI portal
Abstract: We design temporal description logics suitable for reasoning about temporal conceptual data models and investigate their computational complexity. Our formalisms are based on DL-Lite logics with three types of concept inclusions (ranging from atomic concept inclusions and disjointness to the full Booleans), as well as cardinality constraints and role inclusions. In the temporal dimension, they capture future and past temporal operators on concepts, flexible and rigid roles, the operators `always' and `some time' on roles, data assertions for particular moments of time and global concept inclusions. The logics are interpreted over the Cartesian products of object domains and the flow of time (Z,<), satisfying the constant domain assumption. We prove that the most expressive of our temporal description logics (which can capture lifespan cardinalities and either qualitative or quantitative evolution constraints) turn out to be undecidable. However, by omitting some of the temporal operators on concepts/roles or by restricting the form of concept inclusions we obtain logics whose complexity ranges between PSpace and NLogSpace. These positive results were obtained by reduction to various clausal fragments of propositional temporal logic, which opens a way to employ propositional or first-order temporal provers for reasoning about temporal data models.
Recommendations
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- scientific article; zbMATH DE number 1931652
- Temporalizing description logics
- Time-dependent concepts: representation and reasoning using temporal description logics
- A survey of temporal extensions of description logics
- Foundations of Temporal Conceptual Data Models
- Temporally attributed description logics
- A Correspondence between Temporal Description Logics
Cites work
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- A propositional modal logic of time intervals
- A survey of temporal extensions of description logics
- A tableau decision algorithm for modalized A L C with constant domains
- Automated Reasoning
- Clausal temporal resolution
- Conceptual Modeling for Traditional and Spatio-Temporal Applications
- Decidable fragments of first-order temporal logics
- DL-Lite with temporalised concepts, rigid axioms and roles
- Dynamic constraints and object migration
- Evolving objects in temporal information systems
- Finite automata and unary languages
- Foundations of Temporal Conceptual Data Models
- scientific article; zbMATH DE number 3940713 (Why is no real title available?)
- scientific article; zbMATH DE number 67448 (Why is no real title available?)
- scientific article; zbMATH DE number 3523640 (Why is no real title available?)
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1249651 (Why is no real title available?)
- scientific article; zbMATH DE number 1348742 (Why is no real title available?)
- scientific article; zbMATH DE number 610968 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 194561 (Why is no real title available?)
- scientific article; zbMATH DE number 1931652 (Why is no real title available?)
- scientific article; zbMATH DE number 1903365 (Why is no real title available?)
- scientific article; zbMATH DE number 1400210 (Why is no real title available?)
- Implementing a fair monodic temporal logic prover
- Linking Data to Ontologies
- LTL over description logic axioms
- Many-dimensional modal logics: theory and applications
- Monodic temporal resolution
- On the size of refutation Kripke models for some linear modal and tense logics
- Past is for free: On the complexity of verifying linear temporal properties with past
- Products of ‘transitive” modal logics
- Querying ATSQL databases with temporal logic
- Reasoning in expressive description logics
- Reasoning on UML class diagrams
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- Temporal Logic with Capacity Constraints
- Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
- Temporal logic. Vol. 2. Mathematical foundations and computational aspects
- Temporal logics over linear time domains are in PSPACE
- Temporal query answering in the description logic DL-Lite
- Temporalising tableaux
- Temporalizing ontology-based data access
- The complexity of decomposing modal and first-order theories
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- The complexity of propositional linear temporal logics in simple cases
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- The DL-Lite Family and Relations
- Time-dependent concepts: representation and reasoning using temporal description logics
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Unary finite automata vs. arithmetic progressions
Cited in
(20)- First-order rewritability of ontology-mediated queries in linear temporal logic
- On coarser interval temporal logics
- Evolving objects in temporal information systems
- Sub-propositional fragments of the interval temporal logic of Allen's relations
- LTL over description logic axioms
- Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- Foundations of Temporal Conceptual Data Models
- DL-Lite with temporalised concepts, rigid axioms and roles
- Time-dependent concepts: representation and reasoning using temporal description logics
- scientific article; zbMATH DE number 6917935 (Why is no real title available?)
- scientific article; zbMATH DE number 1931652 (Why is no real title available?)
- scientific article; zbMATH DE number 7439733 (Why is no real title available?)
- First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
- Towards World Identification in Description Logics
- Temporal Minimal-World Query Answering over Sparse ABoxes
- First-order temporal logic on finite traces: semantic properties, decidable fragments, and applications
- On deciding the data complexity of answering linear monadic Datalog queries with ltl operators
- Reasoning on temporal class diagrams: Undecidability results
This page was built for publication: A Cookbook for Temporal Conceptual Data Modelling with Description Logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946734)
