The Well-Founded Semantics for General Logic Programs

Van Gelder, A., Ross, K. A., & Schlipf, J. S. (1991). The Well-Founded Semantics for General Logic Programs. Journal of the ACM, 38(3), 620-650.

Type

Journal article

Intellectual base

Primary research

Year

1991

Volume

38

Issue

3

Pages

620-650

DOI

10.1145/116825.116838

DOI registrant

Association for Computing Machinery

Link

https://doi.org/10.1145/116825.116838

Cited by

2 citations across 2 artifacts.

Each citation links to the sentence it supports in the citing article.

Domain-specific

• Negation as Failure
  • Normal logic programs. Negative literals in rule bodies allow defaults and exceptions, with semantics supplied by completion, stratification, stable models, well-founded models, or related frameworks.

    This sourcePrimary partial-model semantics for negative recursion and undefined atoms.

• Well-founded semantics
  • Undefined represents unresolved recursion through negation rather than probability, the semantics is skeptical and unique unlike multiple stable models, and operational tabling implementations must correspond to the declarative fixed point.

Verification

Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.

Does it back the claim? Not recorded. Neither this nor any other of the 2 citations of this work carries a recorded support check.

Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.

See how references were verified.

Registry ID ref:45a869a34638 · see in the full table