Properties and Complexity in Feasible Logic-Based Argumentation for Electronic Commerce

  • Authors:
  • Luís Brito;José Neves

  • Affiliations:
  • -;-

  • Venue:
  • IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Logic-Based Argumentation (LBA) exhibits unique properties and advantages over other kinds of argumentation proceedings, namely: the adequacy to logic-based pre-argument reasoning, similarity to the human reasoning process, reasoning with incomplete information and argument composition and extension. Logic enables a formal specification to be built and a quick prototype to be developed. In order for LBA to achieve feasibility in Electronic Commerce scenarios, a set of properties must be present: self-support, correctness, conjugation, temporal containment and acyclicity. At the same time, LBA is shown to achieve stability in argument exchange (guaranteed success problem) and, depending on the definition of success, computational efficiency at each round (success problem).