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…

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.

2019

Distributed Autoepistemic Logic with Inductive Definitions (dAEL(ID)) is a recently proposed non-monotonic logic for says-based…

2013

Foundational Ontologies help maintaining and expanding ontologies expressivity power, thus enabling them to be more precise and…

2006

In this paper we present a new approach for applying well-founded semantics to extended logic programs. The main idea is not to…

2006

While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic…

2002

Let T denote a completion of ZF. We are interested in the number μ(T ) of isomorphism types of countable well-founded models of T…

2000

Global SLS-resolution and SLG-resolution are two representative mechanisms for top-down evaluation of the well-founded semantics…

1995

. We propose a new realization of goal-directed query evaluation of (non-(cid:13)oundering) normal logic programs for the well…

1994

The declarative semantics of nonmonotonic logic programming has largely been based on propositional programs. However, the ground…

1993

Stable models seem to be a natural way to describe the beliefs of a rational agent(cid:2) How(cid:3) ever(cid:4) the de(cid:5…

1992

The appropriateness of Autoepistemic Logic for the construction of knowledge representation systems is regarded as questionable…