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… (More)
Wikipedia

Related topics

Related topics

23 relations
Answer set programmingAutoepistemic logicClosed-world assumptionDLV
(More)

Broader (1)

Logic programming

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Stable model semantics for founded bounds
Answer Set Programming (ASP) is a powerful form of declarative programming used in areas such as planning or reasoning. ASP… (More)
  • figure 2
  • table 1
  • table 4
Is this relevant?
2006
2006
Epistemic foundation of stable model semantics
The stable model semantics has become a dominating approach for the management of negation in logic programming and close… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • table 2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Uniform Equivalence of Logic Programs under the Stable Model Semantics
In recent research on nonmonotonic logic programming, repe atedly strong equivalence of logic programs P andQ has been considered… (More)
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Extending and Implementing the Stable Model Semantics
An algorithm for computing the stable model semantics of logic programs is developed. It is shown that one can extend the… (More)
  • figure 5
  • figure 8
  • figure 9
Is this relevant?
2001
2001
Resolution for Skeptical Stable Model Semantics
An extension of resolution for skeptical stable model semantics is introduced. Unlike previous approaches, our calculus is not… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Unfolding partiality and disjunctions in stable model semantics
This article studies an implementation methodology for partial and disjunctive stable models where partiality and disjunctions… (More)
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Stable Model Semantics of Weight Constraint Rules
1 A generalization of logic program rules is proposed where rules are built from weight constraints with type information for… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Logic programs with stable model semantics as a constraint programming paradigm
Logic programming with the stable model semantics is put forward as a novel constraint programming paradigm. This paradigm is… (More)
Is this relevant?
Highly Cited
1999
Highly Cited
1999
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… (More)
Is this relevant?
Highly Cited
1988
Highly Cited
1988
The Stable Model Semantics for Logic Programming
This paper studies the stable model semantics of logic progr ams with (abstract) constraint atoms and their properties. We… (More)
Is this relevant?