Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based… Expand
  • table 1
Is this relevant?
2009
2009
Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute’s defeasible logic. The semantics are… Expand
Is this relevant?
2006
2006
We propose a solution to a long-standing problem in the foundations of well-founded semantics (WFS) for logic programs. The… Expand
  • figure 1
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
The paper describes an extension of well-founded semantics for logic programs with two types of negation. In this extension… Expand
Is this relevant?
1995
1995
We address methods of speeding up the calculation of the well-founded semantics for normal propositional logic programs. We first… Expand
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Common aggregation predicates have natural definitions in logic, either as first order sentences (min, max, etc.), or with… Expand
  • figure 1
Is this relevant?
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… Expand
  • figure 1
  • figure 2
Is this relevant?
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… Expand
Is this relevant?
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… Expand
Is this relevant?