As a guest user you are not logged in or recognized by your IP address. You have
access to the Front Matter, Abstracts, Author Index, Subject Index and the full
text of Open Access publications.
We propose syntactic deliberation and goal election algorithms for possibilistic agents which are able to deal with incomplete and imprecise information in a dynamic world. We show that the proposed algorithms are equivalent to their semantic counterparts already presented in the literature. We show that they lead to an efficient implementation of a possibilistic BDI model of agency which integrates goal generation.