@tuprolog/arg2p 0.13.0 → 0.13.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (24) hide show
  1. package/2p-core.js +16 -16
  2. package/2p-dsl-core.js +213 -213
  3. package/2p-dsl-core.js.map +1 -1
  4. package/2p-dsl-solve.js +7 -7
  5. package/2p-dsl-theory.js +5 -5
  6. package/2p-dsl-unify.js +9 -9
  7. package/2p-parser-core.js +8 -8
  8. package/2p-parser-js.js +1 -1
  9. package/2p-solve-classic.js +6 -6
  10. package/2p-solve.js +50 -34
  11. package/2p-solve.js.map +1 -1
  12. package/2p-theory.js +5 -5
  13. package/2p-unify.js +5 -5
  14. package/2p-utils.js +8 -8
  15. package/README.md +1 -1
  16. package/arg2p-causality-solver.js +4 -4
  17. package/arg2p-causality-solver.js.map +1 -1
  18. package/arg2p-core.js +17 -17
  19. package/arg2p-core.js.map +1 -1
  20. package/arg2p.js +4 -4
  21. package/kotlin-kotlin-stdlib.js +143 -127
  22. package/kotlin-kotlin-stdlib.js.map +1 -1
  23. package/kt-math.js +20 -20
  24. package/package.json +1 -1
package/2p-theory.js CHANGED
@@ -55,9 +55,9 @@
55
55
  var isInterface = kotlin_kotlin.$_$.e6;
56
56
  var KProperty1 = kotlin_kotlin.$_$.g7;
57
57
  var getPropertyCallableRef = kotlin_kotlin.$_$.u5;
58
- var lazy = kotlin_kotlin.$_$.ra;
58
+ var lazy = kotlin_kotlin.$_$.va;
59
59
  var CoroutineImpl = kotlin_kotlin.$_$.p4;
60
- var THROW_CCE = kotlin_kotlin.$_$.la;
60
+ var THROW_CCE = kotlin_kotlin.$_$.pa;
61
61
  var SequenceScope = kotlin_kotlin.$_$.h7;
62
62
  var get_COROUTINE_SUSPENDED = kotlin_kotlin.$_$.o4;
63
63
  var initMetadataForLambda = kotlin_kotlin.$_$.a6;
@@ -77,7 +77,7 @@
77
77
  var ArrayList_init_$Create$_0 = kotlin_kotlin.$_$.d;
78
78
  var minOrNull = kotlin_kotlin.$_$.g3;
79
79
  var map = kotlin_kotlin.$_$.f8;
80
- var ensureNotNull = kotlin_kotlin.$_$.pa;
80
+ var ensureNotNull = kotlin_kotlin.$_$.ta;
81
81
  var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.f;
82
82
  var sum = kotlin_kotlin.$_$.p8;
83
83
  var Collection = kotlin_kotlin.$_$.l1;
@@ -92,7 +92,7 @@
92
92
  var flatMap = kotlin_kotlin.$_$.w7;
93
93
  var sequenceOf_0 = kotlin_kotlin.$_$.m8;
94
94
  var firstOrNull = kotlin_kotlin.$_$.u7;
95
- var NotImplementedError = kotlin_kotlin.$_$.ga;
95
+ var NotImplementedError = kotlin_kotlin.$_$.ka;
96
96
  var take = kotlin_kotlin.$_$.r8;
97
97
  var IllegalStateException_init_$Create$ = kotlin_kotlin.$_$.t;
98
98
  var get_ONE = kotlin_kotlin.$_$.r4;
@@ -119,7 +119,7 @@
119
119
  var listOf_0 = kotlin_kotlin.$_$.b3;
120
120
  var none_0 = kotlin_kotlin.$_$.p3;
121
121
  var dequeOf_1 = kotlin_it_unibo_tuprolog_utils.$_$.a1;
122
- var Pair = kotlin_kotlin.$_$.ja;
122
+ var Pair = kotlin_kotlin.$_$.na;
123
123
  var toMutableList = kotlin_kotlin.$_$.j4;
124
124
  var toMutableList_0 = kotlin_kotlin.$_$.v8;
125
125
  var addFirst_0 = kotlin_it_unibo_tuprolog_utils.$_$.p;
package/2p-unify.js CHANGED
@@ -28,20 +28,20 @@
28
28
  var Companion_getInstance = kotlin_it_unibo_tuprolog_core.$_$.v;
29
29
  var ArrayList_init_$Create$ = kotlin_kotlin.$_$.d;
30
30
  var toCollection = kotlin_kotlin.$_$.s8;
31
- var Pair = kotlin_kotlin.$_$.ja;
31
+ var Pair = kotlin_kotlin.$_$.na;
32
32
  var VOID = kotlin_kotlin.$_$.b;
33
- var lazy = kotlin_kotlin.$_$.ra;
33
+ var lazy = kotlin_kotlin.$_$.va;
34
34
  var protoOf = kotlin_kotlin.$_$.m6;
35
35
  var asSequence_0 = kotlin_kotlin.$_$.z1;
36
- var THROW_CCE = kotlin_kotlin.$_$.la;
36
+ var THROW_CCE = kotlin_kotlin.$_$.pa;
37
37
  var initMetadataForClass = kotlin_kotlin.$_$.x5;
38
38
  var Companion_instance = kotlin_it_unibo_tuprolog_utils.$_$.a;
39
- var Triple = kotlin_kotlin.$_$.na;
39
+ var Triple = kotlin_kotlin.$_$.ra;
40
40
  var Some = kotlin_it_unibo_tuprolog_utils.$_$.l;
41
41
  var zip = kotlin_kotlin.$_$.z8;
42
42
  var flatMap = kotlin_kotlin.$_$.w7;
43
43
  var sequenceOf = kotlin_kotlin.$_$.m8;
44
- var to = kotlin_kotlin.$_$.ya;
44
+ var to = kotlin_kotlin.$_$.cb;
45
45
  var sequenceOf_0 = kotlin_kotlin.$_$.l8;
46
46
  var initMetadataForCompanion = kotlin_kotlin.$_$.y5;
47
47
  var toString = kotlin_kotlin.$_$.p6;
package/2p-utils.js CHANGED
@@ -20,14 +20,14 @@
20
20
  var initMetadataForCompanion = kotlin_kotlin.$_$.y5;
21
21
  var Unit_instance = kotlin_kotlin.$_$.k1;
22
22
  var initMetadataForInterface = kotlin_kotlin.$_$.z5;
23
- var THROW_CCE = kotlin_kotlin.$_$.la;
23
+ var THROW_CCE = kotlin_kotlin.$_$.pa;
24
24
  var isInterface = kotlin_kotlin.$_$.e6;
25
25
  var Iterable = kotlin_kotlin.$_$.m1;
26
26
  var initMetadataForClass = kotlin_kotlin.$_$.x5;
27
27
  var VOID = kotlin_kotlin.$_$.b;
28
28
  var Sequence = kotlin_kotlin.$_$.i7;
29
29
  var arrayIterator = kotlin_kotlin.$_$.i5;
30
- var Comparable = kotlin_kotlin.$_$.aa;
30
+ var Comparable = kotlin_kotlin.$_$.ea;
31
31
  var toList = kotlin_kotlin.$_$.u8;
32
32
  var asSequence = kotlin_kotlin.$_$.z1;
33
33
  var asIterable = kotlin_kotlin.$_$.u1;
@@ -43,13 +43,13 @@
43
43
  var KtList = kotlin_kotlin.$_$.n1;
44
44
  var equals = kotlin_kotlin.$_$.r5;
45
45
  var FunctionAdapter = kotlin_kotlin.$_$.h5;
46
- var Comparator = kotlin_kotlin.$_$.ba;
46
+ var Comparator = kotlin_kotlin.$_$.fa;
47
47
  var CoroutineImpl = kotlin_kotlin.$_$.p4;
48
48
  var SequenceScope = kotlin_kotlin.$_$.h7;
49
49
  var get_COROUTINE_SUSPENDED = kotlin_kotlin.$_$.o4;
50
50
  var initMetadataForLambda = kotlin_kotlin.$_$.a6;
51
51
  var withIndex = kotlin_kotlin.$_$.x8;
52
- var ensureNotNull = kotlin_kotlin.$_$.pa;
52
+ var ensureNotNull = kotlin_kotlin.$_$.ta;
53
53
  var filterNot = kotlin_kotlin.$_$.s7;
54
54
  var toMutableList = kotlin_kotlin.$_$.v8;
55
55
  var minWithOrNull = kotlin_kotlin.$_$.g8;
@@ -59,18 +59,18 @@
59
59
  var toString = kotlin_kotlin.$_$.p6;
60
60
  var Companion_getInstance = kotlin_io_github_gciatto_kt_math.$_$.e;
61
61
  var Companion_getInstance_0 = kotlin_io_github_gciatto_kt_math.$_$.d;
62
- var toString_0 = kotlin_kotlin.$_$.xa;
62
+ var toString_0 = kotlin_kotlin.$_$.bb;
63
63
  var initMetadataForObject = kotlin_kotlin.$_$.b6;
64
64
  var KtMap = kotlin_kotlin.$_$.p1;
65
- var lazy = kotlin_kotlin.$_$.ra;
65
+ var lazy = kotlin_kotlin.$_$.va;
66
66
  var KProperty1 = kotlin_kotlin.$_$.g7;
67
67
  var getPropertyCallableRef = kotlin_kotlin.$_$.u5;
68
68
  var getKClassFromExpression = kotlin_kotlin.$_$.d7;
69
69
  var NoSuchElementException_init_$Create$ = kotlin_kotlin.$_$.w;
70
70
  var getBigIntHashCode = kotlin_kotlin.$_$.s5;
71
71
  var first = kotlin_kotlin.$_$.q2;
72
- var to = kotlin_kotlin.$_$.ya;
73
- var Pair = kotlin_kotlin.$_$.ja;
72
+ var to = kotlin_kotlin.$_$.cb;
73
+ var Pair = kotlin_kotlin.$_$.na;
74
74
  var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.f;
75
75
  var joinToString = kotlin_kotlin.$_$.b8;
76
76
  var mutableListOf = kotlin_kotlin.$_$.m3;
package/README.md CHANGED
@@ -1,6 +1,6 @@
1
1
  # Arg2P
2
2
 
