Reasoning on anonymity in Datalog

DOI10.4230/OASIcs.ICLP.2017.3zbMath1428.68138OpenAlexW2788108184MaRDI QIDQ5240228

Nicola Leone, Giovanni Amendola, Pierfrancesco Veltri, Marco Manna

Publication date: 24 October 2019

Full work available at URL: https://dblp.uni-trier.de/db/conf/iclp/iclp2017.html#AmendolaLMV17

zbMATH Keywords

expressivenessDatalogquery answeringontologiesDatalog+/--

Mathematics Subject Classification ID

Database theory (68P15) Knowledge representation (68T30) Logic programming (68N17)

Cites Work

• Unnamed Item
• Towards more expressive ontology languages: the query answering problem
• Data complexity of query answering in description logics
• Data exchange: semantics and query answering
• On rules with existential variables: walking the decidability line
• Tractable query answering and rewriting under description logic constraints
• 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
• Logic Programming
• Querying the Guarded Fragment with Transitivity
• Querying the Guarded Fragment

This page was built for publication: Reasoning on anonymity in Datalog