The goal of this project was to enable knowledge engineers to construct knowledge bases faster. We investigated two techniques: knowledge reuse and axiom templates. The results were demonstrated by developing a question-answering system for the crisis management challenge problem.
Rule-based systems are being applied to tasks of increasing responsibility. Deductive methods are being applied to their validation, to detect flaws in these systems and enable us to use them with more confidence.
This paper introduces the first implemented version of the problem solving language QA4 and illustrates the application of this language to some simple robot planning problems. Features of the language include built-in backtracking, parallel processing, pattern matching, and set manipulation.
This report presents a language, called QA4, designed to facilitate the construction of problem-solving systems used for robot planning, theorem proving, and automatic program synthesis and verification.
Earl D. Sacerdoti, Richard E. Fikes, Rene Reboh, Daniel Sagalowicz, Richard J. Waldinger, & B.M. Wilber
This paper presents a functional overview of the features and capabilities of QLISP, one of the newest of the current generation of very high level languages developed for use in artificial intelligence (AI) research.
This paper describes a theorem prover that embodies knowledge about programming constructs, such as numbers, arrays, lists, and expressions. The program can reason about these concepts and is used as part of a program verification system that uses the Floyd-Naur explication of program semantics.
This report summaries the results of a three-year project aimed at the design and implementation of computer languages to aid in expressing problem solving procedures in several areas of artificial intelligence including automatic programming, theorem proving, and robot planning.
The objective of the proposed research is to establish design criteria for an automatic program-synthesizing system. We will devise a natural way to define program-writing problems and describe programming languages, and then improve the known methods of program synthesis and investigate new ones.
Deductive techniques are presented for deriving programs systematically from given specifications. The specifications express the purpose of the desired program without giving any hint of the algorithm to be employed.
TABLOG (Tableau Logic Programming Language) is a language based on first-order predicate logic with equality that combines functional and logic programming. TABLOG incorporate advantages of LISP and PROLOG.
