Results 1  10
of
593,145
An InfiniteGame Semantics for WellFounded Negation in Logic Programming
"... We present an infinitegame characterization of the wellfounded semantics for functionfree logic programs with negation. Our game is a simple generalization of the standard game for negationless logic programs introduced by M.H. van Emden (1986, Journal of Logic Programming, 3(1), 3753) in which ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
We present an infinitegame characterization of the wellfounded semantics for functionfree logic programs with negation. Our game is a simple generalization of the standard game for negationless logic programs introduced by M.H. van Emden (1986, Journal of Logic Programming, 3(1), 37
Infinite Games and WellFounded Negation ⋆
"... Abstract. We present a new characterization of the wellfounded semantics [vGRS91] using an infinite twoplayer game of perfect information) [GS53]. Our game generalizes the standard game for ordinary logic programming [vE86]. Our proof of correctness is based on a refined version of the game, with ..."
Abstract
 Add to MetaCart
Abstract. We present a new characterization of the wellfounded semantics [vGRS91] using an infinite twoplayer game of perfect information) [GS53]. Our game generalizes the standard game for ordinary logic programming [vE86]. Our proof of correctness is based on a refined version of the game
Smodels  an Implementation of the Stable Model and WellFounded Semantics for Normal Logic Programs
, 1997
"... The Smodels system is a C++ implementation of the wellfounded and stable model semantics for rangerestricted functionfree normal programs. The system includes two modules: (i) smodels which implements the two semantics for ground programs and (ii) parse which computes a grounded version of a range ..."
Abstract

Cited by 287 (9 self)
 Add to MetaCart
up backtracking search where a powerful pruning method is employed. The pruning method exploits an approximation technique for stable models which is closely related to the wellfounded semantics. One of the advantages of this novel technique is that it can be implemented to work in linear space. This makes
The Stable Model Semantics For Logic Programming
, 1988
"... We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified. ..."
Abstract

Cited by 1831 (66 self)
 Add to MetaCart
We propose a new declarative semantics for logic programs with negation. Its formulation is quite simple; at the same time, it is more general than the iterated fixed point semantics for stratied programs, and is applicable to some useful programs that are not stratified.
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
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
The Semantics Of Constraint Logic Programs
 JOURNAL OF LOGIC PROGRAMMING
, 1996
"... This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new and comp ..."
Abstract

Cited by 872 (14 self)
 Add to MetaCart
This paper presents for the first time the semantic foundations of CLP in a selfcontained and complete package. The main contributions are threefold. First, we extend the original conference paper by presenting definitions and basic semantic constructs from first principles, giving new
Classical negation in logic programs and disjunctive databases
 New Generation Computing
, 1991
"... An important limitation of traditional logic programming as a knowledge representation tool, in comparison with classical logic, is that logic programming does not allow us to deal directly with incomplete information. In order to overcome this limitation, we extend the class of general logic progra ..."
Abstract

Cited by 1050 (76 self)
 Add to MetaCart
programs by including classical negation, in addition to negationasfailure. The semantics of such extended programs is based on the method of stable models. The concept of a disjunctive database can be extended in a similar way. We show that some facts of commonsense knowledge can be represented by logic
Bilattices and the Semantics of Logic Programming
, 1989
"... Bilattices, due to M. Ginsberg, are a family of truth value spaces that allow elegantly for missing or conflicting information. The simplest example is Belnap's fourvalued logic, based on classical twovalued logic. Among other examples are those based on finite manyvalued logics, and on prob ..."
Abstract

Cited by 444 (13 self)
 Add to MetaCart
, and on probabilistic valued logic. A fixed point semantics is developed for logic programming, allowing any bilattice as the space of truth values. The mathematics is little more complex than in the classical twovalued setting, but the result provides a natural semantics for distributed logic programs, including
Results 1  10
of
593,145