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...
| Huvudupphovsman: | |
|---|---|
| Materialtyp: | Conference item |
| Publicerad: |
IEEE
1999
|