A Framework for Combining Defeasible Argumentation with Labeled Deduction

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

In the last years, there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI and other related areas. Labeled Deductive Systems (LDS) were developed as a flexible methodology to formalize such a kind of complex logical systems. Defeasible argumentation has proven to be a successful approach to formalizing commonsense reasoning, encompassing many other alternative formalisms for defeasible reasoning. Argument-based frameworks share some common notions (such as the concept of argument, defeater, etc.) along with a number of particular features which make it difficult to compare them with each other from a logical viewpoint. This paper introduces LDSar, a LDS for defeasible argumentation in which many important issues concerning defeasible argumentation are captured within a unified logical framework. We also discuss some logical properties and extensions that emerge from the proposed framework.
15 pages, presented at CMSRA Workshop 2003. Buenos Aires, Argentina

Keywords

Artificial Intelligence, Symbolic Computation

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32173

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0405107
 http://arxiv.org/abs/cs/0405107
 In "Computer Modeling of Scientific Reasoning" (C.Delrieux, J.Legris, Eds.). Pp. 43-56, Ed. Ediuns, Argentina, 2003. ISBN 987-89281-89-6

Collections

arXiv