Stable Model Semantics
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 several standard approaches to the meaning of negation in logic programming, along with program completion and the well-founded semantics. The stable model semantics is the basis of answer set programming.
Read more about Stable Model Semantics: Motivation, Relation To Nonmonotonic Logic, Stable Models, Properties of The Stable Model Semantics, Programs With Constraints, Disjunctive Programs, Stable Models of A Set of Propositional Formulas
Famous quotes containing the words stable and/or model:
“One of the oddest features of western Christianized culture is its ready acceptance of the myth of the stable family and the happy marriage. We have been taught to accept the myth not as an heroic ideal, something good, brave, and nearly impossible to fulfil, but as the very fibre of normal life. Given most families and most marriages, the belief seems admirable but foolhardy.”
—Jonathan Raban (b. 1942)
“The playing adult steps sideward into another reality; the playing child advances forward to new stages of mastery....Child’s play is the infantile form of the human ability to deal with experience by creating model situations and to master reality by experiment and planning.”
—Erik H. Erikson (20th century)