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 (University of Alberta)
- 2. Li Yan Yuan (University of Alberta)
BibTeX Citation
@inproceedings{you_pods90,
address = {New York, NY, USA},
series = {{PODS} '90},
title = {{Three-Valued Formalization of Logic Programming: Is It Needed?}},
url = {https://dl.acm.org/doi/10.1145/298514.298559},
doi = {10.1145/298514.298559},
booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
publisher = {Association for Computing Machinery},
author = {You, Jia-Huai and Yuan, Li Yan},
year = {1990}
}
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,083 | The Valid Model Semantics for Logic Programs | 1992 | PODS | 5.4911506e-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 |
|---|---|---|---|---|
| 1,297 | The Alternating Fixpoint of Logic Programs with Negation (Extended Abstract) | 1989 | PODS | 0.0001126031 |
| 1,419 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS | 0.00010830412 |
| 1,522 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS | 0.00010502706 |
| 2,474 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS | 8.5305658e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 4,263 | Explicit Control of Logic Programs Through Rule Algebra | 1988 | PODS |
| 2 | 3,824 | Inference of Inequality Constraints in Logic Programs (Extended Abstract) | 1991 | PODS |
| 3 | 5,210 | On the Expressive Power of Logic Programming Languages with Sets | 1988 | PODS |
| 4 | 11,968 | Stable Model Semantics for Tuple-Generating Dependencies Revisited | 2017 | PODS |
| 5 | 2,474 | Logic Programming as Constructivism: A Formalization and its Application to Databases | 1989 | PODS |
| 6 | 1,522 | Unfounded Sets and Well-Founded Semantics for General Logic Programs | 1988 | PODS |
| 7 | 4,831 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS |
| 8 | 8,295 | The Expressive Powers of the Logic Programming Semantics | 1990 | PODS |
| 9 | 1,419 | Every Logic Program Has a Natural Stratification And an Iterated Least Fixed Point Model | 1989 | PODS |
| 10 | 8,083 | The Valid Model Semantics for Logic Programs | 1992 | PODS |