Abstract

Karo, an agent logic, initally proposed by v.d. Hoek et al., provides a cicise formalization of agent systems. This work lays the foundation for using automated reasoning tools with Karo by proving that it is decidable. The proof is done via a translation from Karo to SnS, one of the most expressive yet decidable logics available. However, SnS cannot be used for automated reasoning purposes, due to its high complexity. Therefore, we extend the translation to WSnS, a language for which automated reasoning tools exist.

@inproceedings{...,
author = {...},
title = {...},
booktitle = {...},
year = {...},
isbn = {...},
pages = {...},
location = {...},
doi = {...},
publisher = {...},
address = {...},
}