Probalistic and truth-functional many-valued logic programming
Lukasiewicz, Thomas
Zum Volltext im pdf-Format:
Dokument 1.pdf (274 KB)
(Anm.: Die Zeichendarstellung in diesem Abstract entspricht nicht der Vorlage)
Bitte beziehen Sie sich beim Zitieren dieses Dokumentes immer auf folgende
URN: urn:nbn:de:hebis:26-opus-1409
URL: http://geb.uni-giessen.de/geb/volltexte/1999/140/
Universität
Justus-Liebig-Universität Gießen
Institut:
Institut für Informatik
Fachgebiet:
Informatik
DDC-Sachgruppe:
Informatik
Dokumentart:
ResearchPaper
Zeitschrift, Serie:
IFIG Research Report
; 9809 / 1998
Sprache:
Englisch
Erstellungsjahr:
1998
Publikationsdatum:
04.03.1999
Kurzfassung auf Englisch:
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 of probabilistic manyÂvalued logic programming. Surprisingly, manyÂvalued logic programs in Pr*n have both a probabilistic semantics in probabilities over a set of possible worlds and a truthÂfunctional semantics in the finiteÂvalued Lukasiewicz logics Ln. Moreover, manyÂvalued 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 manyÂvalued logic programming in Pr*n and show its soundness and completeness.
Lizenz:
Veröffentlichungsvertrag für Publikationen ohne Print on Demand
