Results 1  10
of
1,431
WellFounded Semantics, Generalized
 In Proceedings of International Symposium on Logic Programming
, 1991
"... Classical fixpoint semantics for logic programs is based on the TP immediate consequence operator. The Kripke/Kleene, threevalued, semantics uses #P , which extends TP to Kleene's strong threevalued logic. Both these approaches generalize to cover logic programming systems based on a wide cla ..."
Abstract

Cited by 14 (2 self)
 Add to MetaCart
class of logics, provided only that the underlying structure be that of a bilattice. This was presented in earlier papers. Recently wellfounded semantics has become influential for classical logic programs. We show how the wellfounded approach also extends naturally to the same family
Unfolding the Wellfounded Semantics
 Journal of Electrical Engineering, Slovak Academy of Sciences
, 2002
"... We study the xpoint completion, proposed by Dung and Kanchanasut in [DK89]. The fixpoint completion is a program transformation  it performs a kind of unfolding of recursion through positive atoms in the clauses of a program f that was shown to preserve the semantics of a program in a certain sense ..."
Abstract

Cited by 10 (1 self)
 Add to MetaCart
sense. We generalize the results from [DK89] in some ways and show how the handling of negation is transformed by the fixpoint completion. We thereby obtain a more clarified view of both the fixpoint completion itself and the relationship between wellfounded and Fitting semantics.
Aggregation and WellFounded Semantics
, 1997
"... . Setgrouping and aggregation are powerful nonmonotonic operations of practical interest in database query languages. We consider the problem of expressing aggregation via negation as failure (NF). We study this problem in the framework of partialorder clauses introduced in [JOM95]. We show a tra ..."
Abstract

Cited by 4 (2 self)
 Add to MetaCart
translation of partialorder programs to normal programs that is very natural: Any costmonotonic partialorder program P becomes a stratified normal program transl(P) such that the declarative semantics of P is equivalent to the stratified semantics of transl(P). The ability to effect such a translation
Extended WellFounded Semantics in Bilattices
, 2005
"... One of the most used assumptions in logic programming and deductive databases is the socalled Closed World Assumption (CWA), according to which the atoms that cannot be inferred from the programs are considered to be false (i.e. a pessimistic assumption). One of the most successful semantics of con ..."
Abstract
 Add to MetaCart
of conventional logic programs based on the CWA is the wellfounded semantics. However, the CWA is not applicable in all circumstances when information is handled. That is, the wellfounded semantics, if conventionally defined, would behave inadequately in different cases. The solution we adopt in this paper
Loop Checking and the WellFounded Semantics
 Proceedings of the 12th International Conference on Logic Programming, Japan
, 1995
"... . Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the wellfounded semantics; for finite programs, it is also complete. A Prologstyle proof search strategy for a modification of ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
. Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the wellfounded semantics; for finite programs, it is also complete. A Prologstyle proof search strategy for a modification
WellFounded Semantics for Default Logic
, 1997
"... Default logic is one of the most popular approaches to model defeasible reasoning. Nevertheless, there are a number of problems with Reiter's original semantics that have led to the investigation of alternative approaches. In particular, Baral/Subrahmanian and Przymusinska/Przymusinski have ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
investigated generalizations of wellfounded semantics for normal logic programs to default logic. These
A Tutorial on the WellFounded Semantics
, 1997
"... The wellfounded semantics for "normal" logic programs is described using the alternating fixpoint construction as the basis. The presentation is informal. The semantics is motivated and illustrated through examples, and is compared briefly with earlier semantics for negation. Extensions ..."
Abstract
 Add to MetaCart
The wellfounded semantics for "normal" logic programs is described using the alternating fixpoint construction as the basis. The presentation is informal. The semantics is motivated and illustrated through examples, and is compared briefly with earlier semantics for negation. Extensions
Logical foundations of wellfounded semantics
 In P
, 2006
"... We propose a solution to a longstanding problem in the foundations of wellfounded semantics (WFS) for logic programs. The problem addressed is this: which (nonmodal) logic can be considered adequate for wellfounded semantics in the sense that its minimal models (appropriately defined) coincide ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We propose a solution to a longstanding problem in the foundations of wellfounded semantics (WFS) for logic programs. The problem addressed is this: which (nonmodal) logic can be considered adequate for wellfounded semantics in the sense that its minimal models (appropriately defined) coin
Decidability Under the WellFounded Semantics ⋆
"... Abstract. The wellfounded semantics (WFS) for logic programs is one of the few major paradigms for closedworld reasoning. With the advent of the Semantic Web, it is being used as part of rule systems for ontology reasoning, and also investigated as to its usefulness as a semantics for hybrid syste ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract. The wellfounded semantics (WFS) for logic programs is one of the few major paradigms for closedworld reasoning. With the advent of the Semantic Web, it is being used as part of rule systems for ontology reasoning, and also investigated as to its usefulness as a semantics for hybrid
Comparing Disjunctive Wellfounded Semantics ⋆
"... Abstract. While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the wellfounded semantics to disjunctive programs remains to be found. The many current proposals for such a ..."
Abstract
 Add to MetaCart
Abstract. While the stable model semantics, in the form of Answer Set Programming, has become a successful semantics for disjunctive logic programs, a corresponding satisfactory extension of the wellfounded semantics to disjunctive programs remains to be found. The many current proposals
Results 1  10
of
1,431