Skip to search formSkip to main contentSkip to account menu

Well-founded semantics

Known as: WFS 
In logic programming, the well-founded semantics is one definition of how we can make conclusions from a set of logical rules. In logic programming… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2006
2006
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The… 
Highly Cited
1997
Highly Cited
1997
The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free… 
1997
1997
We present a well-founded semantics for deductive object-oriented database (dood) languages by applying the alternating-fixpoint… 
Highly Cited
1996
Highly Cited
1996
  • G. Brewka
  • J. Artif. Intell. Res.
  • 1996
  • Corpus ID: 165469
The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension… 
Highly Cited
1996
Highly Cited
1996
An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented… 
Highly Cited
1992
Highly Cited
1992
Common aggregation predicates have natural definitions in logic, either as first order sentences (min, max, etc.), or with… 
Highly Cited
1991
Highly Cited
1991
A general logic program (abbreviated to "program" hereafter) is a set of roles that have both positive and negative subgoals. It… 
1991
1991
Classical fixpoint semantics for logic programs is based on the T P immediate consequence operator. The Kripke/Kleene, three… 
Highly Cited
1990
Highly Cited
1990
We introduce 3-valued stable models which are a natural generalization of standard (2-valued) stable models. We show that every… 
Highly Cited
1988
Highly Cited
1988
A general logic program (abbreviated to “program” hereafter) is a set of rules that have both positive and negative subgoals. It…