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.
2013
2013
A Model-Theoretic Approach to Belief Change in Answer Set Programming
We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are… 
2009
2009
Answer Set vs Integer Linear Programming for Automatic Synthesis of Multiprocessor Systems From Real-Time Parallel Programs
An automated design approach for multiprocessor systems on FPGAs is presented which customizes architectures for parallel… 
2006
2006
Towards a Unified Theory of Policy-Based Routing
We use the term policy-based routing to refer collec- tively to the Stable Paths Problem, Sobrinho's Routing Algebras, and to… 
2003
2003
Robustly stable feedback min-max model predictive control
This paper is concerned with the practical real-time implementability of robustly stable model predictive control (MPC) when… 
Highly Cited
2001
Highly Cited
2001
Why more choices cause less cooperation in iterated prisoner's dilemma
  • P. DarwenX. Yao
  • Proceedings of the Congress on Evolutionary…
  • 2001
  • Corpus ID: 9316588
The classic iterated prisoner's dilemma (IPD) has only 2 choices, cooperate or defect. However, most real-world situations offer… 
Highly Cited
1999
Highly Cited
1999
Stability of adaptive and non-adaptive packet routing policies in adversarial queueing networks
We investigate the stability of packet routing policies in adversarial queueing networks. We provide a simple classification of… 
1994
1994
Partial Evaluation and Relevance for Approximations of Stable Semantics
There is no doubt that STABLE and WFS are among the dominant semantics for logic programs. While WFS has many nice structural… 
1992
1992
How Complicated is the Set of Stable Models of a Recursive Logic Program?
Highly Cited
1989
Highly Cited
1989
Time-varying feedback for the stabilization of fixed modes in decentralized control systems
  • J. Willems
  • at - Automatisierungstechnik
  • 1989
  • Corpus ID: 34163173
1976
1976
Crossed beam studies of endoergic bimolecular reactions: production of stable trihalogen radicals. [Reactions of F with I, ICl, and HI]
The trihalogens IIF and ClIF and the pseudo-trihalogen HIF have been directly observed as the products of the endoergic… 
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)