Changes for page Arg2P
From version 53.1
edited by Andrea Omicini
on 03/11/2021 17:34
on 03/11/2021 17:34
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 (3 modified, 0 added, 0 removed)
Details
- Page properties
-
- Title
-
... ... @@ -1,1 +1,1 @@ 1 - #if($xcontext.language=="it")Arg2P– Home#{else}Arg2P Home#end1 +Arg2P - Author
-
... ... @@ -1,1 +1,1 @@ 1 -XWiki. AndreaOmicini1 +XWiki.RobertaCalegari - Content
-
... ... @@ -1,13 +1,15 @@ 1 -{{velocity}}((( 2 -!!(% style="background-color:$theme.fieldGradientColor; border-style:hidden" %){{arg2p/}} (short for {{argtuprolog/}}) is a logic-based agreement framework enabling defeasible reasoning in intelligent systems 3 -))){{/velocity}} 4 ->{{arg2p/}} in a nutshell 1 +{{include document="MacroSheet"/}} 5 5 6 - The{{arg2p/}} argumentationengine isbuilt onthetop of[[{{tuprolog/}}>>Tuprolog.WebHome||target=_blank]] ({{2p/}}) engine.{{arg2p/}} is alightweightimplementation ofthe ASPIC+-likesystemforstructuredargumentation.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}} 7 7 8 -{{arg2p/}} enables defeasible reasoningandargumentation, and dealswithpriorities over rules. It includesa formal method for dealing with burden of proof (//burden of persuasion//).5 +== {{arg2p/}} in a nutshell == 9 9 10 -More informations on the project are available on the {{arg2p/}} [[GitLab wiki>>https://pika-lab.gitlab.io/argumentation/arg2p-kt/]]. 11 -{{include reference="Environment"/}} 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. 12 12 9 +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. 13 13 11 +In addition, we use defeasible rule schemata to account for deontic reasoning, towards doctrine reification, as presented in Riveret et al., 2019. 12 + 13 +Moreover, the model has been extended following the burden of proof model presented in [[Calegari and Sartor, 2020>>Publications.BurdenofproofIclp2020]]. 14 + 15 +More information about the format of the knowledge base and rules can be found on the basic syntax.