The Well-Founded Semantics of Aggregation (Extended Abstract)
Summary: Gives a well-founded semantics for aggregation, treating first-order and inductive aggregates under recursion using definable subset/superset predicates and a negatively-used findall. Produces robust outcomes (e.g., handles negative-weight edges and leaves tuples undefined for negative cycles) without extra semantic machinery. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Allen Van Gelder (INRIA; University of California Santa Cruz)
BibTeX Citation
@inproceedings{gelder_pods92,
address = {New York, NY, USA},
series = {{PODS} '92},
title = {{The Well-Founded Semantics of Aggregation (Extended Abstract)}},
url = {https://dl.acm.org/doi/10.1145/137097.137854},
doi = {10.1145/137097.137854},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {Van Gelder, Allen},
year = {1992}
}
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,076 | Monotonic Aggregation in Deductive Databases | 1992 | PODS | 6.8187173e-05 |
| 4,242 | Variable Independence and Aggregation Closure | 1996 | PODS | 6.7070443e-05 |
| 8,253 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 5.3679991e-05 |
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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 531 | The Magic of Duplicates and Aggregates | 1990 | VLDB | 0.00016847212 |
| 2,551 | Aggregation and Relevance in Deductive Databases | 1991 | VLDB | 8.3095988e-05 |
| 3,623 | Minimum and Maximum Predicates in Logic Programming | 1991 | PODS | 7.1535991e-05 |
| 4,076 | Monotonic Aggregation in Deductive Databases | 1992 | PODS | 6.8187173e-05 |
| 7,525 | CONSTRAINT QUERY LANGUAGES (preliminary report) | 1990 | PODS | 5.5024265e-05 |
| 8,253 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 5.3679991e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 1,457 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS |
| 2 | 5,335 | On the Expressive Power of Logic Programming Languages with Sets | 1988 | PODS |
| 3 | 8,136 | On the First-Order Expressibility of Recursive Queries | 1989 | PODS |
| 4 | 828 | Logic Programming With Sets | 1987 | PODS |
| 5 | 13,456 | Fixed-point semantics and the representation of algorithms on large data | 1988 | VLDB |
| 6 | 531 | The Magic of Duplicates and Aggregates | 1990 | VLDB |
| 7 | 8,463 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS |
| 8 | 8,253 | The Valid Model Semantics for Logic Programs | 1992 | PODS |
| 9 | 1,556 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS |
| 10 | 4,076 | Monotonic Aggregation in Deductive Databases | 1992 | PODS |