Chapter

Symbolic and Quantitative Approaches to Reasoning with Uncertainty

Volume 2711 of the series Lecture Notes in Computer Science pp 552-563

A Formal Framework for Handling Conflicting Desires

  • Leila AmgoudAffiliated withInstitut de Recherche en Informatique de Toulouse (IRIT)

* Final gross prices may vary according to local VAT.

Get Access

Abstract

This paper combines ideas from argumentation [1,8] with desires and planning rules, in order to give a formal account of how consistent sets of intentions can be obtained from a conflicting set of desires. We show how conflicts may arise between desires and we resolve them. We argue that the set of desires can be clustered in three categories: i) the intentions of the agent, ii) the rejected desires and iii) the desires in abeyance. Finally, we show that the use of argumentation with desires is different from the usual kind of argumentation with default rules.