Knowbel: a hybrid tool for building expert systems

IEEE ExpertPublished 1 February 1993

John Mylopoulos, Hanzhi Wang, Bryan M. Kramer

DOI10.1109/64.193051

Citations2

TL;DR

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.>

Keywords

Computer Science

Communications of the ACMMaintaining knowledge about temporal intervals

7,550 Citations1983James F. Allen

An interval-based temporal logic is introduced, together with a computationally effective reasoning algorithm based on constraint propagation, which is notable in offering a delicate balance between space and time.

View PDF

ACM Transactions on Information SystemsTelos: representing knowledge about information systems

787 Citations1990John Mylopoulos, Alex Borgida +2 more

Telos is a language intended to support the development of information systems based on the premise that information system development is knowledge intensive and that the primary responsibility of any language intended for the task is to be able to formally represent the relevent knowledge.

View PDF

Constraint propagation algorithms for temporal reasoning

643 Citations1986Marc Vilain, Henry Kautz

Computing the consequences of temporal assertions is shown to be computationally intractable in the interval-based representation, but not in the point-based one, but a fragment of the interval language can be expressed using the point language and benefits from the tractability of the latter.

The Journal of Logic ProgrammingA basis for deductive database systems II

172 Citations1986John W. Lloyd, Rodney Topor

The main results are concerned with the nonfloundering and completeness of query evaluation and an alternative query evaluation process and show that corresponding versions of the earlier results can be obtained.

Lecture notes in computer scienceA uniform approach to constraint satisfaction and constraint satisfiability in deductive databases

135 Citations1988François Bry, Hendrik Decker +1 more

A satisfiability checking method is presented that employs integrity maintenance techniques and checks constraint satisfiability, i.e., whether a database exists in which all constraints are simultaneously satisfied.

The Journal of Logic ProgrammingA basis for deductive database systems

90 Citations1985John W. Lloyd, Rodney Topor

The main results are the soundness of the query evaluation process, the sounds of the implementation of integrity constraints, and a simplification theorem for implementing integrity constraints.

National Conference on Artificial IntelligenceAn overview of meta-level architecture

86 Citations1983Michael Genesereth

This work provides a new pathway for engineering thermal conductivity of hybrid perovskites and improving the performance of corresponding devices by optimizing the configurations of both basal bodies and scatterers.

ACM SIGART BulletinEpikit

1 Citations1991Narinder Singh, Michael Genesereth

Epikit is a library of Common Lisp subroutines intended for use in the construction of programs that operate on databases encoded in Knowledge Interchange Format (KIF).

View PDF