DBScholar

Back to papers

Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases

Summary: Bottom-up Magic Set-based evaluation for stratified deductive databases using Kerisit's weak consequence operator to compute a two-valued well-founded model of magic rules. Shows weak stratification can yield unsound/incomplete answers and introduces soft stratification to restore soundness and completeness. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
1282
Venue
PODS
Year
2003
Pagerank
5.093636e-05
Overall Rank
12,810 | 12.12%
DOI
10.1145/773153.773164

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{behrend_pods03,
        address = {New York, NY, USA},
        series = {{PODS} '03},
        title = {{Soft Stratification for Magic Set Based Query Evaluation in Deductive Databases}},
        url = {https://dl.acm.org/doi/10.1145/773153.773164},
        doi = {10.1145/773153.773164},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Behrend, Andreas},
        year = {2003}
}

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