First-order rewritability of ontology-mediated queries in linear temporal logic
From MaRDI portal
Publication:2238711
DOI10.1016/j.artint.2021.103536OpenAlexW3016366169MaRDI QIDQ2238711
Vladislav Ryzhikov, Alessandro Artale, Alisa Kovtunova, Roman Kontchakov, Frank Wolter, Michael Zakharyashchev
Publication date: 2 November 2021
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.07221
description logiclinear temporal logicdata complexityontology-based data accessfirst-order rewritability
Related Items
Deciding FO-rewritability of Regular Languages and Ontology-Mediated Queries in Linear Temporal Logic, Deciding FO-definability of regular languages, 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
- On rules with existential variables: walking the decidability line
- A closed-form evaluation for Datalog queries with integer (gap)-order constraints
- Elements of finite model theory.
- Unary finite automata vs. arithmetic progressions
- Finite automata and unary languages
- Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
- On the size of refutation Kripke models for some linear modal and tense logics
- The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
- Many-dimensional modal logics: theory and applications
- Metric temporal description logics with interval-rigid names
- 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
- Ontology-Mediated Query Answering with Data-Tractable Description Logics
- Modality and quantification in S5
- Weak Second‐Order Arithmetic and Finite Automata
- Temporal logic can be more expressive
- Parity, circuits, and the polynomial-time hierarchy
- From Church and Prior to PSL
- The DL-Lite Family and Relations
- The complexity of propositional linear temporal logics
- Decision Problems of Finite Automata Design and Related Arithmetics
- Datalog with integer periodicity constraints
- A Normal Form for Temporal Logics and its Applications in Theorem-Proving and Execution
- On metric temporal description logics
- Querying Log Data with Metric Temporal Logic
- Ontology-Mediated Queries
- Temporalizing Ontology-Based Data Access
- Ontology-Based Data Access
- Computational Complexity
- A Proof of Kamp's theorem
- Finite automata and the logic of one-place predicates
- Clausal temporal resolution
