|
| << vorige | volgende >> |
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
Details van artikel 12 van 26 gevonden artikelen
| Titel: |
Extended Stable Models for Logical Programs with Many Negations |
| Auteur: |
Victor Felea |
| Verschenen in: |
Journal of applied sciences |
| Paginering: | Jaargang 2 (2002) nr. 10 pagina's 980-984 |
| Jaar: |
2002 |
| Inhoud: |
The family of stable models for a logic program with one negation was studied by Melvin Fitting. We introduce extended stable model semantics of logic programs with many negations, which natural extends the notion of stable model semantics for logic programs with one negation. We use the notion of bilattice with two ordering which defines the structure of the family of stable models. The first one is called knowledge ordering, the second one is called degree of truth. For a vector of valuations in a billatice B, we define a pseudovaluation and an operator associated to a program <img src="../xml/jas/2002/images/image1-2k2-980-984.gif" width="13" height="14">. We also consider the notion of i-model for a program <img src="../xml/jas/2002/images/image1-2k2-980-984.gif" width="13" height="14">. For an operator we define a fixed-point iteration. This iteration is applied to the operator associated to <img src="../xml/jas/2002/images/image1-2k2-980-984.gif" width="13" height="14"> and produces so-called extended stability operators. When the fixed-point iteration can be applied by n times, where n is the number of negations, then every fixed point of the last operator is an extended stable valuation of <img src="../xml/jas/2002/images/image1-2k2-980-984.gif" width="13" height="14">. |
| Uitgever: |
Asian Network for Scientific Information, Pakistan (provided by DOAJ) |
| Bronbestand: |
Elektronische Wetenschappelijke Tijdschriften |
Details van artikel 12 van 26 gevonden artikelen
| << vorige | volgende >> |