Using active connection graphs for reasoning with recursive rules
Published 24 August 1981
Donald P. MoKay, Stuart C. Shapiro
Citations80
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
SNIP, the SNaPS Inference Package, can use reouralva rules without causing infinite loopa or requiring that arbitrarily many copies of them be made.
Abstract
Raouralva r u l e s, such as "Your paren ts ' ancestors are your ances tors " , a l though vary uaafu l f o r theorem p rov ing, na tu ra l languaga understanding, quest ion-answering and In fo rmat ion r e t r i e v a l systems, present problems f o r many such
Keywords
Computer Science
Journal of the ACMA Proof Procedure Using Connection Graphs
254 Citations1975Robert Kowalski
A new theorem-proving system designed to remedy deficiencies of resolution systems is presented, beginning as a supplement to SL-resolution in the form of classificatmn trees and incorporating an analogue of the Waltz algorithm for picture Interpretation.
Elsevier eBooksTHE SNePS SEMANTIC NETWORK PROCESSING SYSTEM
180 Citations1979Stuart C. Shapiro
This chapter describes the SNePS semantic network processing system, which is a direct descendent of MENTAL and is currently implemented in ALISP and runs interactively on the CDC CYBER 173 at the State University of New York at Buffalo.
DSpace@MIT (Massachusetts Institute of Technology)Micro-Planner Reference Manual
92 Citations1970Gerald Jay Sussman, Terry Winograd
IEEE Transactions on ComputersA Search Technique for Clause Interconnectivity Graphs
84 Citations1976Sickel
A new representation and technique for proving theorems automatically that is both computationally more effective than resolution and permits a clear and concise formal description is presented.
On Evaluation of Queries Containing Derived Relations in a Relational Data Base
59 Citations1981C. L. Chang
In this chapter a method is given for evaluating a query containing derived relations and the method is to compile the query into a program.
Artificial IntelligenceUsing rewriting rules for connection graphs to prove theorems
38 Citations1979C. L. Chang, J.R. Slagle
A method to obtain rewriting rules from the graph is described, and it is shown that these rewriting rules can be used to generate a refutation plan that may correspond to a large number of linear resolution refutations.
National Conference on Artificial IntelligenceInference with recursive rules
36 Citations1980Stuart C. Shapiro, Donald P. McKay
An inference system that can use recursive rules without causing infinite loops or requiring that arbitrarily many copies of them be made is written.
ACM SIGART BulletinRepresenting and locating deduction rules in a semantic network
24 Citations1977Stuart C. Shapiro
A semantic network is defined with its arcs and nodes separated into various sets, and a match routine is defined which is given a source node and a binding and finds target nodes, target bindings and more fully specified source bindings.
A multi-processing approach to natural language
20 Citations1973Ronald M. Kaplan
The central theme of the present paper is that natural language control problems have a fundamentally different character from those of most other systems and require a somewhat unusual solution: the many natural language procedures should be conceptualized and implemented as a collection of asynchronous communicating parallel processes.
Elsevier eBooksPLANNING TECHNIQUES FOR RULE SELECTION IN DEDUCTIVE QUESTION-ANSWERING
19 Citations1978Philip Klahr
Performing inferences over recursive data bases
14 Citations1980Shamim A. Naqvi, Lawrence J. Henschen
The research reported in this paper presents a solution to an open problem which arises in sys-tems that use recursive production rules to re-present knowledge that uses connection graphs to first detect occurrences of recursive definitions and then synthesizes a non-recursive program from such a definition.
MULTI - a LISP based multiprocessing system
13 Citations1980Donald P. McKay, Stuart C. Shapiro
A package of LISP functions, collectively called MULTI, which extends LISp 1.5 to multiprogramming is presented and the flexibility of this simple conceptualization of processes is demonstrated by several examples which use MULTi to implement recursion, backtracking, generators, agendas and AND/OR graph searching.