First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
From MaRDI portal
Publication:5870513
DOI10.1613/JAIR.1.13511OpenAlexW3214083543WikidataQ130919340 ScholiaQ130919340MaRDI QIDQ5870513FDOQ5870513
Authors: Alessandro Artale, Roman Kontchakov, Alisa Kovtunova, Vladislav Ryzhikov, F. Wolter, Michael Zakharyaschev 
Publication date: 9 January 2023
Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2111.06806
Recommendations
- Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Temporalizing ontology-based data access
- Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
- A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic \(\mathcal{EL}\)
- Ontology-mediated query answering over temporal data: a survey (invited talk)
Cites Work
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- The DL-Lite Family and Relations
- Title not available (Why is that?)
- Linking Data to Ontologies
- Modal languages and bounded fragments of predicate logic
- Many-dimensional modal logics: theory and applications
- The complexity of propositional linear temporal logics
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Description Logic Handbook
- Title not available (Why is that?)
- Elements of finite model theory.
- Title not available (Why is that?)
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Parity, circuits, and the polynomial-time hierarchy
- The undecidability of the domino problem
- Title not available (Why is that?)
- Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
- Title not available (Why is that?)
- On rules with existential variables: walking the decidability line
- Decidable fragments of first-order temporal logics
- Towards more expressive ontology languages: the query answering problem
- Title not available (Why is that?)
- The complexity of reasoning about knowledge and time. I: Lower bounds
- From Church and Prior to PSL
- Title not available (Why is that?)
- Temporal logics in computer science. Finite-state systems
- LARS: a logic-based framework for analytic reasoning over streams
- An introduction to description logic
- Querying ATSQL databases with temporal logic
- The complexity of clausal fragments of LTL
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course
- Querying log data with metric temporal logic
- Data-complexity of the two-variable fragment with counting quantifiers
- Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
- On metric temporal description logics
- First-order rewritability of ontology-mediated queries in linear temporal logic
- Temporal query answering in the description logic DL-Lite
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- Temporalizing ontology-based data access
- Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
- Metric temporal description logics with interval-rigid names
- Ontology-mediated query answering over temporal data: a survey (invited talk)
Cited In (4)
- Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic
- Temporal Minimal-World Query Answering over Sparse ABoxes
This page was built for publication: First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5870513)
