Conference item icon

Conference item

Probabilistic and Truth−Functional Many−Valued Logic Programming

Abstract:

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 problems that are P-complete for classical logic programs are shown to be co-NP-complete for probabilistic many-valued logic programs. We then focus on many-valued logic programming in Pr_n* as an approximation...

Expand abstract

Actions


Publisher:
IEEE
Host title:
Proceedings of the 29th IEEE International Symposium on Multiple−Valued Logic‚ ISMVL 1999‚ Freiburg‚ Germany‚ May 20−22‚ 1999
Publication date:
1999-01-01
UUID:
uuid:220e9f1a-dd1d-4c21-8279-c33586075f14
Local pid:
cs:6745
Deposit date:
2015-03-31

Terms of use


Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP