Deciding Refinement Relation in Belief-Intention Databases - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

Deciding Refinement Relation in Belief-Intention Databases

Résumé

Bratman’s Belief-Desire-Intention (BDI) theory is seminal in the literature on BDI agents. His BDI theory is taken into account to extend Shoham’s database perspective on beliefs and intentions. In the extended framework, an intentions is considered as a high-level action, which cannot be executed directly, with a duration. They have to be progressively refined until executable basic actions are obtained. Higher- and lower-level actions are linked by the means-end relation, alias instrumentality relation. In this paper, we investigate the complexity of the decision problems for satisfiability, consequence, refinement and instrumentality in the database. Moreover, we translate these problems into the satisfiability and validity problems in propositional linear temporal logic (\(\mathsf {PLTL}\)). With such translations, we can utilize the efficient automated theorem provers for \(\mathsf {PLTL}\) to solve the problem of deciding the refinement relation between an intention and an intention set, as well as the instrumentality relation.
Fichier principal
Vignette du fichier
Xiao_22221.pdf (285.93 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-02603831 , version 1 (16-05-2020)

Identifiants

  • HAL Id : hal-02603831 , version 1
  • OATAO : 22221

Citer

Zhanhao Xiao, Andreas Herzig, Laurent Perrussel, Dongmo Zhang. Deciding Refinement Relation in Belief-Intention Databases. International Conference of the Italian Association for Artificial Intelligence (AI*IA 2017), Nov 2017, Bari, Italy. pp.186-199. ⟨hal-02603831⟩
39 Consultations
35 Téléchargements

Partager

Gmail Facebook X LinkedIn More