DBScholar

Back to papers

Proof-Tree Transformation Theorems and Their Applications

Summary: Reduces existence of normal-form proof trees to conjunctive-query containment and to containment in the infinite union-of-CQs obtained by expanding recursive rules. Uses these tests to decide commutativity of linear rules—implying polynomial (vs exponential) counting complexity and separability—and to discover linear rule sets equivalent to nonlinear ones. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
862
Venue
PODS
Year
1989
Pagerank
9.3746238e-05
Overall Rank
1,970 | 86.49%
DOI
10.1145/73721.73739

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{ramakrishnan_pods89,
        address = {New York, NY, USA},
        series = {{PODS} '89},
        title = {{Proof-Tree Transformation Theorems and Their Applications}},
        url = {https://dl.acm.org/doi/10.1145/73721.73739},
        doi = {10.1145/73721.73739},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Ramakrishnan, Raghu and Sagiv, Yehoshua and Ullman, Jeffrey D. and Vardi, Moshe Y.},
        year = {1989}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 8 of 8 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