DBScholar

Back to papers

Binding Propagation in Disjunctive Databases

Summary: Rewrites disjunctive deductive programs into equivalent nested-head rules under possible semantics, propagating query bindings. Shrinks relevant data, reducing both single-model computation and, crucially, the number of models explored; supports negation-free and stratified linear programs. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
8687
Venue
VLDB
Year
1998
Pagerank
5.093636e-05
Overall Rank
12,939 | 11.23%
DOI
-

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@article{greco_vldb98,
        title = {{Binding Propagation in Disjunctive Databases}},
        author = {Greco, Sergio},
        journal = {PVLDB},
        series = {{VLDB} '98},
        year = {1998}
}

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

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

Rank Cited Paper Year Venue Pagerank
16 MAGIC SETS AND OTHER STRANGE WAYS TO IMPLEMENT LOGIC PROGRAMS (Extended Abstract) 1986 PODS 0.00060089598
1,921 Efficient Evaluation of Right-, Left-, and Multi-Linear Rules 1989 SIGMOD 9.4809066e-05
4,099 Argument Reduction by Factoring 1989 VLDB 6.9030568e-05
Previous Page 1 / 1 Next

Semantically Similar Papers