Examples of using Stable model in English and their translations into Portuguese
{-}
-
Official
-
Colloquial
-
Medicine
-
Financial
-
Ecclesiastic
-
Ecclesiastic
-
Computer
-
Official/political
For exampleis a shorthand for==Generating stable models==To find a stable model of the Lparse program stored in file codice_3 we use the commandOption 0 instructs smodels to find"all" stable models of the program.
traditional rules, the definition of a stable model according to Ferraris is equivalent to the original definition.
To extend the stable model semantics to disjunctive programs,
To find a stable model of the Lparse program stored in file${filename} we use the command% lparse${filename}|
If we think of the stable model semantics as a description of the behavior of Prolog in the presence of negation then programs without a unique stable model can be judged unsatisfactory: they do not provide an unambiguous specification for Prolog-style query answering.
the only stable model of P{\displaystyle P}
what is the ECB's position on a stable model for constructing a true system of solidarity between the Member States with regard to sovereign debt?
A program with negation may have many stable models or no stable models.
Their approach is based on the relationship between plans and stable models.
then we say that it has no stable models.
the set of stable models of a program is an antichain.
As in the traditional case, the stable models of a disjunctive program are minimal
the antichain property of stable models of a traditional program do not hold in the general case.
Furthermore, if an atom is false in the well-founded model of a program then it does not belong to any of its stable models.
But the use of stable models in answer set programming provides a different perspective on such programs.
The cross-classification presented stable models, with the estimated risk by this method very close to the final model,
Instead of stable models, this generalization uses answer sets, which may include both atoms
has no stable models.
a given search problem is represented by a logic program so that the stable models of the program correspond to solutions.
Then programs with many stable models correspond to problems with many solutions, and programs without stable models correspond to unsolvable problems.