Syntactic Possibilistic Goal Generation
Résumé
We propose syntactic deliberation and goal election al-gorithms for possibilistic agents which are able to deal with incom-plete 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 ef-ficient implementation of a possibilistic BDI model of agency which integrates goal generation.
Domaines
Intelligence artificielle [cs.AI]Origine | Fichiers produits par l'(les) auteur(s) |
---|
Loading...