More on tractable disjunctive Datalog

DOI10.1016/S0743-1066(99)00066-7zbMATH Open0964.68057OpenAlexW2087528959MaRDI QIDQ4520177FDOQ4520177

Luigi Palopoli, Rachel Ben-Eliyahu-Zohary, Victoria Zemlyanker

Publication date: 12 December 2000

Published in: The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0743-1066(99)00066-7

Recommendations

• Disjunctive Datalog with existential quantifiers: semantics, decidability, and complexity issues
• On datalog vs polynomial time
• On the complexity of ontological reasoning under disjunctive existential rules
• Expressive power and complexity of partial models for disjunctive deductive databases
• On the expressive power of Datalog: tools and a case study.

zbMATH Keywords

disjunctive Datalog

Mathematics Subject Classification ID

Logic programming (68N17) Database theory (68P15) Semantics in the theory of computing (68Q55)

Cited In (2)

• Datalog rewritability of disjunctive Datalog programs and non-Horn ontologies
• On datalog vs polynomial time

Uses Software

• Datalog

This page was built for publication: More on tractable disjunctive Datalog

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4520177)