DBScholar

Back to papers

Logic Programming With Sets

Summary: Extends Horn-clause logic programming with first-class sets (only sets-of-individuals), adding primitive predicates (membership, subset, disjoint, union) and restricted universal quantifiers on clause RHS to express aggregation and non-1NF relations. Keeps Prolog-like rule syntax while enabling declarative set-based queries without encoding iteration/control. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
773
Venue
PODS
Year
1987
Pagerank
0.00013911498
Overall Rank
799 | 94.52%
DOI
10.1145/28659.28661

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{kuper_pods87,
        address = {New York, NY, USA},
        series = {{PODS} '87},
        title = {{Logic Programming With Sets}},
        url = {https://dl.acm.org/doi/10.1145/28659.28661},
        doi = {10.1145/28659.28661},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Kuper, Gabriel M.},
        year = {1987}
}

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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