Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 210,103,926 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
23 relations
Answer set programming
Autoepistemic logic
Closed-world assumption
DLV
Expand
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
G. Brewka
,
Thomas Eiter
,
M. Truszczynski
Communications of the ACM
2011
Corpus ID: 17746168
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
P. Simons
,
I. Niemelä
,
T. Soininen
Artificial Intelligence
2000
Corpus ID: 14897453
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…
Expand
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…
Expand
Highly Cited
1998
Highly Cited
1998
Stable models and an alternative logic programming paradigm
V. Marek
,
M. Truszczynski
The Logic Programming Paradigm
1998
Corpus ID: 353601
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
1997
Highly Cited
1997
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
I. Niemelä
,
P. Simons
International Conference on Logic Programming and…
1997
Corpus ID: 14427927
The Smodels system is a C++ implementation of the well-founded and stable model semantics for range-restricted function-free…
Expand
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…
Expand
Highly Cited
1994
Highly Cited
1994
Propositional semantics for disjunctive logic programs
R. Ben-Eliyahu-Zohary
,
R. Dechter
Annals of Mathematics and Artificial Intelligence
1994
Corpus ID: 594147
In this paper we study the properties of the class of head-cycle-free extended disjunctive logic programs (HEDLPs), which…
Expand
Highly Cited
1990
Highly Cited
1990
Two-Sided Matching: A Study in Game-Theoretic Modeling and Analysis
A. Roth
,
Marilda Sotomayor
1990
Corpus ID: 61202544
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
The Stable Model Semantics for Logic Programming
M. Gelfond
,
V. Lifschitz
ICLP/SLP
1988
Corpus ID: 9339565
This paper studies the stable model semantics of logic programs with (abstract) constraint atoms and their properties. We…
Expand
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)
ACCEPT & CONTINUE