Author_Institution :
Dept. of Comput. Sci., Louisiana State Univ., Baton Rouge, LA, USA
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;
