First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

DOI10.1613/jair.1.13511OpenAlexW3214083543MaRDI QIDQ5870513

Alessandro Artale, Vladislav Ryzhikov, Frank Wolter, Roman Kontchakov, Alisa Kovtunova, Michael Zakharyashchev

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

zbMATH Keywords

knowledge representationtemporal reasoningdescription logics

Mathematics Subject Classification ID

Artificial intelligence (68Txx)

Related Items (3)

Temporal Minimal-World Query Answering over Sparse ABoxes ⋮ Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic ⋮ Ontology-Mediated Query Answering with Data-Tractable Description Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Towards more expressive ontology languages: the query answering problem
• On rules with existential variables: walking the decidability line
• Elements of finite model theory.
• The complexity of reasoning about knowledge and time. I: Lower bounds
• Modal languages and bounded fragments of predicate logic
• Many-dimensional modal logics: theory and applications
• Decidable fragments of first-order temporal logics
• LARS: a logic-based framework for analytic reasoning over streams
• First-order rewritability of ontology-mediated queries in linear temporal logic
• Data-complexity of the two-variable fragment with counting quantifiers
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• Temporal Logics in Computer Science
• Temporal Query Answering in the Description Logic DL-Lite
• The Complexity of Clausal Fragments of LTL
• A Cookbook for Temporal Conceptual Data Modelling with Description Logics
• Undecidable Propositional Bimodal Logics and One-Variable First-Order Linear Temporal Logics with Counting
• Ontology-Mediated Query Answering with Data-Tractable Description Logics
• An Introduction to Description Logic
• Parity, circuits, and the polynomial-time hierarchy
• Querying ATSQL databases with temporal logic
• From Church and Prior to PSL
• The DL-Lite Family and Relations
• The complexity of propositional linear temporal logics
• On metric temporal description logics
• Querying Log Data with Metric Temporal Logic
• Ontology-Mediated Queries
• Temporalizing Ontology-Based Data Access
• Ontology-Based Data Access
• Metric Temporal Description Logics with Interval-Rigid Names
• The Description Logic Handbook
• Linking Data to Ontologies
• The undecidability of the domino problem
• Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic

This page was built for publication: First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries