Stable Models
The definition of a stable model below, reproduced from, uses two conventions. First, a truth assignment is identified with the set of atoms that get the value T. For instance, the truth assignment
|
|
|
|
|
is identified with the set . This convention allows us to use the set inclusion relation to compare truth assignments with each other. The smallest of all truth assignments is the one that makes every atom false; the largest truth assignment makes every atom true.
Second, a logic program with variables is viewed as shorthand for the set of all ground instances of its rules, that is, for the result of substituting variable-free terms for variables in the rules of the program in all possible ways. For instance, the logic programming definition of even numbers
is understood as the result of replacing in this program by the ground terms
in all possible ways. The result is the infinite ground program
Read more about this topic: Stable Model Semantics
Famous quotes containing the words stable and/or models:
“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)
“Grandparents can be role models about areas that may not be significant to young children directly but that can teach them about patience and courage when we are ill, or handicapped by problems of aging. Our attitudes toward retirement, marriage, recreation, even our feelings about death and dying may make much more of an impression than we realize.”
—Eda Le Shan (20th century)