By Topic

Computationally grounded theories of agency

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Wooldridge, M. ; Dept. of Comput. Sci., Liverpool Univ., UK

In this paper I motivate, define, and illustrate the notion of computationally grounded theories of agency. A theory of agency is said to be computationally grounded if we can give the theory an interpretation in terms of some concrete computational model. This requirement is essential if we are to claim that the theories we develop can be understood as expressing properties of real multiagent systems. After introducing and formally defining the concept of a computationally grounded theory of agency, I illustrate the idea with reference to VSK logic, a formalism for reasoning about agent systems that has a semantics defined with respect to an automata-like model of agents. VSK logic is an extension of modal epistemic logic, which allows us to represent what information is visible to an agent, what it sees, and what it knows. We are able to prove that formulae of VSK logic correspond directly to properties of agents

Published in:

MultiAgent Systems, 2000. Proceedings. Fourth International Conference on

Date of Conference:

2000