A Cookbook for Temporal Conceptual Data Modelling with Description Logics
From MaRDI portal
Publication:2946734
DOI10.1145/2629565zbMath1354.68245arXiv1209.5571OpenAlexW1980167179WikidataQ62048607 ScholiaQ62048607MaRDI QIDQ2946734
Roman Kontchakov, Vladislav Ryzhikov, Alessandro Artale, Michael Zakharyashchev
Publication date: 17 September 2015
Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5571
Related Items (10)
Towards World Identification in Description Logics ⋮ Sub-propositional Fragments of the Interval Temporal Logic of Allen’s Relations ⋮ Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics ⋮ Unnamed Item ⋮ First-order rewritability of ontology-mediated queries in linear temporal logic ⋮ Unnamed Item ⋮ On coarser interval temporal logics ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unary finite automata vs. arithmetic progressions
- A decision procedure for combinations of propositional temporal logic and other specialized theories
- Finite automata and unary languages
- On the size of refutation Kripke models for some linear modal and tense logics
- The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
- Temporal logic. 1st International Conference, ICTL '94, Bonn, Germany, July 11-14, 1994. Proceedings
- Dynamic constraints and object migration
- Many-dimensional modal logics: theory and applications
- Decidable fragments of first-order temporal logics
- A survey of temporal extensions of description logics
- Temporalising tableaux
- The complexity of propositional linear temporal logics in simple cases
- A tableau decision algorithm for modalized \(\mathcal A\mathcal L\mathcal C\) with constant domains
- Past is for free: On the complexity of verifying linear temporal properties with past
- Evolving objects in temporal information systems
- Reasoning on UML class diagrams
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Temporal Query Answering in the Description Logic DL-Lite
- LTL over description logic axioms
- Tailoring Temporal Description Logics for Reasoning over Temporal Conceptual Models
- Querying ATSQL databases with temporal logic
- Temporal Logic with Capacity Constraints
- Implementing a fair monodic temporal logic prover
- Temporal Logics over Linear Time Domains Are in PSPACE
- The Complexity of Generalized Satisfiability for Linear Temporal Logic
- Foundations of Temporal Conceptual Data Models
- The DL-Lite Family and Relations
- DL-Lite with Temporalised Concepts, Rigid Axioms and Roles
- A propositional modal logic of time intervals
- Time-dependent concepts: representation and reasoning using temporal description logics
- Temporalizing Ontology-Based Data Access
- Monodic temporal resolution
- Automated Reasoning
- Linking Data to Ontologies
- Conceptual Modeling for Traditional and Spatio-Temporal Applications
- Products of ‘transitive” modal logics
- Clausal temporal resolution
- The Complexity of Decomposing Modal and First-Order Theories
This page was built for publication: A Cookbook for Temporal Conceptual Data Modelling with Description Logics
