DBScholar

Back to papers

The Complexity of Reusing and Modifying Rulebases

Summary: Adds predicate substitution to deductive databases to enable reuse and incremental modification of rulebases by substituting predicates (not just variables) during query evaluation. Proves Datalog with substitution is EXPTIME-complete in data complexity and provides proof/model-theory and fixpoint semantics, characterizing the language's extra expressive power. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
976
Venue
PODS
Year
1992
Pagerank
-
Overall Rank
14,368 | 1.43%
DOI
10.1145/137097.137900

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{bonner_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{The Complexity of Reusing and Modifying Rulebases}},
        url = {https://dl.acm.org/doi/10.1145/137097.137900},
        doi = {10.1145/137097.137900},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bonner, Anthony J.},
        year = {1992}
}

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 0 of 0 cited papers.

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

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

Semantically Similar Papers