First-order rewritability of ontology-mediated queries in linear temporal logic

, , , , &
Artificial Intelligence 299 (C):103536 (2021)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.artint.2021.103536

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,449

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

A complete classification of the complexity and rewritability of ontology-mediated queries based on the description logic EL.Carsten Lutz & Leif Sabellek - 2022 - Artificial Intelligence 308 (C):103709.
A tetrachotomy of ontology-mediated queries with a covering axiom.Olga Gerasimova, Stanislav Kikot, Agi Kurucz, Vladimir Podolskii & Michael Zakharyaschev - 2022 - Artificial Intelligence 309 (C):103738.
Modal logic, Alexander Chagrov and Michael Zakharyaschev. [REVIEW]Valentin Goranko - 1999 - Journal of Logic, Language and Information 8 (2):255-258.
A formalization of programs in first-order logic with a discrete linear order.Fangzhen Lin - 2016 - Artificial Intelligence 235 (C):1-25.
Guarded Ontology-Mediated Queries.Pablo Barceló, Gerald Berger, Georg Gottlob & Andreas Pieris - 2021 - In Judit Madarász & Gergely Székely, Hajnal Andréka and István Németi on Unity of Science: From Computing to Relativity Theory Through Algebraic Logic. Springer. pp. 27-52.
Gödel–Dummett linear temporal logic.Juan Pablo Aguilera, Martín Diéguez, David Fernández-Duque & Brett McLean - 2025 - Artificial Intelligence 338 (C):104236.
Answering regular path queries mediated by unrestricted SQ ontologies.Víctor Gutiérrez-Basulto, Yazmín Ibáñez-García, Jean Christoph Jung & Filip Murlak - 2023 - Artificial Intelligence 314 (C):103808.
Datalog rewritability and data complexity of ALCHOIQ with closed predicates.Sanja Lukumbuzya, Magdalena Ortiz & Mantas Šimkus - 2024 - Artificial Intelligence 330 (C):104099.
Towards a characterization of order-invariant queries over tame graphs.Michael A. Benedikt & Luc Segoufin - 2009 - Journal of Symbolic Logic 74 (1):168-186.
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies.Mark Kaminski, Yavor Nenov & Bernardo Cuenca Grau - 2016 - Artificial Intelligence 236 (C):90-118.

Analytics

Added to PP
2021-05-20

Downloads
31 (#763,697)

6 months
6 (#572,300)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Weak Second‐Order Arithmetic and Finite Automata.J. Richard Büchi - 1960 - Mathematical Logic Quarterly 6 (1-6):66-92.
Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.

View all 6 references / Add more references