Verifying Space and Time Requirements for Resource-Bounded Agents

Authors:
Natasha Alechina;Piergiorgio Bertoli;Chiara Ghidini;Mark Jago;Brian Logan;Luciano Serafini
Affiliations:
School of Computer Science, University of Nottingham, Nottingham, UK;ITC-IRST, Trento, Italy;ITC-IRST, Trento, Italy;School of Computer Science, University of Nottingham, Nottingham, UK;School of Computer Science, University of Nottingham, Nottingham, UK;ITC-IRST, Trento, Italy
Venue:
Model Checking and Artificial Intelligence
Year:
2007

Citing 12
Cited 0

A deductive solution for plan generation

New Generation Computing
Reasoning situated in time I: basic concepts

Journal of Experimental & Theoretical Artificial Intelligence
Reasoning about knowledge

Reasoning about knowledge
Rationality and intelligence

Artificial Intelligence - Special issue on economic principles of multi-agent systems
Supporting software agents on small devices

Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
Weak, strong, and strong cyclic planning via symbolic model checking

Artificial Intelligence - special issue on planning with uncertainty and incomplete information
A proposal for an owl rules language

Proceedings of the 13th international conference on World Wide Web
A Complete and Decidable Logic for Resource-Bounded Agents

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Verification of Multiagent Systems via Unbounded Model Checking

AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Programming resource-bounded deliberative agents

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Pushing the envelope: planning, propositional logic, and stochastic search

AAAI'96 Proceedings of the thirteenth national conference on Artificial intelligence - Volume 2
Complete axiomatizations of finite syntactic epistemic states

DALT'05 Proceedings of the Third international conference on Declarative Agent Languages and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

The effective reasoning capabilityof an agent can be defined as its capability to infer, within a given space and time bound, facts that are logical consequences of its knowledge base. In this paper we show how to determine the effective reasoning capability of an agent with limited memory by encoding the agent as a transition system and automatically verifying whether a state where the agent believes a certain conclusion is reachable from the start state. We present experimental results using the Model Based Planner (mbp) which illustrates how the length of the deduction varies for different memory sizes.