A stochastic language for modelling opponent agents

Authors:
Gerardo Simari;Amy Sliva;Dana Nau;V. S. Subrahmanian
Affiliations:
University of Maryland, Maryland;University of Maryland, Maryland;University of Maryland, Maryland;University of Maryland, Maryland
Venue:
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Year:
2006

Citing 3
Cited 2

Modeling a dynamic and uncertain world I: symbolic and probabilistic reasoning about change

Artificial Intelligence
Probabilistic agent programs

ACM Transactions on Computational Logic (TOCL)
Heterogeneous temporal probabilistic agents

ACM Transactions on Computational Logic (TOCL)

Stochastic Reasoning with Models of Agent Behavior

ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Focused most probable world computations in probabilistic logic programs

Annals of Mathematics and Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

Abstract

There are numerous cases where a reasoning agent needs to reason about the behavior of an opponent agent. In this paper, we propose a hybrid probabilistic logic language within which we can express what actions an opponent may take in a given situation. We present the syntaxis and semantics of the language, and the concept of a Maximally Probable Course of Action.