DBScholar

Back to papers

Adding Disjunction to Datalog (Extended Abstract)

Summary: Analyze disjunctive Datalog (disjunctive rule heads) under minimal-model, perfect-model, and stable-model semantics, proving the brave-query variants coincide and exactly capture the complexity class Σ^P_2. Establish combined complexity of disjunctive Datalog as NEXPTIME^NP-complete. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1036
Venue
PODS
Year
1994
Pagerank
5.093636e-05
Overall Rank
13,027 | 10.63%
DOI
10.1145/182591.182639

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@inproceedings{eiter_pods94,
        address = {New York, NY, USA},
        series = {{PODS} '94},
        title = {{Adding Disjunction to Datalog (Extended Abstract)}},
        url = {https://dl.acm.org/doi/10.1145/182591.182639},
        doi = {10.1145/182591.182639},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Eiter, Thomas and Gottlob, Georg and Mannila, Heikki},
        year = {1994}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 6 of 6 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers