DBScholar

Back to papers

Implementing Deductive Databases by Linear Programming

Summary: Compile deductive logic programs (including negation and disjunction) into mixed-integer linear programs to perform deduction at compile-time and compute minimal models. Enables incremental updates via constraint insertion/deletion, avoids SLD looping, and maps to RDBMS-backed query execution; prototype shows promising performance. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
973
Venue
PODS
Year
1992
Pagerank
5.093636e-05
Overall Rank
13,083 | 10.24%
DOI
10.1145/137097.137892

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{bell_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{Implementing Deductive Databases by Linear Programming}},
        url = {https://dl.acm.org/doi/10.1145/137097.137892},
        doi = {10.1145/137097.137892},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Bell, Colin and Nerode, Anil and Ng, Raymond T. and Subrahmanian, V.S.},
        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 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