A complete and decidable logic for resource-bounded agents

Natasha Alechina*, Brian Logan, Mark Whitsey

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

43 Citations (Scopus)

Abstract

We propose a context-logic style formalism, Timed Reasoning Logics (TRL), to describe resource-bounded reasoners who take time to derive consequences of their knowledge. The semantics of TRL is grounded in the agent's computation, allowing an unambiguous ascription of the set of formulas which the agent actually knows at time t. We show that TRL can capture various rule application and conflict resolution strategies that a rule-based agent may employ, and analyse two examples in detail: TRL(STEP) which models an all rules at each cycle strategy similar to that assumed in step logic [5], and TRL(CLIPS) which models a single rule at each cycle strategy similar to that employed by the CLIPS [22] rule based system architecture. We prove a general completeness and decidability results for TRL(STEP).

Original languageEnglish
Title of host publicationProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
EditorsN.R. Jennings, C. Sierra, L. Sonenberg, M. Tambe
Pages606-613
Number of pages8
Volume2
Publication statusPublished - 2004
EventProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004 - New York, NY, United States
Duration: 19 Jul 200423 Jul 2004

Other

OtherProceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 2004
CountryUnited States
CityNew York, NY
Period19/07/0423/07/04

Fingerprint

Dive into the research topics of 'A complete and decidable logic for resource-bounded agents'. Together they form a unique fingerprint.

Cite this