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...
Autor principal: | Lukasiewicz, T |
---|---|
Formato: | Conference item |
Publicado em: |
Springer
2001
|
Registos relacionados
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
Por: Lukasiewicz, T
Publicado em: (1999) -
Many−Valued First−Order Logics with Probabilistic Semantics
Por: Lukasiewicz, T
Publicado em: (1999) -
Probabilistic and Truth−Functional Many−Valued Logic Programming
Por: Lukasiewicz, T
Publicado em: (1999) -
A Probabilistic Higher-order Fixpoint Logic
Por: Yo Mitani, et al.
Publicado em: (2021-12-01) -
Characterizing definability in decidable fixpoint logics
Por: Benedikt, M, et al.
Publicado em: (2017)