Probabilistic agent programs

  • Authors:
  • Jürgen Dix;Mirco Nanni;V. S. Subrahmanian

  • Affiliations:
  • Univ. of Manchester, U.K.;Univ. of Pisa, Italy;Univ. of Maryland, College Park

  • Venue:
  • ACM Transactions on Computational Logic (TOCL)
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

Agents are small programs that autonomously take actions based on changes in their environment or “state”. Over the last few years, there has been an increasing number of efforts to build agents that can interact and/or collaborate with other agents. In one of these efforts Eiter et al. [1999] have shown how agents may be built on top of legacy code. However, their framework assumes that agent states are completely determined, and there is no uncertainty in an agent's state. Thus, their framework allows an agent developer to specify how his agents will react when the agent is 100% sure about what is true/false in the world state. In this paper, we propose the concept of a probabilistic agent program and show how, given an arbitrary program written in any imperative language, we may build a declarative “probabilistic” agent program on top of it which supports decision making in the presence of uncertainty. We provide two alternative semantics for probabilitic programs. We provide sound and complete algorithms to compute the semantics of positive agent programs.