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:
“This stable is a Prince’s court.
This crib His chair of state;
The beasts are parcel of His pomp,
The wooden dish His plate.”
—Robert Southwell (1561?–1595)
“For an artist to marry his model is as fatal as for a gourmet to marry his cook: the one gets no sittings, and the other gets no dinners.”
—Oscar Wilde (1854–1900)