In this work, we present an argumentation-based formalization for supporting the process of formation of intentions in practical agents. This is based on the belief-based goal processing model proposed by Castelfranchi and Paglieri, which is a more expressive and refined model than the BDI (Beliefs-Desires-Intentions) model. We focus on the progress of goals since they are desires until they become intentions, including the conditions under which a goal can be cancelled. We use argumentation to support the transition of the goals from their initial state until the last one. Our proposal complies with both supporting relation properties defined by Castelfranchi and Paglieri, diachrony and synchrony. The former means that the support happens since the goal is a desire until it becomes an intention, and the latter that the support can be tracked, i.e. there is a memory of the cognitive path from the beginning of the process until the end. In this work, we present an argumentation-based formalization for supporting the process of formation of intentions in practical agents. This is based on the belief-based goal processing model proposed by Castelfranchi and Paglieri, which is a more expressive and refined model than the BDI (Beliefs-Desires-Intentions) model. We focus on the progress of goals since they are desires until they become intentions, including the conditions under which a goal can be cancelled. We use argumentation to support the transition of the goals from their initial state until the last one. Our proposal complies with both supporting relation properties defined by Castelfranchi and Paglieri, diachrony and synchrony. The former means that the support happens since the goal is a desire until it becomes an intention, and the latter that the support can be tracked, i.e. there is a memory of the cognitive path from the beginning of the process until the end.
In this paper we propose a deductive calculus aiming at improving the query/simple-answer communication behaviour of many intelligent systems. In an uncertain reasoning context this behaviour consists of getting certainty values for propositions as answers to queries. Instead, with our calculus, answers to queries will become sets of formulas: a set of propositions and a set of specialised rules containing propositions for which the truth value is unknown in their left part. This type of behaviour is much more informative because it returns to users not only the answer to a query but all the relevant information, related to the answer, necessary to, possibly, improve the solution. To exemplify the general approach a family of propositional rule-based languages founded on multiple-valued logics is presented and formalised. The deductive system de ned on top of these languages is based on a Specialisation Inference Rule (SIR): (A1^A2 ^An ! P; V); (A1; V 0)`(A2^: : :^An ! P; V 00), where V , V 0 and V 00 are truth intervals. This inference rule provides a way of generating rules containing less conditions in their premise by eliminating the conditions for which a de nitive truth value already exists. The soundness and atom completeness of the deductive system are proved. The implementation of this deductive calculus is based on partial deduction techniques. Finally, an example of the application of the specialisation calculus to a multi-agent system is provided.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.