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...
Main Author: | Lukasiewicz, T |
---|---|
Format: | Conference item |
Published: |
Springer
2001
|
Similar Items
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
by: Lukasiewicz, T
Published: (1999) -
Many−Valued First−Order Logics with Probabilistic Semantics
by: Lukasiewicz, T
Published: (1999) -
Probabilistic and Truth−Functional Many−Valued Logic Programming
by: Lukasiewicz, T
Published: (1999) -
A Probabilistic Higher-order Fixpoint Logic
by: Yo Mitani, et al.
Published: (2021-12-01) -
Characterizing definability in decidable fixpoint logics
by: Benedikt, M, et al.
Published: (2017)