Reasoning situated in time I: basic concepts
Journal of Experimental & Theoretical Artificial Intelligence
Reasoning about knowledge
A Deduction Model of Belief
Space Complexity in Propositional Calculus
SIAM Journal on Computing
A Logic for Characterizing Multiple Bounded Agents
Autonomous Agents and Multi-Agent Systems
Programming Resource-Bounded Deliberative Agents
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
MOCHA: Modularity in Model Checking
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
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
State-Space Reduction Techniques in Agent Verification
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
On Communication in Distributed Constraint Satisfaction
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Information and Computation
Introduction: special issue on distributed constraint satisfaction
Artificial Intelligence - Special issue: Distributed constraint satisfaction
On the computational complexity of coalitional resource games
Artificial Intelligence
Verifying space and time requirements for resource-bounded agents
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Knowing Minimum/Maximum n Formulae
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Modal logics for communicating rule-based agents
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Model-checking memory requirements of resource-bounded reasoners
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Strongly complete axiomatizations of “knowing at most” in syntactic structures
CLIMA'05 Proceedings of the 6th international conference on Computational Logic in Multi-Agent Systems
Verifying Resource Requirements for Distributed Rule-Based Systems
RuleML '08 Proceedings of the International Symposium on Rule Representation, Interchange and Reasoning on the Web
Verifying Time and Communication Costs of Rule-Based Reasoners
Model Checking and Artificial Intelligence
A logic for coalitions with bounded resources
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Expressing properties of coalitional ability under resource bounds
LORI'09 Proceedings of the 2nd international conference on Logic, rationality and interaction
Expressing properties of resource-bounded systems: the logics RTL* and RTL
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Hi-index | 0.00 |
We present a framework for verifying systems composed of heterogeneous reasoning agents, in which each agent may have differing knowledge and inferential capabilities, and where the resources each agent is prepared to commit to a goal (time, memory and communication bandwidth) are bounded. The framework allows us to investigate, for example, whether a goal can be achieved if a particular agent, perhaps possessing key information or inferential capabilities, is unable (or unwilling) to contribute more than a given portion of its available computational resources or bandwidth to the problem. We present a novel temporal epistemic logic, BMCL, which allows us to describe a set of reasoning agents with bounds on time, memory and the number of messages they can exchange. The bounds on memory and communication are expressed as axioms in the logic. As an example, we show how to axiomatize a system of agents which reason using resolution and prove that the resulting logic is sound and complete. We then show how to encode a simple system of reasoning agents specified in BMCL in the description language of a model checker, and verify that the agents can achieve a goal only if they are prepared to commit certain time, memory and communication resources.