z-logo
Premium
Plans and resource‐bounded practical reasoning
Author(s) -
Bratman Michael E.,
Israel David J.,
Pollack Martha E.
Publication year - 1988
Publication title -
computational intelligence
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.353
H-Index - 52
eISSN - 1467-8640
pISSN - 0824-7935
DOI - 10.1111/j.1467-8640.1988.tb00284.x
Subject(s) - sketch , architecture , bounded function , computer science , resource (disambiguation) , component (thermodynamics) , bounded rationality , artificial intelligence , case based reasoning , rational agent , theoretical computer science , mathematics , algorithm , art , mathematical analysis , computer network , physics , visual arts , thermodynamics
An architecture for a rational agent must allow for means‐end reasoning, for the weighing of competing alternatives, and for interactions betwen these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the first problem that points the way to a solution of the second. In particular, we present a high‐level specification of the practical‐reasoning component of an architecture for a resource‐bounded rational agent. In this architecture, a major role of the agent's plans is to constrain the amount of further practical reasoning she must perform.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here