Three-Valued Formalization of Logic Programming: Is It Needed?
Summary: Argues Przymusinski's 3-valued semantics overuses undefined, losing disjunctive/factoring information, and proposes justifiability plus minimal undefinedness to restrict undefinedness. Defines regular model semantics that restores disjunction and unifies well-founded and stable models (stable = 2-valued regular). (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Jia-Huai You
- 2. Li Yan Yuan
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,672 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 4.6826453e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 843 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00016005595 |
| 1,166 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00013554968 |
| 1,205 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.00013285448 |
| 1,979 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 9.8794371e-05 |
Previous
Page 1 / 1
Next