Citations: Computationally grounded theories of agency

24 citations found. Retrieving documents...

M. Wooldridge, `Computationally grounded theories of agency', in Proceedings of ICMAS, International Conference of Multi-Agent Systems, ed., E. Durfee, IEEE Press, (2000). 10

Home/Search Document Details and Download Summary Related Articles Check

This paper is cited in the following contexts:

Verifying Epistemic Properties of Multi-agent Systems via.. - Penczek, al. (2003) (Correct)

....of verifying MAS is that a plain temporal logic like CTL is not sufficient to represent the mental states of the agents in a MAS. Enriching CTL with modalities for knowledge, belief, and intention raises the question of what semantics to use to interpret these modalities. It has long been argued [28] that plain Kripke semantics is not adequate to perform this task. If we aim to verify MAS, we need to find an intuitive computational correspondence for these notions. In this paper we have used the semantic model of interpreted systems, and integrated it with the verification technique of ....

M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multi-Agent Systems. IEEE Press, 2000.

Verifying Epistemic Properties of Multi-agent Systems via.. - Penczek, Lomuscio (2003) (Correct)

....of verifying MAS is that a plain temporal logic like CTL is not su#cient to represent the mental states of the agents in a MAS. Enriching CTL with modalities for knowledge, belief, and intentions raises the question of what semantics to use to interpret these modalities. It has long been argued [28] that plain Kripke semantics is not adequate to perform this task. If we aim to verify MAS, we need to find an intuitive computational correspondence for these notions. In this paper we have used the semantic model of interpreted systems, and integrated it with the verification technique of ....

M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multi-Agent Systems. IEEE Press, 2000.

Grounding Knowledge and Action Selection in Agent-Based Systems - Alechina, Logan (Correct)

....by their very nature, cannot be objective, and are prone to over interpretation [11] A key component of any theory of agent systems is a formal model of agent knowledge which makes precise what it is for an agent to know that #. Such a model should be computationally grounded (in the sense of [20]) and constructive. By computationally grounded we mean that knowledge should be interpreted in terms of concrete computational notions such as the runs of a program or system. By constructive we mean that we can tell whether an agent knows that # solely by inspecting the properties of the agent ....

....state and triggers a correct action. Given an appropriate choice of = a equivalence and an appropriate encoding between locations and sets of = a equivalent formulas, we can require that locations correspond to the weakest preconditions for actions. 10 7Conclusion Many researchers (e.g. [20]) have argued that models of agent knowledge should be computationally grounded, and several computationally grounded definitions of knowledge have been proposed in the literature. We believe that it is also important that models of knowledge be constructive in the sense that is possible to verify ....

Michael Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000.

Investigations in Grounded Semantics for Multi-Agent Systems .. - Lomuscio, Sergot (2000) (1 citation) (Correct)

....remote control of safety critical systems, etc, then there is clearly a need for bridging the gap between theory and practice. In our view, this is particularly relevant with respect to the issues relating to specification and verification of MAS. One of the suggestions that have been put forward [Woo00a] to make MAS theories more relevant to practitioners is the shift to a semantics which is computationally grounded. This remark applies to distributed artificial intelligence in general but it is particularly relevant for the case of MAS theories, where semantics are usually given by borrowing ....

M. Wooldridge. Computationally grounded theories of agency. In Proceedings of ICMAS, International Conference of Multi-Agent Systems. 2000.

A Computationally Grounded Logic of Visibility, Perception.. - Wooldridge, Al. (2001) (2 citations) Self-citation (Wooldridge) (Correct)

No context found.

M. Wooldridge. Computationally grounded theories of agency. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000.

Model Checking Multi-Agent Systems with MABLE - Wooldridge, Fisher, Huget.. (2002) (27 citations) Self-citation (Wooldridge) (Correct)

....for such logics is usually given in terms of Kripke, or possible worlds, semantics [2] the mathematics of correspondence theory for possible worlds semantics makes such an approach extremely attractive. Unfortunately, most such logics tend to suffer from the problem of computational grounding [21]. Intuitively, this problem can be understood as follows. Suppose we have some axiomatic theory of agency, expressed in some logic L, and we have some program #, implemented in some conventional programming language. Can we tell whether or not # implements the theory of agency In general, we ....

M. Wooldridge. Computationally grounded theories of agency. In Proc. Fourth International Conference on Multi-Agent Systems (ICMAS-2000.

A Computationally Grounded Logic of Visibility.. - Wooldridge, Lomuscio (2001) (2 citations) Self-citation (Wooldridge) (Correct)

....2, pp. 273 288 2001 c Oxford University Press 274 A Computationally Grounded Logic of Visibility, Perception, and Knowledge see next state AGENT ENVIRONMENT do Fig. 1. An overview of the framework. agent knows . A key feature of the modal system VSK is that it is computationally grounded [26]. By this we mean that its semantics is not given by traditional possible worlds, but by a formalism that is more closely connected to the models of computation studied in intelligent systems [26] As we show later in the paper, this does not hinder the possibility of studying formal properties of ....

....agent knows . A key feature of the modal system VSK is that it is computationally grounded [26] By this we mean that its semantics is not given by traditional possible worlds, but by a formalism that is more closely connected to the models of computation studied in intelligent systems [26]. As we show later in the paper, this does not hinder the possibility of studying formal properties of correspondence [2] indeed, we are able to show that some axioms formally correspond to intuitive structural properties of the agent environment computational coupling. Consider, for example, the ....

[Article contains additional citation context not shown here]

M. Wooldridge. Computationally grounded theories of agency. In Proceedings of the Fourth International Conference on Multi-Agent Systems (ICMAS-2000), pages 13-20, Boston, MA, 2000.

Towards Model Checking Interpreted Systems - Lomuscio, Raimondi, Sergot (2002) (1 citation) (Correct)

No context found.

M. Wooldridge, `Computationally grounded theories of agency', in Proceedings of ICMAS, International Conference of Multi-Agent Systems, ed., E. Durfee, IEEE Press, (2000). 10

Verifying Epistemic Properties of Multi-agent Systems via.. - Penczek, al. (2003) (Correct)

No context found.

M. Wooldridge. Computationally grounded theories of agency. In E. Durfee, editor, Proceedings of ICMAS, International Conference of Multi-Agent Systems. IEEE Press, 2000. 16

Unbounded Model Checking for Knowledge and Time - Kacprzak, Lomuscio, Penczek (2003) (Correct)