The interaction between assertional and terminological knowledge in krypton

Authors:
Victoria Pigman
Affiliations:
Stanford University and Fairchild Laboratory for Artificial Intelligence Research
Venue:
PKWBS-W'84 Proceedings of the 1984 IEEE conference on Principles of knowledge-based systems
Year:
1984

Citing 5
Cited 1

Foundations of a functional approach to knowledge representation.

Artificial Intelligence
What makes a knowledge base knowledgeable? A view of databases from the knowledge level

Proceedings from the first international workshop on Expert database systems
A Proof Procedure Using Connection Graphs

Journal of the ACM (JACM)
Problem-Solving Methods in Artificial Intelligence

Problem-Solving Methods in Artificial Intelligence
Krypton: A Functional Approach to Knowledge Representation

Computer

Theory links: Applications to automated theorem proving

Journal of Symbolic Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

KRYPTON is a knowledge representation system that embodies a functional approach and divides its knowledge into two types, corresponding to structured definitions for terminological information and assertions of contingent facts about some world. In the current implementation of KRYPTON, we have integrated a taxonomy containing frame-like definitions, similar to that of KL-ONE, with a non-clausal connection graph resolution theorem prover. Herein we shall focus on the interaction between these two pieces in forming an integrated KRYPTON system. This interaction is centered around the use of the definitions in the terminological hierarchy to form links in the connection graph and in how these links are to be activated. We have found that the functionality needed in a general-purpose theorem prover is not entirely malleable to the needs of a system whose domain-specific terms are assumed to form a terminological hierarchy.