On the epistemic feasibility of plans in multiagent systems specifications

9Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper addresses the problem of ensuring that agents' plans are epistemically feasible in multiagent systems specifications. We propose some solutions within the Cognitive Agents Specification Language (CASL).We define a subjective execution construct Subj that causes the plan to be executed in terms of the agent's knowledge state, rather than in terms of the world state. The definition assumes that the agent does not do planning or lookahead, and chooses arbitrarily among the actions allowed by the plan. We also define another deliberative execution operator Delib for smarter agents that do planning. We show how these notions can be used to express whether a process is epistemically feasible for its agent(s) in several types of situations. More generally, the paper shows how a formalization of epistemic feasibility can be integrated with a transition-system semantics for an agent programming/specification language. © Springer-Verlag Berlin Heidelberg 2002.

Cite

CITATION STYLE

APA

Lespérance, Y. (2002). On the epistemic feasibility of plans in multiagent systems specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2333 LNAI, pp. 69–85). Springer Verlag. https://doi.org/10.1007/3-540-45448-9_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free