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

類似資料