First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries
From MaRDI portal
Publication:5870513
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
- scientific article; zbMATH DE number 747023 (Why is no real title available?)
- scientific article; zbMATH DE number 1254648 (Why is no real title available?)
- scientific article; zbMATH DE number 618821 (Why is no real title available?)
- scientific article; zbMATH DE number 1536573 (Why is no real title available?)
- scientific article; zbMATH DE number 1841824 (Why is no real title available?)
- scientific article; zbMATH DE number 839556 (Why is no real title available?)
- scientific article; zbMATH DE number 1395614 (Why is no real title available?)
- scientific article; zbMATH DE number 965572 (Why is no real title available?)
- scientific article; zbMATH DE number 2207163 (Why is no real title available?)
- scientific article; zbMATH DE number 2243392 (Why is no real title available?)
- A Cookbook for Temporal Conceptual Data Modelling with Description Logics
- An introduction to description logic
- Data-complexity of the two-variable fragment with counting quantifiers
- Decidable fragments of first-order temporal logics
- Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic
- Elements of finite model theory.
- First-order rewritability of ontology-mediated queries in linear temporal logic
- From Church and Prior to PSL
- LARS: a logic-based framework for analytic reasoning over streams
- Linking Data to Ontologies
- Many-dimensional modal logics: theory and applications
- Metric temporal description logics with interval-rigid names
- Modal languages and bounded fragments of predicate logic
- On metric temporal description logics
- On rules with existential variables: walking the decidability line
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Ontology-based data access: a study through disjunctive Datalog, CSP, and MMSNP
- Ontology-mediated queries. Combined complexity and succinctness of rewritings via circuit complexity
- Ontology-mediated query answering over temporal data: a survey (invited talk)
- Parity, circuits, and the polynomial-time hierarchy
- Querying ATSQL databases with temporal logic
- Querying log data with metric temporal logic
- Temporal Ontology-Mediated Queries and First-Order Rewritability: A Short Course
- Temporal logics in computer science. Finite-state systems
- Temporal query answering in the description logic DL-Lite
- Temporalizing ontology-based data access
- The DL-Lite Family and Relations
- The Description Logic Handbook
- The complexity of clausal fragments of LTL
- The complexity of propositional linear temporal logics
- The complexity of reasoning about knowledge and time. I: Lower bounds
- The undecidability of the domino problem
- Towards more expressive ontology languages: the query answering problem
- Tractable reasoning and efficient query answering in description logics: The DL-Lite family
- Undecidable propositional bimodal logics and one-variable first-order linear temporal logics with counting
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)
