A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
Logics with belief, desire and intention attitudes (BDI logics) are among the most widely studied formal languages for modelling rational agents. We consider the logic Ctl * bdi that augments the branching-time logic Ctl * with the BDI modalities and adopt the possible-world semantics by Rao and Georgeff. In this paper, we introduce the model-checking problem of Ctl * bdi over finite-state models that are described by tuples of Kripke structures (one for each world) and where the BDI relationsdblp:conf/aiia/TorreP19 fatcat:agryolx2rvgbnnakv4nbgf6eny