Model Checking BDI Logics over Finite-state Worlds

Salvatore La Torre, Gennaro Parlato
2019 International Conference of the Italian Association for Artificial Intelligence  
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 relations
more » ... re captured by finite-state relations. We then solve the problem by giving an exponential time decision algorithm that is obtained by adapting the standard decision algorithm for Ctl * .
dblp:conf/aiia/TorreP19 fatcat:agryolx2rvgbnnakv4nbgf6eny