Results 1  10
of
25,068
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 1847 (63 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.
Extending and Implementing the Stable Model Semantics
, 2002
"... A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes normal logic programs by allowing weight constraints in place of literals to represent, e.g., cardinality and resource constraints and by providing optimization capabilities ..."
Abstract

Cited by 396 (9 self)
 Add to MetaCart
capabilities. A declarative semantics is developed which extends the stable model semantics of normal programs. The computational complexity of the language is shown to be similar to that of normal programs under the stable model semantics. A simple embedding of general weight constraint rules to a small
Stable models and an alternative logic programming paradigm
 In The Logic Programming Paradigm: a 25Year Perspective
, 1999
"... In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting ..."
Abstract

Cited by 310 (19 self)
 Add to MetaCart
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate that inherent features of stable model semantics naturally lead to a logic programming system that offers an interesting
Stable Fluids
, 1999
"... Building animation tools for fluidlike motions is an important and challenging problem with many applications in computer graphics. The use of physicsbased models for fluid flow can greatly assist in creating such tools. Physical models, unlike key frame or procedural based techniques, permit an a ..."
Abstract

Cited by 568 (9 self)
 Add to MetaCart
to the fact that previous models used unstable schemes to solve the physical equations governing a fluid. In this paper, for the first time, we propose an unconditionally stable model which still produces complex fluidlike flows. As well, our method is very easy to implement. The stability of our model
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 294 (9 self)
 Add to MetaCart
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
The Family of Stable Models
, 1993
"... The family of all stable models for a logic program has a surprisingly simple overall structure, once two naturally occurring orderings are made explicit. In a socalled knowledge ordering based on degree of definedness, every logic program P has a smallest stable model, s k P it is the well ..."
Abstract

Cited by 64 (4 self)
 Add to MetaCart
The family of all stable models for a logic program has a surprisingly simple overall structure, once two naturally occurring orderings are made explicit. In a socalled knowledge ordering based on degree of definedness, every logic program P has a smallest stable model, s k P it
Stable model categories are categories of modules
 TOPOLOGY
, 2003
"... A stable model category is a setting for homotopy theory where the suspension functor is invertible. The prototypical examples are the category of spectra in the sense of stable homotopy theory and the category of unbounded chain complexes of modules over a ring. In this paper we develop methods for ..."
Abstract

Cited by 117 (22 self)
 Add to MetaCart
A stable model category is a setting for homotopy theory where the suspension functor is invertible. The prototypical examples are the category of spectra in the sense of stable homotopy theory and the category of unbounded chain complexes of modules over a ring. In this paper we develop methods
Stable Models and Circumscription
, 2007
"... The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming (includ ..."
Abstract

Cited by 71 (37 self)
 Add to MetaCart
The definition of a stable model has provided a declarative semantics for Prolog programs with negation as failure and has led to the development of answer set programming. In this paper we propose a new definition of that concept, which covers many constructs used in answer set programming
A Strategic Model of Social and Economic Networks
 CMSEMS Discussion Paper 1098, Northwestern University, revised
, 1995
"... We study the stability and efficiency of social and economic networks, when selfinterested individuals can form or sever links. First, for two stylized models, we characterize the stable and efficient networks. There does not always exist a stable network that is efficient. Next, we show that this t ..."
Abstract

Cited by 664 (22 self)
 Add to MetaCart
We study the stability and efficiency of social and economic networks, when selfinterested individuals can form or sever links. First, for two stylized models, we characterize the stable and efficient networks. There does not always exist a stable network that is efficient. Next, we show
Results 1  10
of
25,068