Probabilistic and Truth-Functional Many-Valued Logic Programming

Authors:
Thomas Lukasiewicz
Affiliations:
-
Venue:
ISMVL '99 Proceedings of the Twenty Ninth IEEE International Symposium on Multiple-Valued Logic
Year:
1999

Citing 0
Cited 7

Probabilistic logic programming with conditional constraints

ACM Transactions on Computational Logic (TOCL)
Probabilistic Default Reasoning with Conditional Constraints

Annals of Mathematics and Artificial Intelligence
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics

LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Many-Valued Disjunctive Logic Programs with Probabilistic Semantics

LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Managing Uncertainty and Vagueness in Description Logics, Logic Programs and Description Logic Programs

Reasoning Web
Probabilistic deduction with conditional constraints over basic events

Journal of Artificial Intelligence Research
Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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 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 L_n. 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.