Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
<p>In this paper, we continue to explore many-valued disjunctive logic programs with probabilistic semantics. In particular, we newly introduce the least model state semantics for such programs. We show that many-valued disjunctive logic programs under the semantics of minimal models, perfect...
Auteur principal: | Lukasiewicz, T |
---|---|
Format: | Conference item |
Publié: |
Springer
2001
|
Documents similaires
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
par: Lukasiewicz, T
Publié: (1999) -
Many−Valued First−Order Logics with Probabilistic Semantics
par: Lukasiewicz, T
Publié: (1999) -
Probabilistic and Truth−Functional Many−Valued Logic Programming
par: Lukasiewicz, T
Publié: (1999) -
A Probabilistic Higher-order Fixpoint Logic
par: Yo Mitani, et autres
Publié: (2021-12-01) -
Characterizing definability in decidable fixpoint logics
par: Benedikt, M, et autres
Publié: (2017)