A class library implementation of a principled open architecture knowledge representation server with plug-in data types

Authors:
Brian R. Gaines
Affiliations:
Knowledge Science Institute, University of Calgary, Calgary, Alberta, Canada
Venue:
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Year:
1993

Citing 11
Cited 1

An algebraic semantics approach to the effective resolution of type equations

Theoretical Computer Science
Computational complexity of terminological reasoning in BACK

Artificial Intelligence
CLASSIC: a structural data model for objects

SIGMOD '89 Proceedings of the 1989 ACM SIGMOD international conference on Management of data
Reasoning and revision in hybrid representation systems

Reasoning and revision in hybrid representation systems
Subsumption in KL-ONE is undecidable

Proceedings of the first international conference on Principles of knowledge representation and reasoning
Two theses of knowledge representation: language restrictions, taxonomic classification, and the utility of representation services

Artificial Intelligence
Empirical investigation of knowledge representation servers: design issues and applications experience with KRS

ACM SIGART Bulletin - Special issue on implemented knowledge representation and reasoning systems
Organizational modelling and problem solving using object-oriented knowledge representation server and visual language

COCS '91 Proceedings of the conference on Organizational computing systems
Model checking vs. theorem proving: a manifesto

Artificial intelligence and mathematical theory of computation
Feature-constraint logics for unification grammars

Journal of Logic Programming
A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)

A lattice theoretic approach to computation based on a calculus of partially ordered type structures (property inheritance, semantic nets, graph unification)

Knowledge acquisition: Past, present and future

International Journal of Human-Computer Studies

Quantified Score

Hi-index	0.00

Visualization

Abstract

A knowledge representation server is described which provides a fast, memory-efficient and principled system component. Modeling the server through intensional algebraic semantics leads naturally to an open-architecture class library into which new data types may be plugged in as required without change to the basic deductive engine. It is shown that the operation of an existing knowledge representation system, CLASSIC, may be implemented through one data type supporting sets with upper and lower set and cardinality bounds. The architecture developed is cleanly layered by complexity of inference so that fast propagation of constraints is separated from potentially slow model-checking search. Client programs may obtain estimates of the complexity of a request, and may control the resources allocated to its complete solution.