Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Stable model semantics
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
The concept of a stable model provided a declarative semantics for Prolog programs with negation as failure and became a starting… Expand
Highly Cited
2005
Highly Cited
2005
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which… Expand
Highly Cited
2004
Highly Cited
2004
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… Expand
Highly Cited
2003
Highly Cited
2003
In recent research on nonmonotonic logic programming, repeatedly strong equivalence of logic programs P and Q has been considered… Expand
Highly Cited
2002
Highly Cited
2002
A novel logic program like language, weight constraint rules, is developed for answer set programming purposes. It generalizes… Expand
Highly Cited
1999
Highly Cited
1999
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least… Expand
Highly Cited
1999
Highly Cited
1999
Building animation tools for fluid-like motions is an important and challenging problem with many applications in computer… Expand
Highly Cited
1996
Highly Cited
1996
This paper relates inference in extended logic programming with nonclassical, nonmonotonic logics. We define a nonmonotonic logic… Expand
Highly Cited
1990
Highly Cited
1990
Foreword Robert Auman Acknowledgment 1. Introduction Part I. One-To-One Matching: the Marriage Model: 2. Stable matchings 3. The… Expand
Highly Cited
1988
Highly Cited
1988
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We… Expand