Changes for page Arg2P
From version 25.1
edited by Andrea Omicini
on 12/03/2021 22:13
on 12/03/2021 22:13
Change comment:
There is no comment for this version
To version 26.1
edited by Roberta Calegari
on 13/03/2021 07:37
on 13/03/2021 07:37
Change comment:
There is no comment for this version
Summary
-
Page properties (2 modified, 0 added, 0 removed)
Details
- Page properties
-
- Author
-
... ... @@ -1,1 +1,1 @@ 1 -XWiki. AndreaOmicini1 +XWiki.RobertaCalegari - Content
-
... ... @@ -1,9 +1,11 @@ 1 1 {{include document="MacroSheet"/}} 2 2 3 -{{summary}}{{arg2p/}} is a nargumentationenginebuilt onthetop of{{tuprolog/}}({{2p/}})engine.{{arg2p/}} is alightweightimplementation ofthe ASPIC+-likesystemforstructuredargumentation.{{/summary}}3 +{{summary}}{{arg2p/}} is logic-based agreement framework enabling defeasible reasoning and agents’ conversation in AI applications so particularly suitable for reaching agents’ explainable intelligent behaviours.{{/summary}} 4 4 5 5 == {{arg2p/}} in a nutshell == 6 6 7 +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. 8 + 7 7 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. 8 8 9 9 In addition, we use defeasible rule schemata to account for deontic reasoning, towards doctrine reification, as presented in Riveret et al., 2019.
