Resource - Bounded Practical Reasoning
نویسندگان
چکیده
An architecture for a rational agent must allow for means-end reasoning, for the weighing of competing alternatives, and for interactions between these two forms of reasoning. Such an architecture must also address the problem of resource boundedness. We sketch a solution of the rst problem that points the way to a solution of the second. In particular, we present a high-level speci cation 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. Bratman, Israel, and Pollack 3
منابع مشابه
Programming Resource-Bounded Deliberative Agents
This paper is concerned with providing a common framework for both the logical specification and execution of agents. While numerous high-level agent theories have been proposed in order to model agents, such as theories of intention, these often have little formal connection to practical agentbased systems. On the other hand, many of the agent-based programming languages used for implementing ...
متن کاملKnowledge, Logical Omniscience, and Resource-bounded Reasoning
Agent theories typically use modal epistemic logic for modeling knowledge of agents. Since the modal approach to epistemic logic cannot formalize resource-bounded reasoning adequately, it it not suited to describe realistic, implementable agents. We develop a framework for solving that problem. We introduce the notion of algorithmic knowledge — a concept that establishes a direct link between a...
متن کاملBelief ascription under bounded resources
There exists a considerable body of work on epistemic logics for resource-bounded reasoners. In this paper, we concentrate on a less studied aspect of resource-bounded reasoning, namely, on the ascription of beliefs and inference rules by the agents to each other. We present a formal model of a system of bounded reasoners which reason about each other’s beliefs, and investigate the problem of b...
متن کاملBounded-Resource Reasoning as (Strong or Classical) Planning
To appropriately configure agents so as to avoid resource exhaustion, it is necessary to determine the minimum resource (time & memory) requirements necessary to solve reasoning problems. In this paper we show how the problem of reasoning under bounded resources can be recast as a planning problem. Focusing on propositional reasoning, we propose different recasting styles, which are equally int...
متن کاملComputational Complexity and Induction for Partial Computable Functions in Type Theory
An adequate theory of partial computable functions should provide a basis for deening computational complexity measures and should justify the principle of computational induction for reasoning about programs on the basis of their recursive calls. There is no practical account of these notions in type theory, and consequently such concepts are not available in applications of type theory where ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1988