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...
Autore principale: | Lukasiewicz, T |
---|---|
Natura: | Conference item |
Pubblicazione: |
IEEE
1999
|
Documenti analoghi
-
Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
di: Lukasiewicz, T
Pubblicazione: (1999) -
Fixpoint Characterizations for Many−Valued Disjunctive Logic Programs with Probabilistic Semantics
di: Lukasiewicz, T
Pubblicazione: (2001) -
Many−Valued First−Order Logics with Probabilistic Semantics
di: Lukasiewicz, T
Pubblicazione: (1999) -
Probabilistic Logic Programming
di: Lukasiewicz, T
Pubblicazione: (1998) -
Probabilistic Description Logic Programs
di: Lukasiewicz, T
Pubblicazione: (2007)