1 Search Results for "Savateev, Yury"

Document
DOI: 10.4230/LIPIcs.TIME.2021.10
Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic

Authors: Vladislav Ryzhikov, Yury Savateev, and Michael Zakharyaschev

Published in: LIPIcs, Volume 206, 28th International Symposium on Temporal Representation and Reasoning (TIME 2021)

Abstract
Our concern is the problem of determining the data complexity of answering an ontology-mediated query (OMQ) given in linear temporal logic LTL over (ℤ, <) and deciding whether it is rewritable to an FO(<)-query, possibly with extra predicates. First, we observe that, in line with the circuit complexity and FO-definability of regular languages, OMQ answering in AC⁰, ACC⁰ and NC¹ coincides with FO(<,≡)-rewritability using unary predicates x ≡ 0 (mod n), FO(<,MOD)-rewritability, and FO(RPR)-rewritability using relational primitive recursion, respectively. We then show that deciding FO(<)-, FO(<,≡)- and FO(<,MOD)-rewritability of LTL OMQs is ExpSpace-complete, and that these problems become PSpace-complete for OMQs with a linear Horn ontology and an atomic query, and also a positive query in the cases of FO(<)- and FO(<,≡)-rewritability. Further, we consider FO(<)-rewritability of OMQs with a binary-clause ontology and identify OMQ classes, for which deciding it is PSpace-, Π₂^p- and coNP-complete.
Cite as

Vladislav Ryzhikov, Yury Savateev, and Michael Zakharyaschev. Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic. In 28th International Symposium on Temporal Representation and Reasoning (TIME 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 206, pp. 10:1-10:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)

Copy BibTex To Clipboard

@InProceedings{ryzhikov_et_al:LIPIcs.TIME.2021.10,
  author =	{Ryzhikov, Vladislav and Savateev, Yury and Zakharyaschev, Michael},
  title =	{{Deciding FO-Rewritability of Ontology-Mediated Queries in Linear Temporal Logic}},
  booktitle =	{28th International Symposium on Temporal Representation and Reasoning (TIME 2021)},
  pages =	{10:1--10:15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-206-8},
  ISSN =	{1868-8969},
  year =	{2021},
  volume =	{206},
  editor =	{Combi, Carlo and Eder, Johann and Reynolds, Mark},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.TIME.2021.10},
  URN =		{urn:nbn:de:0030-drops-147867},
  doi =		{10.4230/LIPIcs.TIME.2021.10},
  annote =	{Keywords: Linear temporal logic, ontology-mediated query, first-order rewritability}
}
  • Refine by Author
  • 1 Ryzhikov, Vladislav
  • 1 Savateev, Yury
  • 1 Zakharyaschev, Michael

  • Refine by Classification
  • 1 Theory of computation → Modal and temporal logics

  • Refine by Keyword
  • 1 Linear temporal logic
  • 1 first-order rewritability
  • 1 ontology-mediated query

  • Refine by Type
  • 1 document

  • Refine by Publication Year
  • 1 2021

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact