A universal weak method: summary of results

Authors:
John E. Laird;Allen Newell
Affiliations:
Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania;Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
Year:
1983

Citing 1
Cited 2

Pattern-Directed Inference Systems

Pattern-Directed Inference Systems

R1-soar an experiment in knowledge-intensive programming in a problem-solving architecture

PKWBS-W'84 Proceedings of the 1984 IEEE conference on Principles of knowledge-based systems
Rethinking cognitive architecture via graphical models

Cognitive Systems Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The weak methods occur pervasively in Al systems and may form the basic methods for all intelligent systems. The purpose of this paper is to characterize the weak methods and to explain how and why they arise in intelligent systems. We propose an organization, called a universal weak method, that provides functionality of all the weak methods. A universal weak method is an organizational scheme for knowledge that produces the appropriate search behavior given the available task-domain knowledge. We present a problem solving architecture in which we realize a universal weak method. We also demonstrate the universal weak method with a variety of weak methods on a set of tasks.