<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Straßer, Christian</style></author><author><style face="normal" font="default" size="100%">Arieli, Ofer</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Parsons, Simon</style></author><author><style face="normal" font="default" size="100%">Oren, Nir</style></author><author><style face="normal" font="default" size="100%">Reed, Chris</style></author><author><style face="normal" font="default" size="100%">Cerutti, Federico</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Dynamic Derivations for Sequent-Based Deductive Argumentation</style></title><secondary-title><style face="normal" font="default" size="100%">COMMA 2014</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><volume><style face="normal" font="default" size="100%">Computational Models of Argument</style></volume><pages><style face="normal" font="default" size="100%">89–100</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We introduce a general approach for representing and reasoning with argumentation-based systems. In our framework arguments are represented by Gentzen-style sequents, attacks (conflicts) between arguments are represented by sequent elimination rules, and deductions are made by dynamic proof systems. This framework accommodates different languages and logics in which arguments may be represented, supports a variety of attack relations, and tolerates dynamic changes in the argumentation setting by revising derivations of assertions in light of new information.&lt;/p&gt;</style></abstract></record></records></xml>