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)

Related topics

Related topics

5 relations

Broader (1)

Logic programming
Relational algebraRule Interchange FormatStable model semanticsThree-valued logic

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Well-founded semantics for defeasible logic
Fixpoint semantics are provided for ambiguity blocking and propagating variants of Nute’s defeasible logic. The semantics are… 
2007
2007
Well-Founded Semantics for Hybrid Rules
The problem of integration of rules and ontologies is addressed in a general framework based on the well-founded semantics of… 
2005
2005
A Well-Founded Semantics with Disjunction
In this paper we develop a new semantics for disjunctive logic programs, called Well-Founded Semantics with Disjunction (WFSd… 
Highly Cited
2004
Highly Cited
2004
Well-founded semantics for description logic programs in the semantic web
The realization of the Semantic Web vision, in which computational logic has a prominent role, has stimulated a lot of research… 
Review
1998
Review
1998
The Well-Founded Semantics Is the Principle of Inductive Definition
Existing formalisations of (transfinite) inductive definitions in constructive mathematics are reviewed and strong… 
Highly Cited
1996
Highly Cited
1996
Well-Founded Semantics for Extended Logic Programs with Dynamic Preferences
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
Efficient Implementation of the Well-founded and Stable Model Semantics
An implementation of the well-founded and stable model semantics for range-restricted function-free normal programs is presented… 
1995
1995
Computing Well-founded Semantics Faster
We address methods of speeding up the calculation of the well-founded semantics for normal propositional logic programs. We first… 
1991
1991
Well-Founded Semantics, Generalized
Classical fixpoint semantics for logic programs is based on the T P immediate consequence operator. The Kripke/Kleene, three… 
Highly Cited
1989
Highly Cited
1989
A procedural semantics for well founded negation in logic programs
We introduce global SLS-resolution, a procedural semantics for well-founded negation as defined by Van Gelder, Ross and Schlipf… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)