Database Access Requirements of Knowledge-Based Systems
19 Pages Posted: 31 Oct 2008
Date Written: April 1984
Abstract
Knowledge bases constitute the core of those Artificial Intelligenceprograms which have come to be known as Expert Systems. Anexamination of the most dominant knowledge representation schemes usedin these systems reveals that a knowledge base can, and possiblyshould, be described at several levels using different schemes,including those traditionally used in operational databases. Thischapter provides evidence that solutions to the organization andaccess problem for very large knowledge bases require the employmentof appropriate database management methods, at least for the lowestlevel of description -- the facts or data. We identify the databaseaccess requirements of knowledge-based or expert systems and thenpresent four general architectural strategies for the design of expertsystems that interact with databases, together with specificrecommendations for their suitability in particular situations. Animplementation of the most advanced and ambitious of these strategiesis then discussed in some detail.
Suggested Citation: Suggested Citation
Do you have negative results from your research you’d like to share?
Recommended Papers
-
An Optimizing Prolog Front-End to a Relational Query System
By Matthias Jarke, James Clifford, ...
-
Common Subexpression Isolation in Multiple Query Optimization
-
Access to Specific Declarative Knowledge by Expert Systems: The Impact of Logic Programming
By Yannis Vassiliou, James Clifford, ...
-
Logic-Based Formula Management Strategies in an Actuarial Consulting System
-
Range Nesting: A Fast Method to Evaluate Quantified Queries
By Matthias Jarke and Jurgen Koch
-
Designing Expert Systems in a Business Environment
By James Clifford, Matthias Jarke, ...
-
Query Processing Strategies in the Pascal/R Relational Database Management System
By Matthias Jarke and Joachim W. Schmidt
-
Introduction to Query Processing
By Matthias Jarke, Jurgen Koch, ...
-
External Semantic Query Simplification: a Graph-Theoretic Approach and its Implementation in Prolog