A full theorem-prover under uncertainty
Article
Received:
Accepted:
- 26 Downloads
Abstract
Prolog embodies an ordered input resolution inference mechanism, with a powerful unification procedure. However, Prolog is not a full theorem-prover, and does not contain an inexact reasoning mechanism. In this paper, it is shown how these capabilities can be combined in a Prolog environment. A Prolog meta-interpreter is used in an elegant and simple way for this purpose. The inexact reasoning mechanism is presented through the certainty factor model, but it is also discussed how other inexact reasoning models may be also implemented.
Key words
Prolog theorem-proving certainty inexact reasoning model eliminationPreview
Unable to display preview. Download preview PDF.
References
- Bibel, W. and Jorrand, Ph. (eds), 1986,Fundamentals of Artificial Intelligence, An Advanced Course, Lecture Notes in Computer Science, Springer-Verlag, Berlin.Google Scholar
- Buchanan, B.G. and Shortliffe, E.H., 1984,Rule-Based Expert Systems, Addison-Wesley, Reading, Mass.Google Scholar
- Campbell, J.A., 1984,Implementations of Prolog, Ellis Horwood Series in Artificial Intelligence (1984).Google Scholar
- Clocksin, W.F. and Mellish, C.S., 1981,Programming in Prolog, Springer-Verlag, Berlin (1981).Google Scholar
- Hwang, K., Ghosh, J., and Chowkwanyun, R., Computer architectures for artificial intelligence processing,IEEE Computer, pp. 19–27, (January 1987).Google Scholar
- Loveland, D.W. and Stickel, M.E., 1976, A hole in goal trees: Some guidance from resolution theory,IEEE Trans. Comput.,C-25, 335–341 (April 1976).Google Scholar
- Mavrothalassitis, G., 1989, A Prolog-based expert system shell, Diploma Thesis, National Technical University of Athens, Electrical Engineering Department, Computer Science Division (July).Google Scholar
- Panayiotopoulos, T., Papakonstantinou, G., and Stamatopoulos, G., (1988), An attribute grammar based theorem prover,Information and Software Technol.,30(9), 553–560 (November).Google Scholar
- Panayiotopoulos, T., 1989, A grammatical approach to knowledge representation and processing, PhD Thesis, National Technical University of Athens, Electrical Engineering Department, Computer Science Division.Google Scholar
- Panayiotopoulos, T. and Papakonstantinou, G., 1990, An attribute grammar intepreter for inexact reasoning,Information and Software Technol. 32(5), 347–356.Google Scholar
- Panayiotopoulos, T. and Papakonstantinou, G., 1992, An extension of the certainty factor model in first order predicate calculus,The Computer Journal,35, A185-A192.Google Scholar
- Prade, H., 1985, A computational approach to approximate and plausible reasoning with applications to expert systems,IEEE Trans. Pattern Analy. Machine Intell. PAMI-7(3), 260–283 (May).Google Scholar
- Shortliffe, E.H. and Buchanan, B.G., 1975, A model of inexact reasoning in medicine,Math. Biosci. 23, 351–379.Google Scholar
- Sterling, L. and Shapiro, E., 1986,The Art of PROLOG, Advanced Programming Techniques (ed. E. Shapiro), MIT Press, Cambridge, Mass.Google Scholar
- Stickel, M.E., 1984, A Prolog technology theorem prover, inProc. International Symposium of Logic Programming, N.J., pp. 211–217, (February).Google Scholar
- Subrahmanyam, P.A., 1985, The software engineering of expert systems: Is PROLOG Appropriate?IEEE Trans. Software Eng. SE-11(11), 1391–1400 (November).Google Scholar
Copyright information
© Kluwer Academic Publishers 1993