Abstract
Where we have measurable attributes and multiple possible strategies within an expert system there are situations where the theory of belief functions requires refinement and explanation. Given a set of attributes for which mapping exists to a topology of strategies, I will show how we refine Dempster-Shafer theory to interpret both combinations of strategies based on qualitative measures and combinations of possibly conflicting quantitative measures. This is then applied in an expert system for selecting appropriate numerical routines for the solution of a range of mathematical problems.
The project “More Intelligent Delivery of Numerical Analysis to a Wider Audience” is funded by the UK Govt. Joint Information Systems Committee under their New Technologies Initiative (NTI-24)
Preview
Unable to display preview. Download preview PDF.
References
Buchanen, B.G., Shortliffe, E.H. [eds]: Rule-Based Expert Systems: The MYCIN Experiments of the Stanford Heuristic Programming Project. Reading, Mass.: Addison Wesley. 1984.
Dupée, B.J., Davenport, J.H.: Using Computer Algebra to Choose and Apply Numerical Routines. AXIS, 2(3), 31–41. 1995.
Gordon, J., Shortliffe, E.H.: The Dempster-Shafer Theory of Evidence and its Relevance to Expert Systems. In: Buchanen & Shortliffe (1984). 1983.
Gordon, J., Shortliffe, E.H.: A Method of Managing Evidential Reasoning in a Hierarchical Hypothesis Space. Artificial Intelligence, 26(3), 323–357. 1985.
Houstis, E. N., Rice, J. R., Vichnevetsky, R. [eds]: Expert Systems for Scientific Computing. Amsterdam: North-Holland. Proceedings of the Second IMACS International Conference on Expert Systems for Numerical Computing, Purdue University, April 1992.
Kruse, R., Schwecke, E., Heinsohn, J.: Uncertainty and Vagueness in Knowlege Based Systems: Numerical Methods. Berlin: Springer Verlag. 1991.
Lucks, M., Gladwell, I.: Automated Selection of Mathematical Software. ACM Transactions on Mathematical Software, 18(1), 11–34. Also published in Houstis et al. (1992, pp 421–459) as ‘A Functional Representation for Software Selection Expertise'. 1992.
NAG.: Fortran Library Manual — Mark 16. NAG Ltd, Oxford, UK. NAG Publication Code NP2478. 1993.
Pearl, J.: On Evidential Reasoning in a Hierarchy of Hypotheses. Artificial Intelligence, 28(1), 9–15. 1986
Pearl, J.: Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, Calif.: Morgan Kaufmann. 1988.
Shafer, G.: A Mathematical Theory of Evidence. Princeton, NJ: Princeton University Press. 1976.
Shafer, G., Logan, R.: Implementing Dempster's Rule for Hierarchical Evidence. Artificial Intelligence, 33, 271–298. 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dupée, B.J. (1996). Measuring the likely effectiveness of strategies. In: Calmet, J., Campbell, J.A., Pfalzgraf, J. (eds) Artificial Intelligence and Symbolic Mathematical Computation. AISMC 1996. Lecture Notes in Computer Science, vol 1138. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61732-9_58
Download citation
DOI: https://doi.org/10.1007/3-540-61732-9_58
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61732-7
Online ISBN: 978-3-540-70740-0
eBook Packages: Springer Book Archive