Generating possible intentions with constrained argumentation systems

  • Authors:
  • Leila Amgoud;Caroline Devred;Marie-Christine Lagasquie-Schiex

  • Affiliations:
  • IRIT -- CNRS, UPS, Toulouse, France;LERIA -- UFR Sciences, Angers, France;IRIT -- CNRS, UPS, Toulouse, France

  • Venue:
  • International Journal of Approximate Reasoning
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

Practical reasoning (PR), which is concerned with the generic question of what to do, is generally seen as a two steps process: (1) deliberation, in which an agent decides what state of affairs it wants to reach - that is, its desires; and (2) means-ends reasoning, in which the agent looks for plans for achieving these desires. The agent's intentions are a consistent set of desires that are achievable together. This paper proposes the first argumentation system for PR that computes in one step the possible intentions of an agent, avoiding thus the drawbacks of the existing systems. The proposed system is grounded on a recent work on constrained argumentation systems, and satisfies the rationality postulates identified in argumentation literature, namely the consistency and the completeness of the results.