The cognitive agents specification language and verification environment

Specification and Verification of Multi-agent Systems

Volumn , Issue , 2010, Pages 289-315

  Shapiro, Steven ^a   Lespérance, Yves ^b   Levesque, Hector J ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b YORK UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79952400246     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4419-6984-2_10     Document Type: Chapter

References (7)

1. We adopt the convention that unbound variables are universally quantified in the widest scope.
2. Another approach to generalizing to the multiagent case can be found in Lespérance et al. [281].
3. This axiom can easily be extended to handle sensing actions as well as inform actions.
4. Note that now and then are situation variables, but Now and Then are situation constants.
5. Note that this is an overloading of the definition of Prev on p. 297.
6. De Giacomo et al. [134] allow recursive procedures in the language. To simplify matters, we omit them here. We only allow non-recursive procedures and treat them as definitions.
7. We assume that an axiomatization of lists is included in Σ.