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:
“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)
“French rhetorical models are too narrow for the English tradition. Most pernicious of French imports is the notion that there is no person behind a text. Is there anything more affected, aggressive, and relentlessly concrete than a Parisan intellectual behind his/her turgid text? The Parisian is a provincial when he pretends to speak for the universe.”
—Camille Paglia (b. 1947)