Changes for page Arg2P

From version 26.1

edited by Roberta Calegari
on 13/03/2021 07:37

Change comment: There is no comment for this version

To version 27.1

edited by Roberta Calegari
on 13/03/2021 07:39

Change comment: There is no comment for this version

Summary

Page properties

Content

@@ -6,10 +6,8 @@
  The {{arg2p/}} argumentation engine is built on the top of {{tuprolog/}} ({{2p/}}) engine.  {{arg2p/}} is a lightweight implementation of the ASPIC+-like system for structured argumentation.
--In {{arg2p/}} arguments are produced from a set of defeasible rules, and attack relationships between arguments are captured by argumentation graphs. The arguments of such graphs are labelled by following a labelling semantics. This simple framework will suffice to illustrate our upcoming investigation into persuasive burdens within an argumentation setting.
++In {{arg2p/}} arguments are produced from a set of defeasible rules possibly containing deontic statements, and attack relationships between arguments are captured by argumentation graphs. The arguments of such graphs are labelled by following standard Dung's labelling semantics.
--In addition, we use defeasible rule schemata to account for deontic reasoning, towards doctrine reification, as presented in Riveret et al., 2019.
++The model has been extended following the burden of proof model and semantics presented in [[Calegari and Sartor, 2020>>Publications.BurdenofproofIclp2020]].
--Moreover, the model has been extended following the burden of proof model presented in [[Calegari and Sartor, 2020>>Publications.BurdenofproofIclp2020]].
--
  More information about the format of the knowledge base and rules can be found on the basic syntax.