Extending Dialectical Classical Logic Argumentation with Unrestricted Rebut and Occam Razor Defeats
Capitolo di libro
Data di Pubblicazione:
2024
Citazione:
Extending Dialectical Classical Logic Argumentation with Unrestricted Rebut and Occam Razor Defeats / M. D'Agostino, S. Modgil (FRONTIERS IN ARTIFICIAL INTELLIGENCE AND APPLICATIONS). - In: Computational Models of Argument / [a cura di] C. Reed, M. Thimm, T. Rienstra. - [s.l] : IOS Press, 2024. - ISBN 9781643685342. - pp. 49-60 (( Intervento presentato al 10. convegno Biennal International Conference on Computational Models of Argument (COMMA) tenutosi a Hagen nel 2024 [10.3233/faia240309].
Abstract:
Dialectical Classical Logic Argumentation (D-Cl-Arg) formalises maxiconsistent non-monotonic reasoning under the practical assumption that agents have bounded resources for classical inference, and that agents do not typically check arguments’ premises for subset minimality and consistency. However, D-Cl-Arg still satisfies all rationality postulates. Moreover D-Cl-Arg accommodates uses of argument characteristic of dialectical practice. This paper extends D-Cl-Arg to accommodate further dialectical uses of argument; in particular unrestricted rebuts on the deductively derived conclusions of arguments, and Occam Razor defeats that dialectically demonstrate that an argument makes use of redundant premises. We show that all rationality postulates are still satisfied, while relaxing constraints on preference relations that were previously required to prove rationality.
Tipologia IRIS:
03 - Contributo in volume
Keywords:
Classical Logic; Argumentation; Non-monotonic Reasoning; Resource Bounds
Elenco autori:
M. D'Agostino, S. Modgil
Link alla scheda completa:
Link al Full Text:
Titolo del libro:
Computational Models of Argument