Formalizing argumentative reasoning in a possibilistic logic programming setting with fuzzy unification

  • Authors:
  • Teresa Alsinet;Carlos I. Chesòevar;Lluís Godo;Sandra Sandri;Guillermo Simari

  • Affiliations:
  • Department of Computer Science, Universitat de Lleida, C/Jaume II 69, 25001 Lleida, Spain;CONICET (National Council of Scientific and Technical Research), Argentina and Department of Computer Science & Engineering, Universidad Nacional del Sur, Av. Alem 1253, 8000 Bahíía Blan ...;Artificial Intelligence Research Institute (IIIA), CSIC, Campus UAB s/n, 08193 Bellaterra, Spain;Artificial Intelligence Research Institute (IIIA), CSIC, Campus UAB s/n, 08193 Bellaterra, Spain;Department of Computer Science & Engineering, Universidad Nacional del Sur, Av. Alem 1253, 8000 Bahíía Blanca, Argentina

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

Quantified Score

Hi-index 0.00

Visualization

Abstract

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be expressed in the object language. One interesting alternative for solving this limitation is the use of PGL^+, a possibilistic logic over Godel logic extended with fuzzy constants. Fuzzy constants in PGL^+ allow expressing disjunctive information about the unknown value of a variable, in the sense of a magnitude, modelled as a (unary) predicate. The aim of this article is twofold: firstly, we formalize DePGL^+, a possibilistic defeasible logic programming language that extends P-DeLP through the use of PGL^+ in order to incorporate fuzzy constants and a fuzzy unification mechanism for them. Secondly, we propose a way to handle conflicting arguments in the context of the extended framework.