Database Paper Browser

Back to papers

Stable Models and Non-Determinism in Logic Programs with Negation

Summary: Unifies negation and nondeterminism via stable-model semantics, defines partial/strongly-founded/deterministic/stable models, and proves max-deterministic ⊆ ⋂stable and well-founded ⊆ max-deterministic. Subsumes LDL's nondeterministic choice and gives a backtracking-fixpoint to construct total stable models. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
903
Venue
PODS
Year
1990
Pagerank
5.9434944e-05
Overall Rank
4,757 | 66.91%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 8 of 8 citing papers.

Rank Citing Paper Year Venue Pagerank
3,297 Greedy by Choice 1992 PODS 7.259032e-05
3,446 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0861064e-05
3,852 Negation and Minimality in Non-Horn Databases 1993 PODS 6.7017663e-05
5,705 Datalog Unchained 2021 PODS 5.3621239e-05
7,672 The Valid Model Semantics for Logic Programs 1992 PODS 4.6826453e-05
8,570 Semi-determinism (extended abstract) 1992 PODS 4.4937074e-05
9,167 Extending Logic Programming 1990 SIGMOD 4.3849295e-05
12,910 A Non-deterministic Deductive Database Language 1991 SIGMOD 4.1945683e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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