Applications of logical approaches to argumentation

n/

Modeling argumentation with labeled deduction: formalization and theoretical considerations

In the last years there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive Systems (LDS) were developed as a °exible methodology to formalize such a kind of complex logical systems. During the last decade defeasible argumentation has proven to be a con°uence point for many approaches to formalizing commonsense reasoning. Di®erent formalisms have been developed, many of them sharing common features. This paper summarizes the most relevant features of LDSar, a logical framework for defeasible argumentation based on LDS. We present a syntactic characterization of the framework, and discuss some emerging properties. We also show how di®erent existing argumentation frameworks are subsumed in LDSarEje: Informática teóricaRed de Universidades con Carreras en Informática (RedUNCI

The role of labelled deductive systems in a formal system for defeasible argumentation

There has been an increasing demand of a variety of logical systems, prompted by applications of logic in Al, logic prograrnming and other related areas. Labelled Deductive Systems (LDS) [Gab96] were developed as a flexible methodology to formalize such a kind of complex logical systems. In the last decade, defeasible argumentation [SL92, PV99, Ver96, BDKT97] has proven to be a confluence point for many approaches to formalizing commonsense reasoning. Different formalisms have been developed, many of them sharing cornmon fe atures. This paper outlines an argumentative LDS, in which the main issues concerning defeasible argumentation are captured within a unified logical framework. The proposed framework is defined in two stages. First, defeasible inference will be formalized by characterizing a defeasible LDS. That system wiU be then extended in order to obtain an argumentative LDS.Eje: Aspectos teóricos de la inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

Modeling argumentation with labeled deduction: formalization and theoretical considerations

In the last years there has been an increasing demand of a variety of logical systems, prompted mostly by applications of logic in AI, logic programming and other related areas. Labeled Deductive Systems (LDS) were developed as a °exible methodology to formalize such a kind of complex logical systems. During the last decade defeasible argumentation has proven to be a con°uence point for many approaches to formalizing commonsense reasoning. Di®erent formalisms have been developed, many of them sharing common features. This paper summarizes the most relevant features of LDSar, a logical framework for defeasible argumentation based on LDS. We present a syntactic characterization of the framework, and discuss some emerging properties. We also show how di®erent existing argumentation frameworks are subsumed in LDSarEje: Informática teóricaRed de Universidades con Carreras en Informática (RedUNCI

The role of labelled deductive systems in a formal system for defeasible argumentation

There has been an increasing demand of a variety of logical systems, prompted by applications of logic in Al, logic prograrnming and other related areas. Labelled Deductive Systems (LDS) [Gab96] were developed as a flexible methodology to formalize such a kind of complex logical systems. In the last decade, defeasible argumentation [SL92, PV99, Ver96, BDKT97] has proven to be a confluence point for many approaches to formalizing commonsense reasoning. Different formalisms have been developed, many of them sharing cornmon fe atures. This paper outlines an argumentative LDS, in which the main issues concerning defeasible argumentation are captured within a unified logical framework. The proposed framework is defined in two stages. First, defeasible inference will be formalized by characterizing a defeasible LDS. That system wiU be then extended in order to obtain an argumentative LDS.Eje: Aspectos teóricos de la inteligencia artificialRed de Universidades con Carreras en Informática (RedUNCI

A Framework for Combining Defeasible Argumentation with Labeled Deduction

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.Comment: 15 pages, presented at CMSRA Workshop 2003. Buenos Aires, Argentin

A QBF-based Formalization of Abstract Argumentation Semantics

Supported by the National Research Fund, Luxembourg (LAAMI project) and by the Engineering and Physical Sciences Research Council (EPSRC, UK), grant ref. EP/J012084/1 (SAsSY project).Peer reviewedPostprin

Many-valued logics. A mathematical and computational introduction.

2nd edition. Many-valued logics are those logics that have more than the two classical truth values, to wit, true and false; in fact, they can have from three to infinitely many truth values. This property, together with truth-functionality, provides a powerful formalism to reason in settings where classical logic—as well as other non-classical logics—is of no avail. Indeed, originally motivated by philosophical concerns, these logics soon proved relevant for a plethora of applications ranging from switching theory to cognitive modeling, and they are today in more demand than ever, due to the realization that inconsistency and vagueness in knowledge bases and information processes are not only inevitable and acceptable, but also perhaps welcome. The main modern applications of (any) logic are to be found in the digital computer, and we thus require the practical knowledge how to computerize—which also means automate—decisions (i.e. reasoning) in many-valued logics. This, in turn, necessitates a mathematical foundation for these logics. This book provides both these mathematical foundation and practical knowledge in a rigorous, yet accessible, text, while at the same time situating these logics in the context of the satisfiability problem (SAT) and automated deduction. The main text is complemented with a large selection of exercises, a plus for the reader wishing to not only learn about, but also do something with, many-valued logics