Question-asking strategies for Horn clause systems
暂无分享,去创建一个
[1] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.
[2] John Gaschnig,et al. MODEL DESIGN IN THE PROSPECTOR CONSULTANT SYSTEM FOR MINERAL EXPLORATION , 1981 .
[3] David S. Johnson,et al. Computers and In stractability: A Guide to the Theory of NP-Completeness. W. H Freeman, San Fran , 1979 .
[4] Donald Michie,et al. Expert systems in the micro-electronic age , 1979 .
[5] Edward H. Shortliffe,et al. Rule Based Expert Systems: The Mycin Experiments of the Stanford Heuristic Programming Project (The Addison-Wesley series in artificial intelligence) , 1984 .
[6] Jinchang Wang,et al. Solving propositional satisfiability problems , 1990, Annals of Mathematics and Artificial Intelligence.
[7] Clive L. Dym. Building expert systems: F. Hayes-Roth, D. A. Waterman and D. B. Lenat, (Addison-Wesley, Reading, MA, 1983); 444 pages, $32.50 , 1985 .
[8] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[9] Jeffrey D. Ullman,et al. Efficient tests for top-down termination of logical rules , 1988, JACM.
[10] Jinchang Wang,et al. Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base , 1989, INFORMS J. Comput..
[11] Frederick Hayes-Roth,et al. Building expert systems , 1983, Advanced book program.
[12] C. S. Mellish. Generalised alpha-beta pruning as a guide to expert system question selection , 1986 .
[13] Jean H. Gallier,et al. Linear-Time Algorithms for Testing the Satisfiability of Propositional Horn Formulae , 1984, J. Log. Program..