A Universal Weak Method: Summary of Results
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Planning and Search. Pages 771-772.
Abstract
Th e weak me thod s occur pervasively in AI systems and may form t11 e basic methods for all intellig e nt systems. The purpose of this paper is to characterize the weak method s and to ex plain how and w hy they arise in intelligent systems. We propo se an organization, cal led a universal weak me/hod. that provid es functionalit y of all the weak methods . A universal weak meti10d is an organizational sc heme for knowledge th at produces the appropriate search behav ior given th e available ta sk-do main knowl edge. We present a prob lem 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.
@inproceedings{ijcai1983p186,
title = {A Universal Weak Method: Summary of Results},
author = {Laird, John E. and Newell, Allen},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {771--772},
year = {1983},
note = {Planning and Search},
url = {https://ijcai.org/proceedings/1983/186},
}
TY - CPAPER TI - A Universal Weak Method: Summary of Results AU - Laird, John E. AU - Newell, Allen T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 771 EP - 772 UR - https://ijcai.org/proceedings/1983/186 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
