Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic

DOI10.4230/lipics.time.2021.10OpenAlexW3202377862MaRDI QIDQ6080274

Yury Savateev, Vladislav Ryzhikov, Michael Zakharyashchev

Publication date: 2 October 2023

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2021/14786/pdf/LIPIcs-TIME-2021-10.pdf/

zbMATH Keywords

linear temporal logicfirst-order rewritabilityontology-mediated query

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Specification and verification (program logics, model checking, etc.) (68Q60) Temporal logic (03B44)

Related Items (2)

Deciding FO-definability of regular languages ⋮ First-Order Rewritability and Complexity of Two-Dimensional Temporal Ontology-Mediated Queries

This page was built for publication: Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic