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

相似書籍