TY - GEN
T1 - Deciding refinement relation in belief-intention databases
AU - Xiao, Zhanhao
AU - Herzig, Andreas
AU - Perrussel, Laurent
AU - Zhang, Dongmo
PY - 2017
Y1 - 2017
N2 - 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 (PLTL). With such translations, we can utilize the efficient automated theorem provers for PLTL to solve the problem of deciding the refinement relation between an intention and an intention set, as well as the instrumentality relation.
AB - 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 (PLTL). With such translations, we can utilize the efficient automated theorem provers for PLTL to solve the problem of deciding the refinement relation between an intention and an intention set, as well as the instrumentality relation.
KW - artificial intelligence
KW - databases
KW - intelligent agents (computer software)
KW - linear temporal logic
KW - problem solving
UR - http://handle.westernsydney.edu.au:8081/1959.7/uws:44689
U2 - 10.1007/978-3-319-70169-1_14
DO - 10.1007/978-3-319-70169-1_14
M3 - Conference Paper
SN - 9783319701684
SP - 186
EP - 199
BT - Proceedings of AI*IA 2017: Advances in Artificial Intelligence: XVIth International Conference of the Italian Association for Artificial Intelligence Bari, Italy, November 14–17, 2017
PB - Springer
T2 - Italian Association for Artificial Intelligence. International Conference
Y2 - 14 November 2017
ER -