Querying the Guarded Fragment with Transitivity
From MaRDI portal
Publication:5327441
DOI10.1007/978-3-642-39212-2_27zbMath1335.68078OpenAlexW126873717WikidataQ59259482 ScholiaQ59259482MaRDI QIDQ5327441
Lidia Tendera, Georg Gottlob, Andreas Pieris
Publication date: 7 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-39212-2_27
Database theory (68P15) Logic in computer science (03B70) Decidability of theories and sets of sentences (03B25)
Related Items (7)
Querying the Unary Negation Fragment with Regular Path Expressions. ⋮ Finite model reasoning over existential rules ⋮ Answering regular path queries mediated by unrestricted \(\mathcal{SQ}\) ontologies ⋮ Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments ⋮ Reasoning on anonymity in Datalog ⋮ Unnamed Item ⋮ Exploiting forwardness: satisfiability and query-entailment in forward guarded fragment
This page was built for publication: Querying the Guarded Fragment with Transitivity
