Argumentation Logic
Date
2014ISSN
0922-6389Source
5th International Conference on Computational Models of Argument, COMMA 2014Volume
266Pages
345-356Google Scholar check
Keyword(s):
Metadata
Show full item recordAbstract
We propose a novel logic-based argumentation framework, called Argumentation Logic (AL), built upon a restriction of classical Propositional Logic (PL) as its underlying logic. This allows us to control the application of Reduction ad Absurdum (RA). In the case of classically consistent theories, AL and PL are equivalent, and RA is recovered through a notion of (non-)acceptability of arguments. In the case of classically inconsistent theories, AL is an extension of PL that does not trivialize, enjoying good logic-based argumentation and general logical properties. © 2014 The authors and IOS PressAll rights reserved.
Collections
Cite as
Related items
Showing items related by title, author, creator and subject.
-
Conference Object
Modelling inhibition in metabolic pathways through abduction and induction
Tamaddoni-Nezhad, A.; Kakas, Antonis C.; Muggleton, S.; Pazos, F. (2004)In this paper, we study how a logical form of scientific modelling that integrates together abduction and induction can be used to understand the functional class of unknown enzymes or inhibitors. We show how we can model, ...
-
Conference Object
Preferred arguments are harder to compute than stable extensions
Dimopoulos, Yannis; Nebel, B.; Toni, F. (1999)Based on an abstract framework for nonmonotonic reasoning, Bondarenko et at. have extended the logic programming semantics of admissible and preferred arguments to other nonmonotonic formalisms such as circumscription, ...
-
Article
Classical methods in nonmonotonic reasoning
Dimopoulos, Yannis (1994)In this paper we present and compare some classical problem solving methods for computing the stable models of a general propositional logic program. In particular linear programming, propositional satisfiability, constraint ...