Probabilistic and Truth−Functional Many−Valued Logic Programming
<p>We introduce probabilistic many-valued logic programs in which the implication connective is interpreted as material implication. We show that probabilistic many-valued logic programming is computationally more complex than classical logic programming. More precisely, some deduction problem...
第一著者: | Lukasiewicz, T |
---|---|
フォーマット: | Conference item |
出版事項: |
IEEE
1999
|
類似資料
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
著者:: Lukasiewicz, T
出版事項: (1999) -
Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
著者:: Lukasiewicz, T
出版事項: (2001) -
Many−Valued First−Order Logics with Probabilistic Semantics
著者:: Lukasiewicz, T
出版事項: (1999) -
Probabilistic Logic Programming
著者:: Lukasiewicz, T
出版事項: (1998) -
Probabilistic Description Logic Programs
著者:: Lukasiewicz, T
出版事項: (2007)