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:
“If, then, this civilization is to be saved, if it is not to be submerged by centuries of barbarism, but to secure the treasures of its inheritance on new and more stable foundations, there is indeed need for those now living fully to realize how far the decay has already progressed.”
—Johan Huizinga (1872–1945)
“She represents the unavowed aspiration of the male human being, his potential infidelity—and infidelity of a very special kind, which would lead him to the opposite of his wife, to the “woman of wax” whom he could model at will, make and unmake in any way he wished, even unto death.”
—Marguerite Duras (b. 1914)