Finite model reasoning over existential rules

DOI10.1017/S1471068417000369zbMath1422.68060arXiv1707.01870OpenAlexW2963287580MaRDI QIDQ4592706

Nicola Leone, Giovanni Amendola, Marco Manna

Publication date: 8 November 2017

Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1707.01870

zbMATH Keywords

Datalogquery answeringfinite controllabilityexistential rulesfinite model reasoning

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Logic in computer science (03B70)

Cites Work

• Converging to the chase -- a tool for finite controllability
• Towards more expressive ontology languages: the query answering problem
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• Testing containment of conjunctive queries under functional and inclusion dependencies
• The price of query rewriting in ontology-based data access
• Taming the Infinite Chase: Query Answering under Expressive Relational Constraints
• Query Rewriting and Optimization for Ontological Databases
• Ontology-Based Data Access
• Guarded-Based Disjunctive Tuple-Generating Dependencies
• Converging to the Chase -- A Tool for Finite Controllability
• Querying the Guarded Fragment with Transitivity
• Combining decidability paradigms for existential rules
• Querying the Guarded Fragment
• Unnamed Item
• Unnamed Item

This page was built for publication: Finite model reasoning over existential rules