Adding disjunction to datalog (extended abstract)

Authors:
Thomas Eiter;Georg Gottlob;Heikki Mannila
Affiliations:
Christian Doppler Laboratory for Expert Systems, Information Systems Department, Technical University of Vienna, Paniglgasse 16, A-1040 Wien, Austria;Christian Doppler Laboratory for Expert Systems, Information Systems Department, Technical University of Vienna, Paniglgasse 16, A-1040 Wien, Austria;Department of Computer Science, University of Helsinki, P.O. Box 26, SF-00014, University of Helsinki, Finland
Venue:
PODS '94 Proceedings of the thirteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Year:
1994

Citing 18
Cited 16

A note on succinct representations of graphs

Information and Control
On the expressive power of the extended relational algebra for the unnormalized relational model

PODS '87 Proceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On the declarative semantics of deductive databases and logic programs

Foundations of deductive databases and logic programming
Datalog extensions for database queries and updates

Journal of Computer and System Sciences
Why not negation by fixpoint?

Journal of Computer and System Sciences
On the expressive power of database queries with intermediate types

Journal of Computer and System Sciences
Handbook of theoretical computer science (vol. A): algorithms and complexity

Handbook of theoretical computer science (vol. A): algorithms and complexity
Elements of relational database theory

Handbook of theoretical computer science (vol. B)
The well-founded semantics for general logic programs

Journal of the ACM (JACM)
Foundations of disjunctive logic programming

Foundations of disjunctive logic programming
A call to order

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complexity aspects of various semantics for disjunctive databases

PODS '93 Proceedings of the twelfth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The complexity of algorithmic problems on succinct instances

Computer science
On the expressive power of datalog: tools and a case study

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The expressive powers of the logic programming semantics (extended abstract)

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Non-deterministic languages to express deterministic transformations

PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
On Indefinite Databases and the Closed World Assumption

Proceedings of the 6th Conference on Automated Deduction
The complexity of relational query languages (Extended Abstract)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing

Disjunctive datalog

ACM Transactions on Database Systems (TODS)
Complexity and expressive power of logic programming

ACM Computing Surveys (CSUR)
Declarative problem-solving using the DLV system

Logic-based artificial intelligence
On the partial semantics for disjunctive deductive databases

Annals of Mathematics and Artificial Intelligence
Default Logic as a Query Language

IEEE Transactions on Knowledge and Data Engineering
Nonmonotonic Logic Programming

IEEE Transactions on Knowledge and Data Engineering
Enhancing Disjunctive Datalog by Constraints

IEEE Transactions on Knowledge and Data Engineering
Rewriting Queries Using Views

IEEE Transactions on Knowledge and Data Engineering
Disjunctive Explanations

ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Disjunctive Logic Programming: A Survey and Assessment

Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part I
Complexity and Expressive Power of Logic Programming

CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A New Partial Semantics for Disjunctive Deductive Databases

Fundamenta Informaticae
A fixpoint approach to state generation for stratifiable disjunctive deductive databases

ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Cooperating answer set programming

ICLP'06 Proceedings of the 22nd international conference on Logic Programming
A New Partial Semantics for Disjunctive Deductive Databases

Fundamenta Informaticae
Foundations of rule-based query answering

RW'07 Proceedings of the Third international summer school conference on Reasoning Web

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study the expressive power and complexity of disjunctive datalog, i.e., datalog with disjunctive rule heads, under three different semantics: the minimal model semantics, the perfect models semantics, and the stable model semantics. We show that the brave variants of these semantics express the same set of queries. In fact, they precisely capture the complexity of class &Sgr;P/2. The combined complexity of disjunctive datalog is shown to be NEXPTIMENP-complete.