By Topic

Compilation of logic programs to implement very large knowledge base systems-a case study: Educe

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Bocca, J. ; ECRC, Munich, West Germany

One of the most promising technologies being used for constructing knowledge-base systems is the integration of programming languages based on the logic paradigm, Prolog, for example and relational DBMSs. In theory, at least, it provides a base on which development systems for constructing very large knowledge-base systems could be implemented. However, to achieve this goal in practical terms, improvements in performance by several orders of magnitude over existing systems must be obtained. Toward this performance improvement, an examination is made of the compilation of logic programs and their subsequent storage, retrieval, and execution in the specified context. An inspection is made of the relationship between relational engines as found in relational DBMSs and the Warren Abstract Machine (WAM), the most efficient and powerful model used for the construction of Prolog compilers. The development of the Educe system is used to illustrate implementation issues

Published in:

Data Engineering, 1990. Proceedings. Sixth International Conference on

Date of Conference:

5-9 Feb 1990