Liebe Nutzerinnen und Nutzer in der Zeit von Montag 22.04. 9:00Uhr bis voraussichtlich Mitwoch 24.04. 9:00Uhr ist JLUpub aufgrund von Wartungsarbeiten nicht erreichbar. Danke für Ihr Verständnis.
Dear users, JLUpub will be unavailable from Monday 22.04. 9:00 a.m. until probably Wednesday 24.04. 9:00 a.m. due to maintenance work. Thank you for your understanding.
Probalistic and truth-functional many-valued logic programming
| dc.contributor.author | Lukasiewicz, Thomas | |
| dc.date.accessioned | 2022-09-12T09:38:42Z | |
| dc.date.available | 1999-03-04T23:00:00Z | |
| dc.date.available | 2022-09-12T09:38:42Z | |
| dc.date.issued | 1998 | |
| dc.identifier.uri | http://nbn-resolving.de/urn:nbn:de:hebis:26-opus-1409 | |
| dc.identifier.uri | https://jlupub.ub.uni-giessen.de//handle/jlupub/7556 | |
| dc.identifier.uri | http://dx.doi.org/10.22029/jlupub-6990 | |
| dc.description.abstract | We introduce probabilistic manyvalued 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 Pcomplete for classical logic programs are shown to be coNPcomplete for probabilistic manyvalued logic programs. We then focus on manyvalued logic programming in Pr*n as an approximation of probabilistic manyvalued logic programming. Surprisingly, manyvalued logic programs in Pr*n have both a probabilistic semantics in probabilities over a set of possible worlds and a truthfunctional semantics in the finitevalued Lukasiewicz logics Ln. Moreover, manyvalued logic programming in Pr*n has a model and fixpoint characterization, a proof theory, and computational properties that are very similar to those of classical logic programming. We especially introduce the proof theory of manyvalued logic programming in Pr*n and show its soundness and completeness. | en |
| dc.language.iso | en | de_DE |
| dc.relation.ispartofseries | IFIG Research Report; 9809 / 1998 | |
| dc.rights | In Copyright | * |
| dc.rights.uri | http://rightsstatements.org/page/InC/1.0/ | * |
| dc.subject.ddc | ddc:004 | de_DE |
| dc.title | Probalistic and truth-functional many-valued logic programming | en |
| dc.type | workingPaper | de_DE |
| local.affiliation | FB 07 - Mathematik und Informatik, Physik, Geographie | de_DE |
| local.comment | (Anm.: Die Zeichendarstellung in diesem Abstract entspricht nicht der Vorlage) | |
| local.opus.id | 140 | |
| local.opus.institute | Institut für Informatik | de_DE |
| local.opus.fachgebiet | Informatik | de_DE |
Dateien zu dieser Ressource
Das Dokument erscheint in:
Urheberrechtlich geschützt