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

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,261

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

Towards a characterization of order-invariant queries over tame graphs.Michael A. Benedikt & Luc Segoufin - 2009 - Journal of Symbolic Logic 74 (1):168-186.
Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
Adding a temporal dimension to a logic system.Marcelo Finger & Dov M. Gabbay - 1992 - Journal of Logic, Language and Information 1 (3):203-233.
Axiomatising first-order temporal logic: Until and since over linear time.Mark Reynolds - 1996 - Studia Logica 57 (2-3):279 - 302.
Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.
Normalizable linear orders and generic computations in finite models.Alexei P. Stolboushkin & Michael A. Taitslin - 1999 - Archive for Mathematical Logic 38 (4-5):257-271.
Games for query inseparability of description logic knowledge bases.Elena Botoeva, Roman Kontchakov, Vladislav Ryzhikov, Frank Wolter & Michael Zakharyaschev - 2016 - Artificial Intelligence 234 (C):78-119.
Definability with a predicate for a semi-linear set.Michael Benedikt & H. Jerome Keisler - 2003 - Journal of Symbolic Logic 68 (1):319-351.
On Relation Between Linear Temporal Logic and Quantum Finite Automata.Amandeep Singh Bhatia & Ajay Kumar - 2020 - Journal of Logic, Language and Information 29 (2):109-120.
The serializability problem for a temporal logic of transaction queries.Walter Hussak - 2008 - Journal of Applied Non-Classical Logics 18 (1):67-78.
Temporal non-commutative logic: Expressing time, resource, order and hierarchy.Norihiro Kamide - 2009 - Logic and Logical Philosophy 18 (2):97-126.
Temporalising tableaux.Roman Kontchakov, Carsten Lutz, Frank Wolter & Michael Zakharyaschev - 2004 - Studia Logica 76 (1):91 - 134.
Logic-based ontology comparison and module extraction, with an application to DL-Lite.Roman Kontchakov, Frank Wolter & Michael Zakharyaschev - 2010 - Artificial Intelligence 174 (15):1093-1141.
Axiomatizing the monodic fragment of first-order temporal logic.Frank Wolter & Michael Zakharyaschev - 2002 - Annals of Pure and Applied Logic 118 (1-2):133-145.
A model-theoretic characterization of monadic second order logic on infinite words.Silvio Ghilardi & Samuel J. van Gool - 2017 - Journal of Symbolic Logic 82 (1):62-76.

Analytics

Added to PP
2021-05-20

Downloads
19 (#803,294)

6 months
7 (#439,760)

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