Skip to search formSkip to main contentSkip to account menu

Stable model semantics

Known as: Answer set, Answer set semantics, Stable model 
The concept of a stable model, or answer set, is used to define a declarative semantics for logic programs with negation as failure. This is one of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

23 relations
Answer set programmingAutoepistemic logicClosed-world assumptionDLV

Broader (1)

Logic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Answer set programming at a glance
The motivation and key concepts behind answer set programming---a promising approach to declarative problem solving. 
Highly Cited
2000
Highly Cited
2000
Extending and implementing the stable model semantics
Highly Cited
1999
Highly Cited
1999
Logic programs with stable model semantics as a constraint programming paradigm
  • I. Niemelä
  • Annals of Mathematics and Artificial Intelligence
  • 1999
  • Corpus ID: 14465318
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… 
Highly Cited
1999
Highly Cited
1999
Stable fluids
  • J. Stam
  • International Conference on Computer Graphics and…
  • 1999
  • Corpus ID: 207555779
Building animation tools for fluid-like motions is an important and challenging problem with many applications in computer… 
Highly Cited
1998
Highly Cited
1998
Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least… 
Highly Cited
1997
Highly Cited
1997
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free… 
Highly Cited
1996
Highly Cited
1996
A New Logical Characterisation of Stable Models and Answer Sets
  • D. Pearce
  • Workshop on Non-Monotonic Extensions of Logic…
  • 1996
  • Corpus ID: 18772252
This paper relates inference in extended logic programming with nonclassical, nonmonotonic logics. We define a nonmonotonic logic… 
Highly Cited
1994
Highly Cited
1994
Propositional semantics for disjunctive logic programs
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which… 
Highly Cited
1990
Highly Cited
1990
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis
Foreword Robert Auman Acknowledgment 1. Introduction Part I. One-To-One Matching: the Marriage Model: 2. Stable matchings 3. The… 
Highly Cited
1988
Highly Cited
1988
The Stable Model Semantics for Logic Programming
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)