Paper Info
Title
Verifying space and time requirements for resource-bounded agents
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.
Year
DOI
Venue
2006
10.1007/978-3-540-74128-2_2
Model Checking and Artificial Intelligence
Keywords
DocType
Citations 
enough memory,certain conclusion,verifying space,time requirement,inference rule application,memory allocation,effective reasoning capabilityof,knowledge base,logical consequence,start state,model-based planner,resource-bounded agents,finite state machine,resource-bounded reasoning agent,limited memory,fsm state,effective reasoning capability,resource-bounded agent,time requirements,novel procedure,transition system,mbp,inference rule,different memory size
Conference
5
PageRank 
References 
Authors
0.46
20
6
Name
Order
Citations
PageRank
Natasha Alechina136841.63
Mark Jago2738.49
Piergiorgio Bertoli377546.89
Brian Logan480389.41
Chiara Ghidini577684.26
Luciano Serafini62230204.36