Querying the Guarded Fragment
From MaRDI portal
Publication:5417742
DOI10.2168/LMCS-10(2:3)2014zbMath1314.68146arXiv1309.5822WikidataQ59259474 ScholiaQ59259474MaRDI QIDQ5417742
Martin Otto, Georg Gottlob, Vince Bárány
Publication date: 22 May 2014
Published in: Logical Methods in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.5822
guarded fragmentdescription logicsfinite model theoryconjunctive queriesdescriptive complexitytuple-generating dependencieshypergraph covers
Logic in computer science (03B70) Model theory of finite structures (03C13) Descriptive complexity and finite models (68Q19)
Related Items (19)
On the data complexity of consistent query answering ⋮ Towards more expressive ontology languages: the query answering problem ⋮ Unnamed Item ⋮ Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Finite model reasoning over existential rules ⋮ Answer Counting under Guarded TGDs ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ Finite satisfiability for guarded fixpoint logic ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Reasoning on anonymity in Datalog ⋮ SOME MODEL THEORY OF GUARDED NEGATION ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Guarded Negation ⋮ Guarded Negation ⋮ A more general theory of static approximations for conjunctive queries ⋮ Logical separability of labeled data examples under ontologies ⋮ Guarded Ontology-Mediated Queries ⋮ Semiring Provenance for Guarded Logics
This page was built for publication: Querying the Guarded Fragment
