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:
“A horse, a buggy and several sets of harness, valued in all at about $250, were stolen last night from the stable of Howard Quinlan, near Kingsville. The county police are at work on the case, but so far no trace of either thieves or booty has been found.”
—H.L. (Henry Lewis)
“One of the most important things we adults can do for young children is to model the kind of person we would like them to be.”
—Carol B. Hillman (20th century)