Knowbel: A Hybrid Tool for Building Expert Systems
Pages 17 - 24
Abstract
Knowbel, an expert system tool that at one level supports representation and organization of concepts and on a second level offers a logic programming system that lets developers tailor an inference mechanism to a particular application, is discussed. Knowbel's top level uses the Telos knowledge representation language to represent and organize the concepts describing the application; instead of a production-rule language, Telos uses an assertional sublanguage based on deductive database research. Instead of a procedural language, Knowbel's second level uses the MRS (metareasoning system) logic programming system to customize the expert system's search strategy for the task at hand. Knowbel's system architecture and prototype implementation are described. Two prototype applications, an alarm-filtering component for the APACS project and an intelligent help system for computer users, are also discussed.
References
[1]
1. J. Mylopoulos et al. "Telos: A Language for Representing Knowledge About Information Systems," ACM Trans. Information Systems , Vol. 8. No. 1. Oct. 1990. pp. 325-362.]]
[2]
2. F. Bry, H. Decker, and R. Manthey, "A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases." Proc. Int'l Conf. Extending Database Technology, Springer-Verlag. Berlin. 1988, pp. 488-505.]]
[3]
3. N. Singh and M. Genesereth. "EPIKIT: A Library of Subroutines Supporting Declarative Representations and Reasoning," SIGArt Bull., Vol. 2, No. 3. June 1991. pp. 143- 151.]]
[4]
4. M.R. Genesereth. "An Overview of Metalevel Architecture," Proc. Nat'l Conf. Artificial Intelligence (AAAI '83), MIT Press. Cambridge, Mass., 1983, pp. 119-124.]]
[5]
5. J. Lloyd and R. Topor. "A Basis for Deductive Database Systems." J. Logic Programming . Vol. 2. No. 2, July 1985. pp. 93-109.]]
[6]
6. M. Koubarakis et al. "Telos: Features and Formalization," Tech. Report KRR-TR-89- 4, Dept. of Computer Science, Univ. of Toronto. 1989.]]
[7]
7. J. Allen. "Maintaining Knowledge about Temporal Intervals," Comm. ACM, Vol. 26. No. 11. Nov. 1983. pp. 832-843.]]
[8]
8. M. Vilain and H. Kautz. "Constraint Propagation Algorithms for Temporal Reasoning," Proc. Nat'l Conf. Artificial Intelligence (AAAI '86), MIT Press, Cambridge, Mass. 1986, pp. 377-382.]]
[9]
9. A.A. Mounir. "Ixtet: Un Système de Gestion de Treillis d'Instants." Report LAAS 88.153. Laboratoire d' Automatique et d' Analyse des Systèmes/CNRS, Toulouse, France. 1988.]]
[10]
10. J. Mylopoulos et al., "Using an Expert System Tool for Process Control Applications." Canadian Conf. Electrical and Computer Eng., Eng. Institute of Canada, Ottawa. 1990, pp. 42.4.1-42.4.6.]]
[11]
11. A. Kushniruk and H. Wang, "An Expert System for Providing Help to Computer Users," Proc. World Congress on Expert Systems. Pergamon Press, New York, 1991. pp. 1,469-1477.]]
[12]
12. A. Kushniruk, H. Wang. and D. LePage. "The Net-Advisor: An Expert System for Providing Help to Network Users," Proc. Canadian Conf. Electrical and Computer Eng., Canadian Soc. Electrical and Computer Eng., Montreal, 1991, pp. 74.1 .1- 74.1.6.]]
- Knowbel: A Hybrid Tool for Building Expert Systems
Recommendations
Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell SymposiumProgrammers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Definitional Interpreters for Higher-Order Programming Languages
Higher-order programming languages (i.e., languages in which procedures or labels can occur as values) are usually defined by interpreters that are themselves written in a programming language based on the lambda calculus (i.e., an applicative language ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Copyright © Copyright © 1993 IEEE. All Rights Reserved.
Publisher
IEEE Educational Activities Department
United States
Publication History
Published: 01 February 1993
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025