Database Paper Browser

Back to papers

Unfounded Sets and Well-Founded Semantics for General Logic Programs

Summary: Introduce unfounded sets and the well‑founded partial model as a canonical semantics for general logic programs with negation; 'well‑behaved' programs have a total well‑founded model. Prove this strictly generalizes stratified/local stratified programs and that a well‑founded model yields a unique (coinciding) stable model, though the converse may fail. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
832
Venue
PODS
Year
1988
Pagerank
0.00013554968
Overall Rank
1,166 | 91.90%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 16 of 16 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

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

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers