Developing bounded reasoning
Journal of Logic, Language and Information 18 (1) (2009)
| Abstract | We introduce a three-tiered framework for modelling and reasoning about agents who (i) can use possibly complete reasoning systems without any restrictions but who nevertheless are (ii) bounded in the sense that they never reach infinitely many results and, finally, who (iii) perform their reasoning in time. This last aspect does not concern so much the time it takes for agents to actually carry out their reasoning, as the time which can bring about external changes in the agents’ states such as arriving of new information or discarding previously available information due to bounds of the agent’s resources. These three aspects are treated with the maximal possible degree of independence from each other. The treatment of layer (iii) can be combined with arbitrary logic at level (ii) which, in turn, can be combined with arbitrary agent logic at level (i). At the level (iii), we discuss briefly the duality (or rather, complementarity) of system descriptions based on actions and transitions, on the one hand, and states and their changes, on the other. We settle for the latter and present a simple language, for describing state changes, which is parameterized by an arbitrary language for describing properties of the states. The language can be viewed as a simple fragment of step logic, admitting however various extensions by appropriate choices of the underlying logic. Alternatively, it can be seen as a very specific fragment of temporal logic (with a variant of ‘until’ or ‘chop’ operator), and is interpreted over dense linear time. The reasoning system presented here is sound, as well as strongly complete and decidable (provided that so is the parameter logic for reasoning about single states). We give the main idea of the completeness proof and suggest a wide range of possible applications, which is a simple consequence of the parametric character of both the language and the reasoning system. We address then in more detail the case of non-omniscient rational agents, (ii). Their models are syntactic structures (sets of available formulae) similar in spirit, though not in the technical formulation, to the models used in other syntax oriented approaches and in active logic. We give a new sound, complete and decidable system for reasoning about such agents. Finally, we illustrate its extensions with the internal reasoning of agents, (i), by equipping them with some example logics. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,664 |
| External links |
 |
| Through your library | Configure |
Similar books and articlesRon van der Meyden & Ka-shu Wong (2003). Complete Axiomatizations for Reasoning About Knowledge and Branching Time. Studia Logica 75 (1):93 - 123.
Richard W. Weyhrauch, Marco Cadoli & Carolyn L. Talcott (1998). Using Abstract Resources to Control Reasoning. Journal of Logic, Language and Information 7 (1):77-101.
Thomas Ågotnes & Dirk Walther (2009). A Logic of Strategic Ability Under Bounded Memory. Journal of Logic, Language and Information 18 (1).
Lena Kurzen (2009). Reasoning About Cooperation, Actions and Preferences. Synthese 169 (2):223 - 240.
Brian Logan, Mark Jago & Natasha Alechina (2006). Modelling Communicating Agents in Timed Reasoning Logics. In U. Endriss & M. Baldoni (eds.), Declarative Agent Languages and Technologies 4. Springer.
Jelle Gerbrandy & Willem Groeneveld (1997). Reasoning About Information Change. Journal of Logic, Language and Information 6 (2):147-169.
Natasha Alechina & Brian Logan (2009). A Logic of Situated Resource-Bounded Agents. Journal of Logic, Language and Information 18 (1).
Analytics
Monthly downloads |
Added to index2009-01-28Total downloads7 ( #133,381 of 549,007 )Recent downloads (6 months)1 ( #63,261 of 549,007 )How can I increase my downloads? |
My notes
Discussion
