Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues

DOI10.1017/S1471068412000257zbMath1260.68055arXiv1210.2316OpenAlexW2044118198MaRDI QIDQ4911144

Nicola Leone, Wolfgang Faber, Mario Alviano, Marco Manna

Publication date: 13 March 2013

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

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

zbMATH Keywords

complexitydatalogdecidabilitynon-monotonic reasoning

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items (5)

Querying incomplete information in RDF with SPARQL ⋮ Recent Advances in Datalog$$^\pm $$ ⋮ Disjunctive logic programs with existential quantification in rule heads ⋮ Combining decidability paradigms for existential rules ⋮ Domain expansion for ASP-programs with external sources

Uses Software

• Datalog

Cites Work

• Stable models and circumscription
• Data exchange: semantics and query answering
• Testing containment of conjunctive queries under functional and inclusion dependencies
• Modal languages and bounded fragments of predicate logic
• Conjunctive query containment revisited
• Tractable reasoning and efficient query answering in description logics: The DL-Lite family
• On the Restraining Power of Guards
• A logic programming approach to knowledge-state planning

This page was built for publication: Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues