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