Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Probabilistic propositional logic
Guggenheimer H., Polytechnic University, Brooklyn, NY, 1987. Type: Book
Date Reviewed: Jan 1 1989

The abstract of this paper begins “the object of this work is the presentation of a mathematically sound basis for the application of the mathematical theory of probability to propositional logic as used in artificial intelligence.” The paper succeeds admirably and makes an important contribution toward rectifying the enduring dilemma that various uncertainty calculi found in artificial intelligence systems are not, by and large, mathematical objects. Extending the work of Nilsson [1], a sample space is defined that allows the derivation of universal stochastic inequalities for propositional logic with (true) probabilities. The construction gives a sufficient basis for a thorough treatment of Dempster’s rule on the combination of evidence as applied to logic [2] and yields some very strong limit theorems. One practical consequence of these results is that in cases where a moderate number of items of information yields a yes/no decision, the straightforward Dempster rule for one proposition can be used even in questions involving more than one proposition. Surprisingly, Dempster’s original formulation appears to be better suited to probabilistic logic than Shafer’s reformulation.

Other methods for reasoning with uncertainty, as given in Freedman [3], are also examined, along with Bayesian updating and fuzzy numbers. An appendix contains a measure theoretic analysis of fuzzy sets using the paper’s framework. An interesting and provocative question is embedded in the paper: can effective reasoning systems be built upon a fixed rule of combination? This question asks whether a dynamic uncertainty method, one which responds to the status of an inference, will be needed. As the author points out, a mathematical version of Halpern and Rabin’s non-numerical approach [4] would be such a method. If this is true, computationally efficient artificial intelligence systems that incorporate reasoning with uncertainty are farther off than we had imagined.

The presentation is mathematically demanding but clear. I recommend this paper, but strongly suggest that the reader first review Nilsson and Dempster’s work.

Reviewer:  Stan Raatz Review #: CR124222
1) Nilsson, N.Probabilistic logic. Artif. Intell. 28 (1986), 71–87. See <CR> Rev. 8609-0841.
2) Dempster, A. P.Upper and lower probabilities induced by a multi-valued mapping. Ann. Math. Stat. 38 (1967), 325–339.
3) Freedman, R. S.Algorithms for reasoning with uncertainty. PNAI 2 (1986).
4) Halpern, J. Y. and Rabin, M. O.A logic to reason about likelihood. Artif. Intell. 32 (1987), 379–405.
Bookmark and Share
 
Predicate Logic (I.2.4 ... )
 
 
Uncertainty, “Fuzzy,” And Probabilistic Reasoning (I.2.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Predicate Logic": Date
Modeling production rules by means of predicate transition networks
Giordana A., Saitta L. Information Sciences 35(1): 1-41, 1985. Type: Article
Oct 1 1985
Symbolic normalized acquisition and representation of knowledge
Bouchon B., Laurière J. Information Sciences 37(1-3): 85-94, 1985. Type: Article
Nov 1 1986
Probabilistic logic
Nilsson N. (ed) Artificial Intelligence 28(1): 71-88, 1986. Type: Article
Sep 1 1986
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy