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...
Glavni autor: | Lukasiewicz, T |
---|---|
Format: | Conference item |
Izdano: |
Springer
2001
|
Slični predmeti
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
od: Lukasiewicz, T
Izdano: (1999) -
Many−Valued First−Order Logics with Probabilistic Semantics
od: Lukasiewicz, T
Izdano: (1999) -
Probabilistic and Truth−Functional Many−Valued Logic Programming
od: Lukasiewicz, T
Izdano: (1999) -
A Probabilistic Higher-order Fixpoint Logic
od: Yo Mitani, i dr.
Izdano: (2021-12-01) -
Characterizing definability in decidable fixpoint logics
od: Benedikt, M, i dr.
Izdano: (2017)