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:
“In short, no association or alliance can be happy or stable without me. People can’t long tolerate a ruler, nor can a master his servant, a maid her mistress, a teacher his pupil, a friend his friend nor a wife her husband, a landlord his tenant, a soldier his comrade nor a party-goer his companion, unless they sometimes have illusions about each other, make use of flattery, and have the sense to turn a blind eye and sweeten life for themselves with the honey of folly.”
—Desiderius Erasmus (c. 1466–1536)
“The striking point about our model family is not simply the compete-compete, consume-consume style of life it urges us to follow.... The striking point, in the face of all the propaganda, is how few Americans actually live this way.”
—Louise Kapp Howe (b. 1934)