Changes for page Arg2P
From version 37.1
edited by Andrea Omicini
on 08/08/2021 16:55
on 08/08/2021 16:55
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 -Arg2P Home1 +Arg2P - Author
-
... ... @@ -1,1 +1,1 @@ 1 -XWiki. AndreaOmicini1 +XWiki.RobertaCalegari - Content
-
... ... @@ -1,15 +1,15 @@ 1 - >{{arg2p/}}is logic-based agreement framework enablingdefeasiblereasoning andagents’ conversationin AI applications so particularly suitable for reaching agents’explainable intelligent behaviours1 +{{include document="MacroSheet"/}} 2 2 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 + 3 3 == {{arg2p/}} in a nutshell == 4 4 5 -The {{arg2p/}} argumentation engine is built on the top of [[{{tuprolog/}}>>Tuprolog.WebHome||target=_blank]]({{2p/}}) engine. {{arg2p/}} is a lightweight implementation of the ASPIC+-like system for structured argumentation.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. 6 6 7 -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 followingstandardDung's labelling semantics.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. 8 8 9 - Themodelhas beenextendedfollowingtheburdenof proofmodelandsemantics presented in[[CalegariandSartor, 2020>>Publications.BurdenofproofIclp2020]].11 +In addition, we use defeasible rule schemata to account for deontic reasoning, towards doctrine reification, as presented in Riveret et al., 2019. 10 10 11 -More informationsontheprojectareavailable on the official{{arg2p/}}[[wiki>>https://pika-lab.gitlab.io/argumentation/arg2p-kt/]].13 +Moreover, the model has been extended following the burden of proof model presented in [[Calegari and Sartor, 2020>>Publications.BurdenofproofIclp2020]]. 12 12 13 -{{include reference="Arg2p.MacroSheet"/}} 14 - 15 - 15 +More information about the format of the knowledge base and rules can be found on the basic syntax.