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...
第一著者: | Lukasiewicz, T |
---|---|
フォーマット: | Conference item |
出版事項: |
Springer
2001
|
類似資料
Model-checking games for fixpoint logics with partial order models
著者:: Gutierrez, J, 等
出版事項: (2010)
著者:: Gutierrez, J, 等
出版事項: (2010)
Model-checking games for fixpoint logics with partial order models
著者:: Gutierrez, J, 等
出版事項: (2009)
著者:: Gutierrez, J, 等
出版事項: (2009)
類似資料
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
著者:: Lukasiewicz, T
出版事項: (1999) -
Many−Valued First−Order Logics with Probabilistic Semantics
著者:: Lukasiewicz, T
出版事項: (1999) -
Probabilistic and Truth−Functional Many−Valued Logic Programming
著者:: Lukasiewicz, T
出版事項: (1999) -
A Probabilistic Higher-order Fixpoint Logic
著者:: Yo Mitani, 等
出版事項: (2021-12-01) -
Characterizing definability in decidable fixpoint logics
著者:: Benedikt, M, 等
出版事項: (2017)