Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
422260 | Electronic Notes in Theoretical Computer Science | 2016 | 17 Pages |
Abstract
Logic-based approaches for analyzing and evaluating arguments have been largely studied in recent years, yielding a variety of formal methods for argumentation-based reasoning. The goal of this paper is to provide an abstract, proof theoretical investigation of logical argumentation, where arguments are represented by sequents, conflicts between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems extending standard sequent calculi.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ofer Arieli, Christian Straßer,