Verifying space and time requirements for resource-bounded agents

Natasha Alechina*, Piergiorgio Bertoli, Chiara Ghidini, Mark Jago, Brian Logan, Luciano Serafini

*Corresponding author for this work

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

4 Citations (Scopus)

Abstract

We present a novel procedure for automatically verifying the space and time requirements for resource-bounded reasoning agents. We represent agents as a finite state machines in which the states correspond the formulas currently held in the agent's memory and the transitions between states correspond to applying the agent's inference rules. To check whether an agent has enough memory to derive a formula Φ, we specify the FSM as input to the model-based planner MBP, and check whether the agent has a plan (a choice of memory allocations and inference rule applications), all executions of which lead to states containing Φ. Our approach is general enough to admit verification of reasoners with any set of inference rules which can be encoded as transitions between FSM states.

Original languageEnglish
Title of host publicationProceedings of the Fifth International Joint Conference on Autonomous Agents and Multiagent Systems
EditorsP. Stone, G. Weiss
Pages217-219
Number of pages3
Volume2006
DOIs
Publication statusPublished - 2006
EventFifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS - Hakodate, Japan
Duration: 8 May 200612 May 2006

Other

OtherFifth International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS
CountryJapan
CityHakodate
Period8/05/0612/05/06

Keywords

  • MBP
  • Resource-bounded agents

Fingerprint Dive into the research topics of 'Verifying space and time requirements for resource-bounded agents'. Together they form a unique fingerprint.

Cite this