Abstract
An expert system applies the deduction rules in its knowledge base to a set of initial data to reach a conclusion. When the initial data are insufficient, the expert system may ask the user for additional information. This paper analyzes effectiveness and efficiency of question-asking strategies in expert systems with Horn clause knowledge bases. An effective strategy reaches a conclusion after asking as few questions as possible. An efficient strategy can be computed quickly. We prove that effective strategies are, unfortunately, not efficient. However, we present a somewhat less effective but very efficient strategy. It employs an algorithm which simultaneously performs deduction and question selection in log-linear time.
Similar content being viewed by others
References
A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
B.G. Buchanan and E.H. Shortliffe,Rule-Based Expert Systems — The MYCIN Experiments of the Stanford Heuristic Programming Project (Addison-Wesley, Reading, MA., 1984).
W.F. Dowling and J.H. Gallier, Linear time algorithms for testing the satisfiability of Horn formulae, J. Logic Programming 3 (1984) 267–284.
R. Duda, J. Gasching and P. Hart, Model design in the PROSPECT consultant system for mineral exploration,Expert Systems in the Micro-electronic Age (Edinburgh Univ. Press, UK, 1979).
M.R. Garey and D.S. Johnson,Computers and Intractability (W.H. Freeman, New York, 1979).
E. Hayes-Roth, D.A. Waterman and D.B. Lenat,Building Expert Systems (Addison-Wesley, Reading, MA, 1983).
R.G. Jeroslow and J. Wang, Dynamic programming integral polyhedra and Horn clause knowledge bases, ORSA's J. Computing (Winter 1989) 7–19.
R.G. Jeroslow and J. Wang, Solving prepositional satisfiability problems, Ann. Math. and AI 1 (1990) 167–187.
C.S. Mellish, Generalised alpha-beta pruning as a guide to expert system question selection,Expert System 85, Proc. 5th Technical Conf. of the British Computer Society Specialist Group on Expert Systems, Univ. of Warwick, 1985 (Cambridge Univ. Press, Cambridge CB2 1RP, 1985) pp. 31–41.
R.E. Tarjan, Data structures and network algorithms, Society for Industrial and Applied Mathematics, Philadelphia (1983).
J.D. Ullman and A. Van Gelder, Efficient test for top-down termination of logical rules, J. ACM 35 (1988) 345–373.
J. Wang, Propositional logic and discrete optimization, College of Management, Georgia Institute of Technology, in preparation.
Author information
Authors and Affiliations
Additional information
Supported in part by NSF grant DMS-8513970.
Rights and permissions
About this article
Cite this article
Wang, J., Vande Vate, J. Question-asking strategies for Horn clause systems. Ann Math Artif Intell 1, 359–370 (1990). https://doi.org/10.1007/BF01531084
Published:
Issue Date:
DOI: https://doi.org/10.1007/BF01531084