DocumentCode
2501004
Title
PL-a probabilistic logic
Author
Tzvieli, Arie
Author_Institution
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
fYear
1988
fDate
1-5 Feb 1988
Firstpage
462
Lastpage
469
Abstract
A description is given of a logic called PL, which uses probability estimates to express uncertainties (without adopting the conventional probability axioms). The author proposes a generalization of the logical interpretations of the connectives and quantifiers to this case. The notions of a formula, a structure, assignment, satisfaction, deduction, etc., are generalizations of the corresponding first-order ones. A method of assigning semantics to PL is proposed, and some of its properties are studied. The soundness and completeness of PL is studied. In particular, PL is shown to be compatible with the first-order predicate calculus
Keywords
probabilistic logic; PL; assignment; completeness; connectives; deduction; first-order predicate calculus; formula; logical interpretations; probabilistic logic; probability estimates; quantifiers; satisfaction; semantics; soundness; structure; uncertainties; Calculus; Computer science; Expert systems; Fuzzy logic; Monitoring; Probabilistic logic; Software systems; Uncertainty;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Engineering, 1988. Proceedings. Fourth International Conference on
Conference_Location
Los Angeles, CA
Print_ISBN
0-8186-0827-7
Type
conf
DOI
10.1109/ICDE.1988.105492
Filename
105492
Link To Document