3
- Arg2P is a lightweight implementation of the ASPIC<sup>+</sup> framework for structured argumentation.
3
+ Arg2P is an implementation of the ASPIC<sup>+</sup> framework for structured argumentation.
4
4
  Built on top of the [tuProlog](https://apice.unibo.it/xwiki/bin/view/Tuprolog/) engine, it supports both JVM and Node environments.
5
5
 
6
6
  More details are available on the [official wiki](https://tuprolog.github.io/arg2p-kt/).
package/arg2p-causality-solver.js CHANGED
@@ -33,7 +33,7 @@
33
33
  }(function (_, kotlin_kotlin, kotlin_it_unibo_tuprolog_core, kotlin_it_unibo_tuprolog_unify, kotlin_it_unibo_tuprolog_parser_core, kotlin_it_unibo_tuprolog_theory, kotlin_it_unibo_tuprolog_parser_theory, kotlin_it_unibo_tuprolog_argumentation_core, kotlin_it_unibo_tuprolog_solve) {
34
34
  'use strict';
35
35
  //region block: imports
36
- var ensureNotNull = kotlin_kotlin.$_$.pa;
36
+ var ensureNotNull = kotlin_kotlin.$_$.ta;
37
37
  var Companion_getInstance = kotlin_it_unibo_tuprolog_core.$_$.v;
38
38
  var filter = kotlin_kotlin.$_$.t7;
39
39
  var map = kotlin_kotlin.$_$.f8;
@@ -60,7 +60,7 @@
60
60
  var Companion_getInstance_2 = kotlin_it_unibo_tuprolog_core.$_$.l;
61
61
  var Default_getInstance = kotlin_kotlin.$_$.i1;
62
62
  var nextUInt = kotlin_kotlin.$_$.v6;
63
- var UInt = kotlin_kotlin.$_$.oa;
63
+ var UInt = kotlin_kotlin.$_$.sa;
64
64
  var Collection = kotlin_kotlin.$_$.l1;
65
65
  var isInterface = kotlin_kotlin.$_$.e6;
66
66
  var arg2pScope = kotlin_it_unibo_tuprolog_argumentation_core.$_$.e;
@@ -82,7 +82,7 @@
82
82
  var Companion_instance_3 = kotlin_it_unibo_tuprolog_argumentation_core.$_$.a;
83
83
  var Companion_instance_4 = kotlin_it_unibo_tuprolog_argumentation_core.$_$.b;
84
84
  var Companion_getInstance_3 = kotlin_it_unibo_tuprolog_core.$_$.i;
85
- var replace = kotlin_kotlin.$_$.k9;
85
+ var replace = kotlin_kotlin.$_$.n9;
86
86
  var listOf = kotlin_kotlin.$_$.c3;
87
87
  var Companion_getInstance_4 = kotlin_it_unibo_tuprolog_solve.$_$.h1;
88
88
  var mapCapacity = kotlin_kotlin.$_$.d3;
@@ -484,7 +484,7 @@
484
484
  var tmp$ret$0 = element.m1s();
485
485
  destination.k4(tmp$ret$0, element);
486
486
  }
487
- return tmp.of(this.v3p_1, destination, parseTheoryWithOperators(Companion_instance_0, 'subsets([], []).\nsubsets([H|T], [H|NT]) :- subsets(T, NT).\nsubsets([_|T], NT) :- subsets(T, NT).\n\nproper_subsets(L, S) :-\n subsets(L, S),\n S \\= [],\n S \\= L.\n\ngenerate_interventions(_, S, [CS]) :-\n compl(S, CS).\ngenerate_interventions(_, S, [undercut(S)]) :-\n S \\= -_.\ngenerate_interventions(R, S, SUP) :-\n parser:::convertAllRules(_),\n compl(S, CS),\n unused_premises(R, UP), !,\n subsets(UP, SUP),\n member(CS, SUP),\n SUP \\= [].\n\ncompl(-X, X) :- !.\ncompl(X, -X).\n\nunused_premises(R, UP) :-\n findall(P, (parser::rule(Id, P, _), \\+ member(Id, R)), RR),\n utils::appendLists(RR, UP).\n', this.w3p_1));
487
+ return tmp.of(this.v3p_1, destination, parseTheoryWithOperators(Companion_instance_0, 'subsets([], []).\nsubsets([H|T], [H|NT]) :- subsets(T, NT).\nsubsets([_|T], NT) :- subsets(T, NT).\n\nproper_subsets(L, S) :-\n subsets(L, S),\n S \\= [],\n S \\= L.\n\ngenerate_interventions(_, S, [CS]) :-\n compl(S, CS).\ngenerate_interventions(_, S, [undercut(S)]) :-\n S \\= -_.\ngenerate_interventions(R, S, SUP) :-\n parser:::convertAllRules(_),\n compl(S, CS),\n unused_premises(R, UP), !,\n subsets(UP, SUP),\n member(CS, SUP),\n SUP \\= [].\n\ncompl(-X, X) :- !.\ncompl(X, -X).\n\nunused_premises(R, UP) :-\n findall(P, (parser::rule(Id, P, _), \\+ member(Id, R), ground(Id)), RR),\n utils::appendLists(RR, UP).\n', this.w3p_1));
488
488
  };
489
489
  protoOf(CausalitySolver).z39 = function () {
490
490
  return 'causality';
package/arg2p-causality-solver.js.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"sources":["../../../../../../causality-solver/src/commonMain/kotlin/it/unibo/tuprolog/argumentation/causality/libs/CausalitySolver.kt","common/src/generated/_Collections.kt"],"sourcesContent":[null,null],"ignoreList":[],"x_google_ignoreList":[],"names":["CausalitySolver$CausalityCheckCause$solve$lambda$lambda","$this_arg2pScope","CausalitySolver$CausalityCheckCause$solve$lambda$lambda$lambda","$request","$effect","$intervention","CausalitySolver$CausalityCheckCause$solve$lambda","$rules","$cause","equalTerms","a","b","attackers","x","graph","element","item","supporters","chain","list","solveFresh","effect","kb","getSupports","checkBaseTheory","request","checkIntervention","intervention","support","getSubsets","checkCausality","supports","<init>","<get-signature>","solve","cause","rules","CausalitySolver$solveFresh$lambda","CausalitySolver$solveFresh$lambda$lambda","CausalitySolver$getSupports$lambda","CausalitySolver$getSupports$lambda$lambda","$graph","CausalitySolver$checkBaseTheory$lambda","CausalitySolver$getSubsets$lambda$lambda","CausalitySolver$getSubsets$lambda$lambda$lambda","CausalitySolver$getSubsets$lambda","clean","string","<get-alias>","<get-baseContent>","capacity","identifier","<get-theoryOperators>"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kEAmMoCA,CAAA,EAAAA,EAAA;A,IACI,OAAR,EAAG,M;EACP,C;oEAAMA,CALHC,gBAKGD,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAmC,OAAjC,cAAA,EAAG,MAAH,IAAgB,sBAAhB,EAAqB,a;IAAa,C;G;oEAClCF,CAnKpC,M,EAmI2BG,Q,EAGfC,OA6BwBJ,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAqC,OAAnC,uBAAe,QAAf,EAAwB,EAAxB,EAA4B,OAA5B,C;IAAoC,C;G;oEACzCF,CAhCrBK,aAgCqBL,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAmC,OAApB,2BAAG,aAAH,EAAiB,EAAjB,C;IAAqB,C;G;2DAPtCI,CA1BJH,Q,EAcfI,M,EAZAC,M,EArIZ,M,EAsIYJ,O,EAFAC,aAyBmBC,E;oBAAAN,CAAA,gBAAAA,EAAA;A,gBACP,QACK,OAAM,wDAAyB,MAAzB,EAAgC,SAAO,sBAAP,CAAhC,CAAN,C;kBACA,YAAO,uDAAP,C;kBAEC,WAAI,2EAAJ,C;kBACD,cAAO,oFAAP,C;UALL,iBAOK,YADA,WAAI,wEAAJ,CACA,C;MAAsC,OAP3C,yBAOmC,gCAPnC,iB;IAQJ,C;G;qBA1JRS,CAAA,K,EACJC,C,EACAC,CAFIF,EAGJ;A,IAAsD,OAA3C,+BAAQ,OAAW,8BAAM,CAAN,CAAX,EAA0B,8BAAM,CAAN,CAA1B,C;EAAkC,C;oBAEjDG,CAAA,K,EACJC,C,EACAC,KAFIF,EAIJ;A;eAAA,K,CAAM,K;;sBC6sBM,yB;QA2FA,4B;WAAA,qB,EAAM;A,UAAjBG,UAAW,qB;MAAU,IAAU,ODvyBlB,CAAG,KAAH,CAAU,KAAV,KAAwB,CAAxB,CAA0B,KCuyBlB,C,CAAgC;A,QAAZ,WAAY,GAAI,OAAJ,C;;IAAW,C;;;wBA0rBxD,0BAAa,wBAzrBnB,WAyrBmB,EAAwB,EAAxB,CAAb,C;QAuEA,sBAhwBN,WAgwBM,I;WAAA,uB,EACT;A,UADCC,OAAQ,uB;;mBDviDS,K,CAAM,K;;;;YC4OZ,gC;eAAA,uB,EAAM;A,cAAjBD,YAAW,uB;UAAU,IA4zCI,IDxiDgB,CAAI,KAAJ,CAAa,KAAb,KC4OV,SD5OU,CAA8B,KAA9B,CAAuC,KC4O3D,C;YAAoB,YAAO,S;;;QAAM,C;QAC3D,YAAO,I;;UA1HP,YAAO,S;UDnH4F,YAA7E,cAAiB,SAAjB,C;MCwiDlB,aAAY,GAAI,SAAJ,C;IAAmB,C;IDxiDkE,OCyiD9F,a;EDziD6F,C;qBAE5FE,CAAA,K,EACJJ,C,EACAC,K,EACAI,KAHID,EAKJ;A;IAAI,IAAgB,KAAhB,KAAE,KAAF,E;YACA,W;;;iBAEA,K,CAAM,K;;wBCisBE,yB;UA2FA,4B;aAAA,qB,EAAM;A,YAAjBF,UAAW,qB;QAAU,ID3xBJ,EAAE,KAAF,KC2xBc,OD3xBd,CAAmB,KAAnB,CAA4B,KC2xBxB,IAAU,OD3xB4B,CAAG,KAAH,KAAY,IC2xBlD,C,CAAgC;A,UAAZ,WAAY,GAAI,OAAJ,C;;MAAW,C;kBAC9D,W;;mBD3xBK,iBAAU,CAAV,EAAa,KAAb,C;;0BCuxCK,yB;UAsFD,gC;aAAA,uB,EAAM;A,YAAjBA,YAAW,uB;;qBD52CA,iBC62CS,SD72CT,CAAc,KAAd,EAAwB,KAAxB,C;;4BC8rBA,yB;YA2FA,gC;eAAA,uB,EAAM;A,cAAjBA,YAAW,uB;UAAU,IDxxBI,ECwxBM,SDxxBN,CAAG,KAAH,CAAY,KAAZ,KAA0B,CAA1B,CAA4B,KAA5B,CCwxBJ,C,CAAgC;A,YAAZ,aAAY,GAAI,SAAJ,C;;QAAW,C;;;4BA6fpD,yB;YAsFD,sBAllBT,aAklBS,I;eAAA,uB,EAAM;A,cAAjBA,YAAW,uB;cACZI,OD32C2B,kBC22CN,SD32CM,CAAc,KAAd,EAAwB,KAAxB,EAA+B,YAAQ,CAAR,CAAU,KAAV,CAA/B,C;UC42Cf,OAAZ,aAAY,EAAO,IAAP,C;QAChB,C;YAFIA,SAGG,a;QAFS,OAAZ,aAAY,EAAO,MAAP,C;MAChB,C;YDl3CQ,cCm3CD,aDn3CC,C;;IAOH,U;EAAD,C;qBAEIC,CAAA,K,EACJC,M,EACAC,EAFIF,EAGC;A,IACL,KAAY,CAAP,KAAO,gB;IACZ,KAAY,CAAP,KAAO,cAAoB,+CAAM,EAAG,kBAAwB,IAAxB,CAAT,EAAwC,KAAxC,CAAwC,KAAxC,CAApB,C;cACL,KACF,CADO,KACP,OAAa,uCAAO,cAAP,GAAoB,MAApB,GAA0B,GAA1B,CAAb,C;QADE,iBAGF,YADA,SAAI,wCAAJ,CACA,C;IAHL,OAAO,yBAGe,UAAM,WAAN,EAAmB,WAAnB,EAAgC,WAAhC,CAHf,iB;EAIX,C;sBAGQG,CAAA,K,EACJT,K,EACAO,MAFIE,EAIJ;A,cACK,WADL,KACK,CADC,KACD,C;gBACA,YAAO,iDAAP,C;gBACA,eAAQ,kDAAR,C;IACmB,OAAnB,WAAI,oCAAJ,C;EAAkB,C;0BAEnBC,CAAA,K,EACJC,O,EACAJ,MAFIG,EAGJ;A;aAAA,kBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAnC,C;cACA,mBAAY,EAAZ,EAAgB,MAAhB,C;IACH,OAD+D,OAApC,SAAI,sCAAJ,CAAoC,C;EAChE,C;4BAEQE,CAAA,K,EACJD,O,EACAE,Y,EACAC,O,EACAP,MAJIK,EAKJ;A;iBAAA,YAAa,S;;sBC06CJ,0BAAa,gCAAwB,EAAxB,CAAb,C;QAuEA,oBAvEN,MAuEM,I;WAAA,qB,EACT;A,UADCV,OAAQ,qB;UDj/CsF,YAArD,6BAAU,uCAAO,QAAP,YAAsB,+BAAtB,IAAiC,IAAjC,GCk/C1B,IDl/C0B,cAAuC,GAAvC,CAAV,K;MCk/C1C,WAAY,GAAI,SAAJ,C;IAAmB,C;;;;eDj/C/B,kBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAS,YAAY,qDCk/CrD,WDl/CqD,CAAZ,CAA5C,C,CACQ,K;;wBCmpBI,yB;QA2FA,8B;WAAA,uB,EAAM;A,UAAjBD,UAAW,uB;MAAU,IAAU,OD7uBT,CAAE,KAAF,KAAW,KC6uBZ,IAAU,OD7uBW,CAAE,KAAF,KAAW,KC6uBhC,C,CAAgC;A,QAAZ,aAAY,GAAI,OAAJ,C;;IAAW,C;;;wBA0rBxD,0BAAa,wBAzrBnB,aAyrBmB,EAAwB,EAAxB,CAAb,C;QAuEA,sBAhwBN,aAgwBM,I;WAAA,uB,EACT;A,UADCC,SAAQ,uB;UD7+C0C,YC8+CzB,MD9+CK,CAAT,KAAS,M;MC8+C/B,aAAY,GAAI,SAAJ,C;IAAmB,C;;;;;MA8H/B,gBA7HG,aA6HH,c;cA7HG,aA6HmB,I;;cAAA,K;;MAAtB,Q;QAAiC,YAAO,K;;;UAC5B,sBA9HT,aA8HS,I;aAAA,uB,EAAM;A,YAAjBD,YAAW,uB;;;;;UADZ,gBD3mDoB,OC2mDpB,c;oBD3mDoB,OC2mDE,I;;oBAAA,K;;UAAtB,U;YAAiC,aAAO,K;;;cAC5B,sBD5mDQ,OC4mDR,I;iBAAA,uB,EAAM;A,gBAAjBA,YAAW,uB;YAAU,ID5mD4B,+BAAQ,OC4mD1B,SD5mD0B,EC4mD1B,SD5mD0B,CC4mDpC,C;cAAoB,aAAO,I;;;UAAG,C;UACxD,aAAO,K;;QADmB,ID5mDM,UC4mDN,C;UAAoB,YAAO,I;;;MAAG,C;MACxD,YAAO,K;;ID3mDN,OAFY,S;EAEb,C;qBAEQc,CAAA,K,EACJJ,O,EACAE,YAFIE,EAGJ;A,IAOH,OAPG,WAAW,wDAAX,C;EAOJ,C;yBAKQC,CAAA,K,EACJL,O,EACAE,Y,EACAN,MAHIS,EAIG;A,QACPC,WAAe,uBAAgB,OAAhB,EAAyB,MAAzB,C;IACX,IAAA,QAAS,IAAT,C;MAAoB,OAAO,K;;IACxB,6BAAkB,OAAlB,EAA2B,YAA3B,EAAyC,QAAzC,EAAmD,MAAnD,E;;MAEC,IAAA,YAAa,KAAb,IAAgC,CAAhC,C;gBAAA,I;;mBACI,kBAAW,OAAX,EAAoB,YAApB,C;;;;;UCyjDZ,kC;oBAAsB,Q;;oBAAA,K;;UAAtB,U;YAAiC,YAAO,I;;;cAC5B,4B;iBAAA,qB,EAAM;A,gBAAjBhB,UAAW,qB;YAAU,KD1jD8B,CAAC,yBAAkB,OAAlB,EC0jDpB,OD1jDoB,EAA+B,QAA/B,EAAyC,MAAzC,CC0jD/B,C;cAAqB,YAAO,K;;;UAAI,C;UAC1D,YAAO,I;;gBD3jD2C,S;;;;YADtC,K;;IAFR,U;EAKJ,C;qCAEAiB,C,MAAAA,EAAA;A,IAAA,mB;IAC6B,2BAAU,uBAAV,EAAmC,CAAnC,C;EAD7B,C;qDACaC,CAAAA,EAAA;A,IAAA,iB;EAAY,C;qDAEZC,CAAUT,OAAVS,EAA8E;A,QACnFP,eAA2B,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,a;QAChDN,SAAqB,eAAM,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,WAA3B,C;IAErB,OAAO,WACH,OAAQ,oBAAU,2BAAe,OAAf,EAAwB,YAAxB,EAAsC,MAAtC,CAAV,WADL,C;EAGX,C;wDAzJKI,O;;;8BA4JTO,C,MAAAA,EAAA;A,IAAA,mB;IAC6B,2BAAU,UAAV,EAAsB,CAAtB,C;EAD7B,C;8CACaC,CAAAA,EAAA;A,IAAA,iB;EAAY,C;8CAEZC,CAAUT,OAAVS,EAA8E;A,QACnFP,eAAyB,QAAQ,SAAR,GAAkB,CAAlB,C;QACzBQ,QAAkB,QAAQ,SAAR,GAAkB,CAAlB,C;QAClBd,SAAqB,eAAM,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,WAA3B,C;IAEjB,oC,CAAsB;A,MACtB,MAAgB,6BACZ,OADY,CACJ,OADI,EAEZ,OAFY,CAEJ,SAFI,EAGO,+BAHP,EAIZ,YAJY,C;IAMpB,C;;;iBAIQ,uBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAnC,C,CACK,K;;sBCm2CR,0BAAa,gCAAwB,EAAxB,CAAb,C;QAuEA,oBAvEN,MAuEM,I;WAAA,qB,EACT;A,UADCL,OAAQ,qB;UDz6CwB,YC06CP,ID16CO,CAAP,K;MC06C1B,WAAY,GAAI,SAAJ,C;IAAmB,C;;;wBA71BnB,yB;QA2FA,sBAmwBT,WAnwBS,I;WAAA,uB,EAAM;A,UAAjBD,UAAW,uB;MAAU,IDvqBI,ECuqBM,ODvqBN,KAAM,MAAN,CCuqBJ,C,CAAgC;A,QAAZ,aAAY,GAAI,OAAJ,C;;IAAW,C;QD5qB7DqB,QACS,eAMI,SADA,SCuqBd,aDvqBc,CACA,CANJ,C;IAST,OAAO,WACH,OAAQ,WACJ,WAAW,yGAAX,CADI,WADL,C;EAcX,C;iDArMKX,O;;;4CA8EIY,CARL,MAQKA,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAAgB,OAAP,gBAAP,MAAO,CAAP,KAAO,C;IAAQ,C;G;6CAWdC,CANR,M,EAEJnC,OAIYmC,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAA4C,OAA1C,mBAAW,EAAX,CAAc,KAAd,CAAuB,KAAvB,EAAmC,OAAnC,C;IAA2C,C;G;+CAC5CD,CAPT,M,EACJE,MAMaF,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAA6C,OAA3C,mBAAW,EAAX,CAAc,KAAd,EAAwB,MAAxB,EAA+B,WAA/B,C;IAA4C,C;G;+CAClDD,CAAA,EAAAA,EAAA;A,IAAa,OAAX,EAAW,CAAR,K;EAAS,C;iDAMKG,CAAE,CAAFA,EAAA;A,IAA6B,OAAtB,CAAE,M;EAAqB,C;mDAuB9CC,CAAA,EAAAA,EAAA;A,IACI,OAAR,EAAG,M;EACP,C;qDAAMA,CALC1C,gBAKD0C,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAAmC,OAAjC,cAAA,EAAG,MAAH,IAAgB,sBAAhB,EAAqB,a;IAAa,C;G;4CALnCC,CAFX1C,Q,EACAE,aACWwC,E;oBAAAF,CAAA,gBAAAA,EAAA;A,gBACX,QACK,OAAM,gDAAiB,aAAjB,EAA+B,wBAA/B,CAAN,C;kBACA,YAAO,wCAAP,C;MAGQ,OAAR,OADC,WAAI,4DAAJ,CACD,C;IACT,C;G;0BAhGJX,CAAAA,EAAA;A,cAM2B,I;;QAC2B,kC;IAD3B,4BAC4E,CAAhF,+CAAoE,UAApE,0BAA+B,oBAA/B,CAAgF,OAD5E,C;IAIe,aAAV,0BAAU,M;IAkKjB,oD;IAsDZ,aAFA,0BACA,iBAAoB,0BAApB,CACA,2CAAiB,OAAjB,C;EAlOb,C;0CAGIc,CAAUC,MAAVD,EAA4B;A,IAAwC,OAAhB,QAAjB,QAAP,MAAO,EAAQ,GAAR,EAAa,EAAb,CAAiB,EAAQ,GAAR,EAAa,EAAb,C;EAAe,C;0CAyK1DE,CAAAA,EAAA;A,IAAA,iB;EAAQ,C;0CAGbC,CAAAA,EACI;A;qBAAA,OAAO,uCAA8B,6BAA9B,CAAP,C;;;QCo+BRC,WAAwD,cAAzC,YAAY,wBDj+BE,UCi+BF,EAAwB,EAAxB,CAAZ,CAAyC,EAAc,EAAd,C;;sBACnC,4BAAoB,QAApB,C;QA2BL,oBD7/Ba,UC6/Bb,I;WAAA,qB,EAAM;A,UAAjBnC,UAAW,qB;UD7/BkD,YC8/BlC,OD9/ByB,M;MC8/BrD,WAAY,IAAI,SAAJ,EAA0B,OAA1B,C;IAChB,C;ID39BS,OAtCW,OACI,IADJ,CACS,KADT,ECkgCb,WDlgCa,EAIO,+CA8BC,2oBA9BD,EA+BH,IA/BG,CA+BH,KA/BG,CAJP,C;EAsCZ,C;0CAKCoC,CAAAA,EAA2B;A,IAAW,OAAX,W;EAAU,C;0CAErCC,CAAAA,EAAA;A,IAAA,iB;EAAkB,C;;;;;;;;;;"}
1
+ {"version":3,"sources":["../../../../../../causality-solver/src/commonMain/kotlin/it/unibo/tuprolog/argumentation/causality/libs/CausalitySolver.kt","common/src/generated/_Collections.kt"],"sourcesContent":[null,null],"ignoreList":[],"x_google_ignoreList":[],"names":["CausalitySolver$CausalityCheckCause$solve$lambda$lambda","$this_arg2pScope","CausalitySolver$CausalityCheckCause$solve$lambda$lambda$lambda","$request","$effect","$intervention","CausalitySolver$CausalityCheckCause$solve$lambda","$rules","$cause","equalTerms","a","b","attackers","x","graph","element","item","supporters","chain","list","solveFresh","effect","kb","getSupports","checkBaseTheory","request","checkIntervention","intervention","support","getSubsets","checkCausality","supports","<init>","<get-signature>","solve","cause","rules","CausalitySolver$solveFresh$lambda","CausalitySolver$solveFresh$lambda$lambda","CausalitySolver$getSupports$lambda","CausalitySolver$getSupports$lambda$lambda","$graph","CausalitySolver$checkBaseTheory$lambda","CausalitySolver$getSubsets$lambda$lambda","CausalitySolver$getSubsets$lambda$lambda$lambda","CausalitySolver$getSubsets$lambda","clean","string","<get-alias>","<get-baseContent>","capacity","identifier","<get-theoryOperators>"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;kEAmMoCA,CAAA,EAAAA,EAAA;A,IACI,OAAR,EAAG,M;EACP,C;oEAAMA,CALHC,gBAKGD,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAmC,OAAjC,cAAA,EAAG,MAAH,IAAgB,sBAAhB,EAAqB,a;IAAa,C;G;oEAClCF,CAnKpC,M,EAmI2BG,Q,EAGfC,OA6BwBJ,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAqC,OAAnC,uBAAe,QAAf,EAAwB,EAAxB,EAA4B,OAA5B,C;IAAoC,C;G;oEACzCF,CAhCrBK,aAgCqBL,E;oBAAAE,CAAA,EAAAA,EAAA;A,MAAmC,OAApB,2BAAG,aAAH,EAAiB,EAAjB,C;IAAqB,C;G;2DAPtCI,CA1BJH,Q,EAcfI,M,EAZAC,M,EArIZ,M,EAsIYJ,O,EAFAC,aAyBmBC,E;oBAAAN,CAAA,gBAAAA,EAAA;A,gBACP,QACK,OAAM,wDAAyB,MAAzB,EAAgC,SAAO,sBAAP,CAAhC,CAAN,C;kBACA,YAAO,uDAAP,C;kBAEC,WAAI,2EAAJ,C;kBACD,cAAO,oFAAP,C;UALL,iBAOK,YADA,WAAI,wEAAJ,CACA,C;MAAsC,OAP3C,yBAOmC,gCAPnC,iB;IAQJ,C;G;qBA1JRS,CAAA,K,EACJC,C,EACAC,CAFIF,EAGJ;A,IAAsD,OAA3C,+BAAQ,OAAW,8BAAM,CAAN,CAAX,EAA0B,8BAAM,CAAN,CAA1B,C;EAAkC,C;oBAEjDG,CAAA,K,EACJC,C,EACAC,KAFIF,EAIJ;A;eAAA,K,CAAM,K;;sBC6sBM,yB;QA2FA,4B;WAAA,qB,EAAM;A,UAAjBG,UAAW,qB;MAAU,IAAU,ODvyBlB,CAAG,KAAH,CAAU,KAAV,KAAwB,CAAxB,CAA0B,KCuyBlB,C,CAAgC;A,QAAZ,WAAY,GAAI,OAAJ,C;;IAAW,C;;;wBA0rBxD,0BAAa,wBAzrBnB,WAyrBmB,EAAwB,EAAxB,CAAb,C;QAuEA,sBAhwBN,WAgwBM,I;WAAA,uB,EACT;A,UADCC,OAAQ,uB;;mBDviDS,K,CAAM,K;;;;YC4OZ,gC;eAAA,uB,EAAM;A,cAAjBD,YAAW,uB;UAAU,IA4zCI,IDxiDgB,CAAI,KAAJ,CAAa,KAAb,KC4OV,SD5OU,CAA8B,KAA9B,CAAuC,KC4O3D,C;YAAoB,YAAO,S;;;QAAM,C;QAC3D,YAAO,I;;UA1HP,YAAO,S;UDnH4F,YAA7E,cAAiB,SAAjB,C;MCwiDlB,aAAY,GAAI,SAAJ,C;IAAmB,C;IDxiDkE,OCyiD9F,a;EDziD6F,C;qBAE5FE,CAAA,K,EACJJ,C,EACAC,K,EACAI,KAHID,EAKJ;A;IAAI,IAAgB,KAAhB,KAAE,KAAF,E;YACA,W;;;iBAEA,K,CAAM,K;;wBCisBE,yB;UA2FA,4B;aAAA,qB,EAAM;A,YAAjBF,UAAW,qB;QAAU,ID3xBJ,EAAE,KAAF,KC2xBc,OD3xBd,CAAmB,KAAnB,CAA4B,KC2xBxB,IAAU,OD3xB4B,CAAG,KAAH,KAAY,IC2xBlD,C,CAAgC;A,UAAZ,WAAY,GAAI,OAAJ,C;;MAAW,C;kBAC9D,W;;mBD3xBK,iBAAU,CAAV,EAAa,KAAb,C;;0BCuxCK,yB;UAsFD,gC;aAAA,uB,EAAM;A,YAAjBA,YAAW,uB;;qBD52CA,iBC62CS,SD72CT,CAAc,KAAd,EAAwB,KAAxB,C;;4BC8rBA,yB;YA2FA,gC;eAAA,uB,EAAM;A,cAAjBA,YAAW,uB;UAAU,IDxxBI,ECwxBM,SDxxBN,CAAG,KAAH,CAAY,KAAZ,KAA0B,CAA1B,CAA4B,KAA5B,CCwxBJ,C,CAAgC;A,YAAZ,aAAY,GAAI,SAAJ,C;;QAAW,C;;;4BA6fpD,yB;YAsFD,sBAllBT,aAklBS,I;eAAA,uB,EAAM;A,cAAjBA,YAAW,uB;cACZI,OD32C2B,kBC22CN,SD32CM,CAAc,KAAd,EAAwB,KAAxB,EAA+B,YAAQ,CAAR,CAAU,KAAV,CAA/B,C;UC42Cf,OAAZ,aAAY,EAAO,IAAP,C;QAChB,C;YAFIA,SAGG,a;QAFS,OAAZ,aAAY,EAAO,MAAP,C;MAChB,C;YDl3CQ,cCm3CD,aDn3CC,C;;IAOH,U;EAAD,C;qBAEIC,CAAA,K,EACJC,M,EACAC,EAFIF,EAGC;A,IACL,KAAY,CAAP,KAAO,gB;IACZ,KAAY,CAAP,KAAO,cAAoB,+CAAM,EAAG,kBAAwB,IAAxB,CAAT,EAAwC,KAAxC,CAAwC,KAAxC,CAApB,C;cACL,KACF,CADO,KACP,OAAa,uCAAO,cAAP,GAAoB,MAApB,GAA0B,GAA1B,CAAb,C;QADE,iBAGF,YADA,SAAI,wCAAJ,CACA,C;IAHL,OAAO,yBAGe,UAAM,WAAN,EAAmB,WAAnB,EAAgC,WAAhC,CAHf,iB;EAIX,C;sBAGQG,CAAA,K,EACJT,K,EACAO,MAFIE,EAIJ;A,cACK,WADL,KACK,CADC,KACD,C;gBACA,YAAO,iDAAP,C;gBACA,eAAQ,kDAAR,C;IACmB,OAAnB,WAAI,oCAAJ,C;EAAkB,C;0BAEnBC,CAAA,K,EACJC,O,EACAJ,MAFIG,EAGJ;A;aAAA,kBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAnC,C;cACA,mBAAY,EAAZ,EAAgB,MAAhB,C;IACH,OAD+D,OAApC,SAAI,sCAAJ,CAAoC,C;EAChE,C;4BAEQE,CAAA,K,EACJD,O,EACAE,Y,EACAC,O,EACAP,MAJIK,EAKJ;A;iBAAA,YAAa,S;;sBC06CJ,0BAAa,gCAAwB,EAAxB,CAAb,C;QAuEA,oBAvEN,MAuEM,I;WAAA,qB,EACT;A,UADCV,OAAQ,qB;UDj/CsF,YAArD,6BAAU,uCAAO,QAAP,YAAsB,+BAAtB,IAAiC,IAAjC,GCk/C1B,IDl/C0B,cAAuC,GAAvC,CAAV,K;MCk/C1C,WAAY,GAAI,SAAJ,C;IAAmB,C;;;;eDj/C/B,kBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAS,YAAY,qDCk/CrD,WDl/CqD,CAAZ,CAA5C,C,CACQ,K;;wBCmpBI,yB;QA2FA,8B;WAAA,uB,EAAM;A,UAAjBD,UAAW,uB;MAAU,IAAU,OD7uBT,CAAE,KAAF,KAAW,KC6uBZ,IAAU,OD7uBW,CAAE,KAAF,KAAW,KC6uBhC,C,CAAgC;A,QAAZ,aAAY,GAAI,OAAJ,C;;IAAW,C;;;wBA0rBxD,0BAAa,wBAzrBnB,aAyrBmB,EAAwB,EAAxB,CAAb,C;QAuEA,sBAhwBN,aAgwBM,I;WAAA,uB,EACT;A,UADCC,SAAQ,uB;UD7+C0C,YC8+CzB,MD9+CK,CAAT,KAAS,M;MC8+C/B,aAAY,GAAI,SAAJ,C;IAAmB,C;;;;;MA8H/B,gBA7HG,aA6HH,c;cA7HG,aA6HmB,I;;cAAA,K;;MAAtB,Q;QAAiC,YAAO,K;;;UAC5B,sBA9HT,aA8HS,I;aAAA,uB,EAAM;A,YAAjBD,YAAW,uB;;;;;UADZ,gBD3mDoB,OC2mDpB,c;oBD3mDoB,OC2mDE,I;;oBAAA,K;;UAAtB,U;YAAiC,aAAO,K;;;cAC5B,sBD5mDQ,OC4mDR,I;iBAAA,uB,EAAM;A,gBAAjBA,YAAW,uB;YAAU,ID5mD4B,+BAAQ,OC4mD1B,SD5mD0B,EC4mD1B,SD5mD0B,CC4mDpC,C;cAAoB,aAAO,I;;;UAAG,C;UACxD,aAAO,K;;QADmB,ID5mDM,UC4mDN,C;UAAoB,YAAO,I;;;MAAG,C;MACxD,YAAO,K;;ID3mDN,OAFY,S;EAEb,C;qBAEQc,CAAA,K,EACJJ,O,EACAE,YAFIE,EAGJ;A,IAOH,OAPG,WAAW,wDAAX,C;EAOJ,C;yBAKQC,CAAA,K,EACJL,O,EACAE,Y,EACAN,MAHIS,EAIG;A,QACPC,WAAe,uBAAgB,OAAhB,EAAyB,MAAzB,C;IACX,IAAA,QAAS,IAAT,C;MAAoB,OAAO,K;;IACxB,6BAAkB,OAAlB,EAA2B,YAA3B,EAAyC,QAAzC,EAAmD,MAAnD,E;;MAEC,IAAA,YAAa,KAAb,IAAgC,CAAhC,C;gBAAA,I;;mBACI,kBAAW,OAAX,EAAoB,YAApB,C;;;;;UCyjDZ,kC;oBAAsB,Q;;oBAAA,K;;UAAtB,U;YAAiC,YAAO,I;;;cAC5B,4B;iBAAA,qB,EAAM;A,gBAAjBhB,UAAW,qB;YAAU,KD1jD8B,CAAC,yBAAkB,OAAlB,EC0jDpB,OD1jDoB,EAA+B,QAA/B,EAAyC,MAAzC,CC0jD/B,C;cAAqB,YAAO,K;;;UAAI,C;UAC1D,YAAO,I;;gBD3jD2C,S;;;;YADtC,K;;IAFR,U;EAKJ,C;qCAEAiB,C,MAAAA,EAAA;A,IAAA,mB;IAC6B,2BAAU,uBAAV,EAAmC,CAAnC,C;EAD7B,C;qDACaC,CAAAA,EAAA;A,IAAA,iB;EAAY,C;qDAEZC,CAAUT,OAAVS,EAA8E;A,QACnFP,eAA2B,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,a;QAChDN,SAAqB,eAAM,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,WAA3B,C;IAErB,OAAO,WACH,OAAQ,oBAAU,2BAAe,OAAf,EAAwB,YAAxB,EAAsC,MAAtC,CAAV,WADL,C;EAGX,C;wDAzJKI,O;;;8BA4JTO,C,MAAAA,EAAA;A,IAAA,mB;IAC6B,2BAAU,UAAV,EAAsB,CAAtB,C;EAD7B,C;8CACaC,CAAAA,EAAA;A,IAAA,iB;EAAY,C;8CAEZC,CAAUT,OAAVS,EAA8E;A,QACnFP,eAAyB,QAAQ,SAAR,GAAkB,CAAlB,C;QACzBQ,QAAkB,QAAQ,SAAR,GAAkB,CAAlB,C;QAClBd,SAAqB,eAAM,QAAQ,SAAR,GAAkB,CAAlB,CAAqB,WAA3B,C;IAEjB,oC,CAAsB;A,MACtB,MAAgB,6BACZ,OADY,CACJ,OADI,EAEZ,OAFY,CAEJ,SAFI,EAGO,+BAHP,EAIZ,YAJY,C;IAMpB,C;;;iBAIQ,uBAAW,MAAX,EAAmB,OAAgB,CAAR,OAAQ,MAAnC,C,CACK,K;;sBCm2CR,0BAAa,gCAAwB,EAAxB,CAAb,C;QAuEA,oBAvEN,MAuEM,I;WAAA,qB,EACT;A,UADCL,OAAQ,qB;UDz6CwB,YC06CP,ID16CO,CAAP,K;MC06C1B,WAAY,GAAI,SAAJ,C;IAAmB,C;;;wBA71BnB,yB;QA2FA,sBAmwBT,WAnwBS,I;WAAA,uB,EAAM;A,UAAjBD,UAAW,uB;MAAU,IDvqBI,ECuqBM,ODvqBN,KAAM,MAAN,CCuqBJ,C,CAAgC;A,QAAZ,aAAY,GAAI,OAAJ,C;;IAAW,C;QD5qB7DqB,QACS,eAMI,SADA,SCuqBd,aDvqBc,CACA,CANJ,C;IAST,OAAO,WACH,OAAQ,WACJ,WAAW,yGAAX,CADI,WADL,C;EAcX,C;iDArMKX,O;;;4CA8EIY,CARL,MAQKA,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAAgB,OAAP,gBAAP,MAAO,CAAP,KAAO,C;IAAQ,C;G;6CAWdC,CANR,M,EAEJnC,OAIYmC,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAA4C,OAA1C,mBAAW,EAAX,CAAc,KAAd,CAAuB,KAAvB,EAAmC,OAAnC,C;IAA2C,C;G;+CAC5CD,CAPT,M,EACJE,MAMaF,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAA6C,OAA3C,mBAAW,EAAX,CAAc,KAAd,EAAwB,MAAxB,EAA+B,WAA/B,C;IAA4C,C;G;+CAClDD,CAAA,EAAAA,EAAA;A,IAAa,OAAX,EAAW,CAAR,K;EAAS,C;iDAMKG,CAAE,CAAFA,EAAA;A,IAA6B,OAAtB,CAAE,M;EAAqB,C;mDAuB9CC,CAAA,EAAAA,EAAA;A,IACI,OAAR,EAAG,M;EACP,C;qDAAMA,CALC1C,gBAKD0C,E;oBAAAC,CAAA,EAAAA,EAAA;A,MAAmC,OAAjC,cAAA,EAAG,MAAH,IAAgB,sBAAhB,EAAqB,a;IAAa,C;G;4CALnCC,CAFX1C,Q,EACAE,aACWwC,E;oBAAAF,CAAA,gBAAAA,EAAA;A,gBACX,QACK,OAAM,gDAAiB,aAAjB,EAA+B,wBAA/B,CAAN,C;kBACA,YAAO,wCAAP,C;MAGQ,OAAR,OADC,WAAI,4DAAJ,CACD,C;IACT,C;G;0BAhGJX,CAAAA,EAAA;A,cAM2B,I;;QAC2B,kC;IAD3B,4BAC4E,CAAhF,+CAAoE,UAApE,0BAA+B,oBAA/B,CAAgF,OAD5E,C;IAIe,aAAV,0BAAU,M;IAkKjB,oD;IAsDZ,aAFA,0BACA,iBAAoB,0BAApB,CACA,2CAAiB,OAAjB,C;EAlOb,C;0CAGIc,CAAUC,MAAVD,EAA4B;A,IAAwC,OAAhB,QAAjB,QAAP,MAAO,EAAQ,GAAR,EAAa,EAAb,CAAiB,EAAQ,GAAR,EAAa,EAAb,C;EAAe,C;0CAyK1DE,CAAAA,EAAA;A,IAAA,iB;EAAQ,C;0CAGbC,CAAAA,EACI;A;qBAAA,OAAO,uCAA8B,6BAA9B,CAAP,C;;;QCo+BRC,WAAwD,cAAzC,YAAY,wBDj+BE,UCi+BF,EAAwB,EAAxB,CAAZ,CAAyC,EAAc,EAAd,C;;sBACnC,4BAAoB,QAApB,C;QA2BL,oBD7/Ba,UC6/Bb,I;WAAA,qB,EAAM;A,UAAjBnC,UAAW,qB;UD7/BkD,YC8/BlC,OD9/ByB,M;MC8/BrD,WAAY,IAAI,SAAJ,EAA0B,OAA1B,C;IAChB,C;ID39BS,OAtCW,OACI,IADJ,CACS,KADT,ECkgCb,WDlgCa,EAIO,+CA8BC,upBA9BD,EA+BH,IA/BG,CA+BH,KA/BG,CAJP,C;EAsCZ,C;0CAKCoC,CAAAA,EAA2B;A,IAAW,OAAX,W;EAAU,C;0CAErCC,CAAAA,EAAA;A,IAAA,iB;EAAkB,C;;;;;;;;;;"}
package/arg2p-core.js CHANGED
@@ -74,23 +74,23 @@
74
74
  var logicListFromIterable = kotlin_it_unibo_tuprolog_core.$_$.b;
75
75
  var logicListFromSequence = kotlin_it_unibo_tuprolog_core.$_$.c;
76
76
  var copy = kotlin_it_unibo_tuprolog_solve.$_$.g;
77
- var THROW_CCE = kotlin_kotlin.$_$.la;
77
+ var THROW_CCE = kotlin_kotlin.$_$.pa;
78
78
  var mguAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.b;
79
79
  var mguWithOccurCheck = kotlin_it_unibo_tuprolog_unify.$_$.a;
80
80
  var matchAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.a;
81
81
  var unifyAny = kotlin_it_unibo_tuprolog_dsl_unify.$_$.c;
82
82
  var solverOf = kotlin_it_unibo_tuprolog_dsl_solve.$_$.a;
83
- var BaseLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.e;
84
- var LogicProgrammingScopeWithTheories = kotlin_it_unibo_tuprolog_dsl_theory.$_$.h;
85
- var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
86
83
  var Scope = kotlin_it_unibo_tuprolog_core.$_$.r1;
87
- var LogicProgrammingScopeWithResolution = kotlin_it_unibo_tuprolog_dsl_solve.$_$.c;
88
84
  var LogicProgrammingScopeWithUnification = kotlin_it_unibo_tuprolog_dsl_unify.$_$.j;
85
+ var LogicProgrammingScopeWithSubstitutions = kotlin_it_unibo_tuprolog_dsl_core.$_$.o4;
89
86
  var LogicProgrammingScopeWithOperators = kotlin_it_unibo_tuprolog_dsl_core.$_$.w1;
90
87
  var MinimalLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.c5;
91
- var LogicProgrammingScopeWithSubstitutions = kotlin_it_unibo_tuprolog_dsl_core.$_$.o4;
88
+ var LogicProgrammingScopeWithPrologStandardLibrary = kotlin_it_unibo_tuprolog_dsl_core.$_$.h4;
89
+ var BaseLogicProgrammingScope = kotlin_it_unibo_tuprolog_dsl_core.$_$.e;
90
+ var LogicProgrammingScopeWithTheories = kotlin_it_unibo_tuprolog_dsl_theory.$_$.h;
91
+ var LogicProgrammingScopeWithResolution = kotlin_it_unibo_tuprolog_dsl_solve.$_$.c;
92
92
  var Companion_getInstance_0 = kotlin_it_unibo_tuprolog_core.$_$.i;
93
- var lazy = kotlin_kotlin.$_$.ra;
93
+ var lazy = kotlin_kotlin.$_$.va;
94
94
  var KProperty1 = kotlin_kotlin.$_$.g7;
95
95
  var getPropertyCallableRef = kotlin_kotlin.$_$.u5;
96
96
  var CoroutineImpl = kotlin_kotlin.$_$.p4;
@@ -108,11 +108,11 @@
108
108
  var mapCapacity = kotlin_kotlin.$_$.d3;
109
109
  var coerceAtLeast = kotlin_kotlin.$_$.a7;
110
110
  var LinkedHashMap_init_$Create$ = kotlin_kotlin.$_$.e;
111
- var ensureNotNull = kotlin_kotlin.$_$.pa;
111
+ var ensureNotNull = kotlin_kotlin.$_$.ta;
112
112
  var Companion_getInstance_3 = kotlin_it_unibo_tuprolog_core.$_$.v;
113
113
  var Companion_getInstance_4 = kotlin_it_unibo_tuprolog_core.$_$.q;
114
114
  var first = kotlin_kotlin.$_$.v7;
115
- var to = kotlin_kotlin.$_$.ya;
115
+ var to = kotlin_kotlin.$_$.cb;
116
116
  var mutableMapOf = kotlin_kotlin.$_$.n3;
117
117
  var Companion_getInstance_5 = kotlin_it_unibo_tuprolog_solve.$_$.o1;
118
118
  var filter = kotlin_kotlin.$_$.t7;
@@ -143,8 +143,8 @@
143
143
  var mapOf = kotlin_kotlin.$_$.e3;
144
144
  var Yes = kotlin_it_unibo_tuprolog_solve.$_$.v2;
145
145
  var logicProgramming_0 = kotlin_it_unibo_tuprolog_dsl_theory.$_$.i;
146
- var toString_0 = kotlin_kotlin.$_$.xa;
147
- var removeSurrounding = kotlin_kotlin.$_$.i9;
146
+ var toString_0 = kotlin_kotlin.$_$.bb;
147
+ var removeSurrounding = kotlin_kotlin.$_$.l9;
148
148
  var contains = kotlin_kotlin.$_$.c9;
149
149
  var toList = kotlin_kotlin.$_$.u8;
150
150
  var List = kotlin_it_unibo_tuprolog_core.$_$.n1;
@@ -169,9 +169,9 @@
169
169
  var compareBy = kotlin_kotlin.$_$.n4;
170
170
  var sortedWith = kotlin_kotlin.$_$.o8;
171
171
  var mapIndexed = kotlin_kotlin.$_$.e8;
172
- var Pair = kotlin_kotlin.$_$.ja;
172
+ var Pair = kotlin_kotlin.$_$.na;
173
173
  var NoSuchElementException_init_$Create$ = kotlin_kotlin.$_$.x;
174
- var toInt = kotlin_kotlin.$_$.t9;
174
+ var toInt = kotlin_kotlin.$_$.x9;
175
175
  var firstOrNull = kotlin_kotlin.$_$.u7;
176
176
  var IllegalStateException_init_$Create$ = kotlin_kotlin.$_$.t;
177
177
  var Cons = kotlin_it_unibo_tuprolog_core.$_$.i1;
@@ -220,7 +220,7 @@
220
220
  initMetadataForClass(Arg2pSolver$Companion$of$1, VOID, VOID, VOID, [Arg2pSolver]);
221
221
  initMetadataForCompanion(Companion);
222
222
  initMetadataForObject(Arg2pSolverFactory, 'Arg2pSolverFactory');
223
- initMetadataForClass(PrologWithArgumentationImpl, 'PrologWithArgumentationImpl', PrologWithArgumentationImpl, VOID, [BaseLogicProgrammingScope, LogicProgrammingScopeWithTheories, LogicProgrammingScopeWithPrologStandardLibrary, Scope, LogicProgrammingScopeWithResolution, LogicProgrammingScopeWithUnification, LogicProgrammingScopeWithOperators, MinimalLogicProgrammingScope, LogicProgrammingScopeWithSubstitutions]);
223
+ initMetadataForClass(PrologWithArgumentationImpl, 'PrologWithArgumentationImpl', PrologWithArgumentationImpl, VOID, [Scope, LogicProgrammingScopeWithUnification, LogicProgrammingScopeWithSubstitutions, LogicProgrammingScopeWithOperators, MinimalLogicProgrammingScope, LogicProgrammingScopeWithPrologStandardLibrary, BaseLogicProgrammingScope, LogicProgrammingScopeWithTheories, LogicProgrammingScopeWithResolution]);
224
224
  function get_theoryOperators() {
225
225
  return Companion_getInstance_0().DEFAULT;
226
226
  }
@@ -4848,7 +4848,7 @@
4848
4848
  return ArgumentationEngineInterface_instance;
4849
4849
  }
4850
4850
  function ArgumentationGraph() {
4851
- this.y3m_1 = 'buildArgumentationGraph :-\n buildArguments,\n findall(_, buildAdditionalArgument, _),\n buildAttacks.\nbuildAdditionalArgument :-\n metaConflicts,\n conf_arg(A, CArg),\n context_check(clause(conc(A), argument([R, T, C, B, I]))),\n \\+ filter_meta([R, T, C, B, I]),\n saveArgument(a, A, [[mc|R], T, C, B, I]),\n saveSupport(CArg, [[mc|R], T, C, B, I]),\n cloneSupport([R, T, C, B, I], [[mc|R], T, C, B, I]),\n fail.\nbuildAdditionalArgument.\ncloneSupport(Original, New) :-\n findall(_, (\n context_check(support(S, Original)),\n saveSupport(S, New)\n ), _).\nconf_arg([A], Arg) :-\n context_check(clause(conc([conflict(A, _, _)]), argument(Arg))).\nconf_arg([A], Arg) :-\n context_check(clause(conc([conflict(A, _)]), argument(Arg))).\nfilter_meta([Id, _, _, _, _]) :- metaConflicts, member(mc, Id).\nfilter_meta(_) :- \\+ metaConflicts.\nbuildArguments :-\n\tbuildArgumentsFromPremises,\n\tbuildArgumentsFromEmptyRules,\n\tfindall([RuleID, RuleBody, RuleHead], (\n\t parser::classic_rule(RuleID, RuleBody, RuleHead),\n\t \\+ emptyRule([RuleID, RuleBody, RuleHead])\n ), Rules),\n findall(X, context_check(newConc(a, [X])), N),\n\tbuildArgumentsFromRules(N, b, Rules, Rules, n).\nbuildArgumentsFromPremises :-\n findall(\n _,\n (\n parser::classic_rule(PremiseID, Premise),\n checkStrict(PremiseID, DefPrem),\n saveArgument(a, Premise, [[PremiseID], none, Premise, [], [[], [], DefPrem]])\n ),\n _\n ).\nbuildArgumentsFromEmptyRules :-\n findall(\n _,\n (\n emptyRule([RuleID, RulePrem, RuleHead]),\n checkStrict(RuleID, DefRule),\n saveArgument(a, RuleHead, [[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])\n ),\n _\n ).\nemptyRule([RuleID, Body, RuleHead]) :-\n parser::classic_rule(RuleID, Body, RuleHead),\n \\+ (member(X, Body), X \\= ~(_), X \\= prolog(_)),\n ruleBodyIsSupported(RuleID, RuleHead, Body, Body, [[], [], [], []], _).\ncheckStrict(Id, []) :- parser::check_strict(Id), !.\ncheckStrict(Id, [Id]).\nbuildArgumentsFromRules(_, _, Rules, [], n) :- !.\nbuildArgumentsFromRules(_, Tn, Rules, [], y) :- !, clean(Tn, Rules).\nbuildArgumentsFromRules(N, Tn, Rules, [[Id, Body, Conc]|T], _) :-\n utils::contains_any(Body, N),\n findall(true, buildArgumentsFromRule(Tn, [Id, Body, Conc]), R),\n R \\== [],\n buildArgumentsFromRules(N, Tn, Rules, T, y), !.\nbuildArgumentsFromRules(N, Tn, Rules, [_|T], X) :-\n buildArgumentsFromRules(N, Tn, Rules, T, X).\nbuildArgumentsFromRule(Tn, [RuleID, RuleBody, RuleHead]) :-\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, RuleBody, [[], [], [], []], Argument),\n\tsaveArgument(Tn, RuleHead, Argument).\nclean(Tn, Rules) :-\n invert(Tn, Tx),\n context_retract(newConc(Tx, _)),\n findall(X, context_check(newConc(Tn, [X])), N),\n buildArgumentsFromRules(N, Tx, Rules, Rules, n).\ninvert(a, b).\ninvert(b, a).\ndefRules(Id, Def, Def) :- parser::check_strict(Id), !.\ndefRules(Id, Def, [Id|Def]).\nlastDefRules(Id, LDef, LDef) :- parser::check_strict(Id), !.\nlastDefRules(Id, LDef, [Id]) :- Id \\== none, \\+ parser::check_strict(Id).\nargumentInfo(RuleId, LDef, Def, Prem, [FLDef, FDef, FPrem]) :-\n utils::sortDistinct(Prem, FPrem),\n defRules(RuleId, Def, NDef),\n utils::sortDistinct(NDef, FDef),\n lastDefRules(RuleId, LDef, NLDef),\n utils::sortDistinct(NLDef, FLDef).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [], [TAll, TLDef, TDef, TPrem], Argument) :-\n utils::appendLists(TAll, All),\n \\+ utils::contains(RuleID, All),\n utils::appendLists(TLDef, LDef),\n utils::appendLists(TDef, Def),\n utils::appendLists(TPrem, Prem),\n argumentInfo(RuleID, LDef, Def, Prem, Info),\n utils::sort([RuleID|All], Rules),\n Argument = [Rules, RuleID, RuleHead, RuleBody, Info],\n \\+ context_check(clause(conc(RuleHead), argument(Argument))).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [~(_)|Others], Info, Argument) :-\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [prolog(Check)|Others], Info, Argument) :-\n\t(callable(Check) -> call(Check); Check),\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\nruleBodyIsSupported(RuleId, RuleHead, RuleBody, [Statement|Others], [All, LDef, Def, Prem], Argument) :-\n context_check(clause(conc([Statement]), argument([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]]))),\n\truleBodyIsSupported(RuleId, RuleHead, RuleBody, Others, [[ArgumentID|All], [NLDef|LDef], [NDef|Def], [NPrem|Prem]], Argument),\n\tsaveSupport([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]], Argument).\nbuildAttacks :-\n\tfindall(_, buildDirectAttack, _).\nbuildDirectAttack :-\n context_check(argument(A)),\n attack::findPossibleAttackers(A, BB),\n\tcontext_check(clause(conc(BB), argument(B))),\n\tfilter_meta(B),\n\tA \\== B,\n attack::attacks(T, B, A),\n saveAttack(T, B, A, A),\n findall(_, (\n expanded_support(A, C),\n saveAttack(T, B, C, A)\n ),_),\n\tfail.\nbuildDirectAttack.\nexpanded_support(A, B) :-\n context_check(support(A, B)).\nexpanded_support(A, C) :-\n context_check(support(A, B)),\n expanded_support(B, C).\nsaveArgument(T, Conclusion, Argument) :-\n \\+ context_check(clause(conc(Conclusion), argument(Argument))),\n context_assert(newConc(T, Conclusion)),\n utils::hash(argument(Argument), Id),\n context_assert(argument(Argument)),\n context_assert(conc(Conclusion) :- argument(Argument)),\n context_assert(arg(Id) :- argument(Argument)).\nsaveAttack(T, A, C, D) :-\n \\+ context_check(attack(T, A, C, D)),\n context_assert(attack(T, A, C, D)),\n utils::hash(argument(A), IdA),\n utils::hash(argument(C), IdC),\n context_assert(att(IdA, IdC) :- attack(T, A, C, D)).\nsaveSupport(A, B) :-\n \\+ context_check(support(A, B)),\n context_assert(support(A, B)).\nremoveAttack(T, A, B, C) :-\n context_retract(attack(T, A, B, C)),\n utils::hash(argument(A), IdA),\n utils::hash(argument(B), IdB),\n context_retract(att(IdA, IdB) :- attack(T, A, B, C)).';
4851
+ this.y3m_1 = 'buildArgumentationGraph :-\n buildArguments,\n findall(_, buildAdditionalArgument, _),\n buildAttacks.\nbuildAdditionalArgument :-\n metaConflicts,\n conf_arg(A, CArg),\n context_check(clause(conc(A), argument([R, T, C, B, I]))),\n \\+ filter_meta([R, T, C, B, I]),\n saveArgument(a, A, [[mc|R], T, C, B, I]),\n saveSupport(CArg, [[mc|R], T, C, B, I]),\n cloneSupport([R, T, C, B, I], [[mc|R], T, C, B, I]),\n fail.\nbuildAdditionalArgument.\ncloneSupport(Original, New) :-\n findall(_, (\n context_check(support(S, Original)),\n saveSupport(S, New)\n ), _).\nconf_arg([A], Arg) :-\n context_check(clause(conc([conflict(A, _, _)]), argument(Arg))).\nconf_arg([A], Arg) :-\n context_check(clause(conc([conflict(A, _)]), argument(Arg))).\nfilter_meta([Id, _, _, _, _]) :- metaConflicts, member(mc, Id).\nfilter_meta(_) :- \\+ metaConflicts.\nbuildArguments :-\n\tbuildArgumentsFromPremises,\n\tbuildArgumentsFromEmptyRules,\n\tfindall([RuleID, RuleBody, RuleHead], (\n\t parser::classic_rule(RuleID, RuleBody, RuleHead),\n\t \\+ emptyRule([RuleID, RuleBody, RuleHead])\n ), Rules),\n findall(X, context_check(newConc(a, [X])), N),\n\tbuildArgumentsFromRules(N, b, Rules, Rules, n).\nbuildArgumentsFromPremises :-\n findall(\n _,\n (\n parser::classic_rule(PremiseID, Premise),\n checkStrict(PremiseID, DefPrem),\n saveArgument(a, Premise, [[PremiseID], none, Premise, [], [[], [], DefPrem]])\n ),\n _\n ).\nbuildArgumentsFromEmptyRules :-\n findall(\n _,\n (\n emptyRule([RuleID, RulePrem, RuleHead]),\n ruleBodyIsSupported(RuleID, RuleHead, RulePrem, RulePrem, [[], [], [], []], _),\n checkStrict(RuleID, DefRule),\n saveArgument(a, RuleHead, [[RuleID], RuleID, RuleHead, RulePrem, [DefRule, DefRule, []]])\n ),\n _\n ).\nemptyRule([RuleID, Body, RuleHead]) :-\n parser::classic_rule(RuleID, Body, RuleHead),\n \\+ (member(X, Body), X \\= ~(_), X \\= prolog(_)).\ncheckStrict(Id, []) :- parser::check_strict(Id), !.\ncheckStrict(Id, [Id]).\nbuildArgumentsFromRules(_, _, Rules, [], n) :- !.\nbuildArgumentsFromRules(_, Tn, Rules, [], y) :- !, clean(Tn, Rules).\nbuildArgumentsFromRules(N, Tn, Rules, [[Id, Body, Conc]|T], _) :-\n utils::contains_any(Body, N),\n findall(true, buildArgumentsFromRule(Tn, [Id, Body, Conc]), R),\n R \\== [],\n buildArgumentsFromRules(N, Tn, Rules, T, y), !.\nbuildArgumentsFromRules(N, Tn, Rules, [_|T], X) :-\n buildArgumentsFromRules(N, Tn, Rules, T, X).\nbuildArgumentsFromRule(Tn, [RuleID, RuleBody, RuleHead]) :-\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, RuleBody, [[], [], [], []], Argument),\n\tsaveArgument(Tn, RuleHead, Argument).\nclean(Tn, Rules) :-\n invert(Tn, Tx),\n context_retract(newConc(Tx, _)),\n findall(X, context_check(newConc(Tn, [X])), N),\n buildArgumentsFromRules(N, Tx, Rules, Rules, n).\ninvert(a, b).\ninvert(b, a).\ndefRules(Id, Def, Def) :- parser::check_strict(Id), !.\ndefRules(Id, Def, [Id|Def]).\nlastDefRules(Id, LDef, LDef) :- parser::check_strict(Id), !.\nlastDefRules(Id, LDef, [Id]) :- Id \\== none, \\+ parser::check_strict(Id).\nargumentInfo(RuleId, LDef, Def, Prem, [FLDef, FDef, FPrem]) :-\n utils::sortDistinct(Prem, FPrem),\n defRules(RuleId, Def, NDef),\n utils::sortDistinct(NDef, FDef),\n lastDefRules(RuleId, LDef, NLDef),\n utils::sortDistinct(NLDef, FLDef).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [], [TAll, TLDef, TDef, TPrem], Argument) :-\n utils::appendLists(TAll, All),\n \\+ utils::contains(RuleID, All),\n utils::appendLists(TLDef, LDef),\n utils::appendLists(TDef, Def),\n utils::appendLists(TPrem, Prem),\n argumentInfo(RuleID, LDef, Def, Prem, Info),\n utils::sort([RuleID|All], Rules),\n Argument = [Rules, RuleID, RuleHead, RuleBody, Info],\n \\+ context_check(clause(conc(RuleHead), argument(Argument))).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [~(_)|Others], Info, Argument) :-\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\nruleBodyIsSupported(RuleID, RuleHead, RuleBody, [prolog(Check)|Others], Info, Argument) :-\n\t(callable(Check) -> call(Check); Check),\n\truleBodyIsSupported(RuleID, RuleHead, RuleBody, Others, Info, Argument).\nruleBodyIsSupported(RuleId, RuleHead, RuleBody, [Statement|Others], [All, LDef, Def, Prem], Argument) :-\n context_check(clause(conc([Statement]), argument([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]]))),\n\truleBodyIsSupported(RuleId, RuleHead, RuleBody, Others, [[ArgumentID|All], [NLDef|LDef], [NDef|Def], [NPrem|Prem]], Argument),\n\tsaveSupport([ArgumentID, RuleID, [Statement], Body, [NLDef, NDef, NPrem]], Argument).\nbuildAttacks :-\n\tfindall(_, buildDirectAttack, _).\nbuildDirectAttack :-\n context_check(argument(A)),\n attack::findPossibleAttackers(A, BB),\n\tcontext_check(clause(conc(BB), argument(B))),\n\tfilter_meta(B),\n\tA \\== B,\n attack::attacks(T, B, A),\n saveAttack(T, B, A, A),\n buildTransitiveAttacks(T, B, A),\n\tfail.\nbuildDirectAttack.\nbuildTransitiveAttacks(T, B, A) :-\n findall(_, (\n expanded_support(A, C),\n saveAttack(T, B, C, A)\n ),_).\nexpanded_support(A, B) :-\n context_check(support(A, B)).\nexpanded_support(A, C) :-\n context_check(support(A, B)),\n expanded_support(B, C).\nsaveArgument(T, Conclusion, Argument) :-\n \\+ context_check(clause(conc(Conclusion), argument(Argument))),\n context_assert(newConc(T, Conclusion)),\n utils::hash(argument(Argument), Id),\n context_assert(argument(Argument)),\n context_assert(conc(Conclusion) :- argument(Argument)),\n context_assert(arg(Id) :- argument(Argument)).\nsaveAttack(T, A, C, D) :-\n \\+ context_check(attack(T, A, C, D)),\n context_assert(attack(T, A, C, D)),\n utils::hash(argument(A), IdA),\n utils::hash(argument(C), IdC),\n context_assert(att(IdA, IdC) :- attack(T, A, C, D)).\nsaveSupport(A, B) :-\n \\+ context_check(support(A, B)),\n context_assert(support(A, B)).\nremoveAttack(T, A, B, C) :-\n context_retract(attack(T, A, B, C)),\n utils::hash(argument(A), IdA),\n utils::hash(argument(B), IdB),\n context_retract(att(IdA, IdB) :- attack(T, A, B, C)).';
4852
4852
  }
4853
4853
  var ArgumentationGraph_instance;
4854
4854
  function ArgumentationGraph_getInstance() {
@@ -4911,14 +4911,14 @@
4911
4911
  return Debug_instance;
4912
4912
  }
4913
4913
  function DefPreferences() {
4914
- this.k3n_1 = 'modifyArgumentationGraph :-\n assertAllSup,\n findall((T, A, B, C), context_check(attack(T, A, B, C)), Attacks),\n filterSupRelatedAttacks(Attacks, InvalidAttacks),\n convertAttacks(InvalidAttacks),\n buildPrefAttacks.\nassertAllSup :-\n context_retract(sup(_, _)),\n findall(_,\n (\n context_check(argument([_, _, [sup(RuleOne, RuleTwo)], _, _])),\n \\+ context_check(sup(RuleOne, RuleTwo)),\n context_assert(sup(RuleOne, RuleTwo))\n ),\n _).\nfilterSupRelatedAttacks([], []).\nfilterSupRelatedAttacks([(T, A, B, C)|Attacks], [(T, A, B, C)|Invalid]) :-\n invalid(T, A, B, C, _),\n filterSupRelatedAttacks(Attacks, Invalid), !.\nfilterSupRelatedAttacks([_|Attacks], Invalid) :-\n filterSupRelatedAttacks(Attacks, Invalid).\ninvalid(rebut, A, B, C, SupSet) :- superiority::superiorArgument(C, A, SupSet), !.\ninvalid(undermine, A, B, C, SupSet) :- superiority::superiorArgument(C, A, SupSet), !.\n/*\n* Translates the attack relations identified during the building phase.\n* Attack from A to B -> Argument [[], attack, Attack]\n* support(A, Argument)\n* attack(Argument, B)\n* If an Argument A built in this way attacks the argument B, and this one also attacks a third argument C\n* through the argument B1 we have to consider an attack from A to B1 (transitive attack)\n*/\nconvertAttacks(Attacks) :-\n conversion(Attacks),\n standard_af::buildTransitiveAttacks.\nconversion(List) :-\n member((T, A, B, B), List),\n generateDirectAttackArgument(T, A, B, B),\n fail.\nconversion(List) :-\n member((T, A, B, C), List),\n C \\= B,\n generateTransitiveAttackArgument(T, A, B, C),\n fail.\nconversion(_).\ngenerateTransitiveAttackArgument(T, A, B, C) :-\n context_check(argument([Id, attack, [attack(T, A, C, C)], G, I])),\n standard_af::saveAttack(T, [Id, attack, [attack(T, A, C, C)], G, I], B, C),\n standard_af::removeAttack(T, A, B, C).\ngenerateDirectAttackArgument(T, A, B, B) :-\n RArgument = [[attack], attack, [attack(T, A, B, B)], [], [[attack], [attack], []]],\n standard_af::saveArgument(a, [attack(T, A, B, B)], RArgument),\n standard_af::saveSupport(A, RArgument),\n standard_af::saveAttack(T, RArgument, B, B),\n standard_af::removeAttack(T, A, B, B).\n/*\n* Computes the pref attack. If an Argument A has a conclusion in the form sup(a, b), we verify if\n* the attacks involving arguments built on the rules a or b are compatible with this preference.\n* If there are some contradictions we add an attack from the argument A towards the incompatible attack\n*/\nbuildPrefAttacks :-\n context_check(argument([IdB, attack, [attack(T, A, B, C)], G, I])),\n invalid(T, A, B, C, SupSet),\n member(X, SupSet),\n context_check(argument([IdA, TRA, [X], GG, II])),\n standard_af::saveAttack(pref, [IdA, TRA, [X], GG, II], [IdB, attack, [attack(T, A, B, C)], G, I], [IdB, attack, [attack(T, A, B, C)], G, I]),\n fail.\nbuildPrefAttacks.';
4914
+ this.k3n_1 = 'modifyArgumentationGraph :-\n assertAllSup,\n findall((T, A, B, C), context_check(attack(T, A, B, C)), Attacks),\n filterSupRelatedAttacks(Attacks, InvalidAttacks),\n convertAttacks(InvalidAttacks),\n buildPrefAttacks.\nassertAllSup :-\n context_retract(sup(_, _)),\n findall(_,\n (\n context_check(argument([_, _, [sup(RuleOne, RuleTwo)], _, _])),\n \\+ context_check(sup(RuleOne, RuleTwo)),\n context_assert(sup(RuleOne, RuleTwo))\n ),\n _).\nfilterSupRelatedAttacks([], []).\nfilterSupRelatedAttacks([(T, A, B, C)|Attacks], [(T, A, B, C)|Invalid]) :-\n invalid(T, A, B, C, _),\n filterSupRelatedAttacks(Attacks, Invalid), !.\nfilterSupRelatedAttacks([_|Attacks], Invalid) :-\n filterSupRelatedAttacks(Attacks, Invalid).\ninvalid(rebut, A, B, C, SupSet) :- superiority::superiorArgument(C, A, SupSet), !.\ninvalid(undermine, A, B, C, SupSet) :- superiority::superiorArgument(C, A, SupSet), !.\n/*\n* Translates the attack relations identified during the building phase.\n* Attack from A to B -> Argument [[], attack, Attack]\n* support(A, Argument)\n* attack(Argument, B)\n* If an Argument A built in this way attacks the argument B, and this one also attacks a third argument C\n* through the argument B1 we have to consider an attack from A to B1 (transitive attack)\n*/\nconvertAttacks(Attacks) :-\n conversion(Attacks).\nconversion(List) :-\n member((T, A, B, B), List),\n generateDirectAttackArgument(T, A, B, B),\n fail.\nconversion(List) :-\n member((T, A, B, C), List),\n C \\= B,\n generateTransitiveAttackArgument(T, A, B, C),\n fail.\nconversion(_).\ngenerateTransitiveAttackArgument(T, A, B, C) :-\n context_check(argument([Id, attack, [attack(T, A, C, C)], G, I])),\n standard_af::saveAttack(T, [Id, attack, [attack(T, A, C, C)], G, I], B, C),\n standard_af::removeAttack(T, A, B, C).\ngenerateDirectAttackArgument(T, A, B, B) :-\n RArgument = [[attack], attack, [attack(T, A, B, B)], [], [[attack], [attack], []]],\n standard_af::saveArgument(a, [attack(T, A, B, B)], RArgument),\n standard_af::saveSupport(A, RArgument),\n findall(_, (\n context_check(attack(X, Y, A, Z)),\n standard_af::saveAttack(X, Y, RArgument, Z)\n ), _),\n standard_af::saveAttack(T, RArgument, B, B),\n standard_af::removeAttack(T, A, B, B).\n/*\n* Computes the pref attack. If an Argument A has a conclusion in the form sup(a, b), we verify if\n* the attacks involving arguments built on the rules a or b are compatible with this preference.\n* If there are some contradictions we add an attack from the argument A towards the incompatible attack\n*/\nbuildPrefAttacks :-\n context_check(argument([IdB, attack, [attack(T, A, B, C)], G, I])),\n invalid(T, A, B, C, SupSet),\n member(X, SupSet),\n context_check(argument([IdA, TRA, [X], GG, II])),\n standard_af::saveAttack(pref, [IdA, TRA, [X], GG, II], [IdB, attack, [attack(T, A, B, C)], G, I], [IdB, attack, [attack(T, A, B, C)], G, I]),\n standard_af::buildTransitiveAttacks(pref, [IdA, TRA, [X], GG, II], [IdB, attack, [attack(T, A, B, C)], G, I]),\n fail.\nbuildPrefAttacks.';
4915
4915
  }
4916
4916
  var DefPreferences_instance;
4917
4917
  function DefPreferences_getInstance() {
4918
4918
  return DefPreferences_instance;
4919
4919
  }
4920
4920
  function GenericDefPreferences() {
4921
- this.o3n_1 = 'modifyArgumentationGraph :-\n defeasiblePref::assertAllSup,\n findall((T, A, B, C), context_check(attack(T, A, B, C)), Attacks),\n defeasiblePref::filterSupRelatedAttacks(Attacks, InvalidAttacks),\n defeasiblePref::convertAttacks(InvalidAttacks),\n buildPrefAttacks,\n standard_af::buildTransitiveAttacks.\nbuildPrefAttacks :-\n context_check(argument([IdB, attack, [attack(T, A, B, C)], G, I])),\n defeasiblePref::invalid(T, A, B, C, SupSet),\n createSuperiorityArgument(SupSet, Arg),\n standard_af::saveAttack(pref, Arg, [IdB, attack, [attack(T, A, B, C)], G, I], [IdB, attack, [attack(T, A, B, C)], G, I]),\n fail.\nbuildPrefAttacks.\ncreateSuperiorityArgument(SupSet, Argument) :-\n findall([Id, TR, [X], G, I], (\n member(X, SupSet),\n context_check(argument([Id, TR, [X], G, I]))\n ), SupportArguments),\n mergeIds(SupportArguments, MergedId),\n Argument = [MergedId, pref, [preference(SupSet)], [], [[pref], MergedId, []]],\n standard_af::saveArgument(a, [preference(SupSet)], Argument),\n findall(_, (\n member(A, SupportArguments),\n standard_af::saveSupport(A, Argument)\n ), _).\nmergeIds([], [pref]).\nmergeIds(Arguments, [pref|MergedId]) :-\n findall(Id, member([Id, _, _, _, _], Arguments), Res),\n utils::appendLists(Res, MergedId).';
4921
+ this.o3n_1 = 'modifyArgumentationGraph :-\n defeasiblePref::assertAllSup,\n findall((T, A, B, C), context_check(attack(T, A, B, C)), Attacks),\n defeasiblePref::filterSupRelatedAttacks(Attacks, InvalidAttacks),\n defeasiblePref::convertAttacks(InvalidAttacks),\n buildPrefAttacks.\nbuildPrefAttacks :-\n context_check(argument([IdB, attack, [attack(T, A, B, C)], G, I])),\n defeasiblePref::invalid(T, A, B, C, SupSet),\n createSuperiorityArgument(SupSet, Arg),\n standard_af::saveAttack(pref, Arg, [IdB, attack, [attack(T, A, B, C)], G, I], [IdB, attack, [attack(T, A, B, C)], G, I]),\n standard_af::buildTransitiveAttacks(pref, Arg, [IdB, attack, [attack(T, A, B, C)], G, I]),\n fail.\nbuildPrefAttacks.\ncreateSuperiorityArgument(SupSet, Argument) :-\n findall([Id, TR, [X], G, I], (\n member(X, SupSet),\n context_check(argument([Id, TR, [X], G, I]))\n ), SupportArguments),\n mergeIds(SupportArguments, MergedId),\n Argument = [MergedId, pref, [preference(SupSet)], [], [[pref], MergedId, []]],\n standard_af::saveArgument(a, [preference(SupSet)], Argument),\n findall(_, (\n member(A, SupportArguments),\n standard_af::saveSupport(A, Argument),\n findall(_, (\n context_check(attack(X, Y, A, Z)),\n standard_af::saveAttack(X, Y, Argument, Z)\n ), _)\n ), _).\nmergeIds([], [pref]).\nmergeIds(Arguments, [pref|MergedId]) :-\n findall(Id, member([Id, _, _, _, _], Arguments), Res),\n utils::appendLists(Res, MergedId).';
4922
4922
  }
4923
4923
  var GenericDefPreferences_instance;
4924
4924
  function GenericDefPreferences_getInstance() {