@tuprolog/arg2p-core 0.16.2 → 0.16.4

package/2p-io-lib.js

@@ -0,0 +1,15 @@
+(function (factory) {
+  if (typeof define === 'function' && define.amd)
+    define(['exports'], factory);
+  else if (typeof exports === 'object')
+    factory(module.exports);
+  else
+    globalThis['2p-io-lib'] = factory(typeof globalThis['2p-io-lib'] === 'undefined' ? {} : globalThis['2p-io-lib']);
+}(function (_) {
+  'use strict';
+  //region block: pre-declaration
+  //endregion
+  return _;
+}));
+
+//# sourceMappingURL=2p-io-lib.js.map

package/2p-io-lib.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":[],"sourcesContent":[],"ignoreList":[],"x_google_ignoreList":[],"names":[],"mappings":";;;;;;;;;;;;;"}

package/README.md

@@ -5,6 +5,50 @@ Built on top of the [tuProlog](https://apice.unibo.it/xwiki/bin/view/Tuprolog/)
 
 More details are available on the [official wiki](https://tuprolog.github.io/arg2p-kt/).
 
+## References
+
+Arg2P is described in:
+
+- Roberta Calegari, Andrea Omicini, Giuseppe Pisano, Giovanni Sartor.
+  **Arg2P: an argumentation framework for explainable intelligent systems.**
+  _Journal of Logic and Computation_, 32(2):369–401, 2022.
+  [doi:10.1093/logcom/exab089](https://doi.org/10.1093/logcom/exab089)
+- Giuseppe Pisano.
+  **Argumentation for legal reasoning: meta-models, technology and beyond.**
+  PhD thesis, Alma Mater Studiorum — Università di Bologna, 2024.
+  [doi:10.48676/unibo/amsdottorato/11671](https://doi.org/10.48676/unibo/amsdottorato/11671)
+
+Individual features — burden of persuasion, defeasible preferences, modularity, causality, distributed
+reasoning — have their own papers, listed on the
+[References](https://tuprolog.github.io/arg2p-kt/docs/references/) page of the wiki.
+
+### Cite me
+
+If you use Arg2P in academic work, please cite:
+
+```bibtex
+@article{arg2p,
+  author  = {Calegari, Roberta and Omicini, Andrea and Pisano, Giuseppe and Sartor, Giovanni},
+  title   = {{Arg2P}: an argumentation framework for explainable intelligent systems},
+  journal = {Journal of Logic and Computation},
+  volume  = {32},
+  number  = {2},
+  pages   = {369--401},
+  year    = {2022},
+  doi     = {10.1093/logcom/exab089}
+}
+```
+
+```bibtex
+@phdthesis{pisano2024argumentation,
+  author  = {Pisano, Giuseppe},
+  title   = {Argumentation for legal reasoning: meta-models, technology and beyond},
+  school  = {Alma Mater Studiorum --- Universit\`a di Bologna},
+  year    = {2024},
+  doi     = {10.48676/unibo/amsdottorato/11671}
+}
+```
+
 ---
 
 ## Getting Started
@@ -13,14 +57,15 @@ Arg2p is available as a [2P-Kt](https://github.com/tuProlog/2p-kt/) library.
 
 #### JVM Library - Gradle
 
-To import the Arg2p module (version `ARG2P_VERSION`) into your Kotlin-based Gradle project, declare the dependency in your `build.gradle(.kts)` file:
+To import the Arg2p module into your Kotlin-based Gradle project, declare the dependency in your `build.gradle(.kts)` file
+(the version below is the latest release, see the [releases page](https://github.com/tuProlog/arg2p-kt/releases/latest)):
  ```kotlin
 repositories {
     mavenCentral()
 }
 
 dependencies {
-    implementation("it.unibo.tuprolog.argumentation:arg2p-jvm:ARG2P_VERSION")
+    implementation("it.unibo.tuprolog.argumentation:arg2p-jvm:0.16.2")
 }
  ```
 
@@ -52,7 +97,7 @@ To use the library, add the dependency to your `package.json`:
 ```json
 {
   "dependencies": {
-    "@tuprolog/arg2p": "ARG2P_VERSION"
+    "@tuprolog/arg2p": "0.16.2"
   }
 }
 ```
@@ -62,12 +107,12 @@ To use the library, add the dependency to your `package.json`:
 ```js
 const arg2p = require('@tuprolog/arg2p').it.unibo.tuprolog.argumentation.bridge.JsBridge
 
-const graph = arg2p.solve('buildLabelSets', `
+const graph = arg2p.solve('arg2p::solve', `
     f1 :=> d.
     f2 :=> -d.`, `
     graphBuildMode(standard_af).
     statementLabellingMode(statement).
-    argumentLabellingMode(grounded_hash).
+    argumentLabellingMode(grounded).
     orderingPrinciple(last).
     orderingComparator(elitist).
     graphExtension(standardPref).
@@ -91,14 +136,14 @@ GitHub repository](https://github.com/tuProlog/arg2p-kt/releases/latest).
 
 In the [latest release](https://github.com/tuProlog/arg2p-kt/releases/latest) page, download the _Asset_ named:
 ```
-arg2p-ide-ARG2P_VERSION-redist.jar
+arg2p-ide-<VERSION>-redist.jar
 ```
-a self-contained, executable Jar containing the 2P-Kt-based Prolog interpreter (`ARG2P_VERSION` will vary depending on the
-actual release version).
+a self-contained, executable Jar containing the 2P-Kt-based Prolog interpreter (`<VERSION>` is the release
+version, `0.16.2` at the time of writing).
 
-After you download the `arg2p-ide-ARG2P_VERSION-redist.jar`, you can simply launch it by running:
+After you download the jar, you can simply launch it by running:
 ```bash
-java -jar arg2p-ide-ARG2P_VERSION-redist.jar
+java -jar arg2p-ide-0.16.2-redist.jar
 ```
 If your JVM is properly configured, you can also start the IDE by double-clicking the JAR file.
 
@@ -111,7 +156,7 @@ If your JVM is properly configured, you can also start the IDE by double-clickin
 ### Additional Tabs
 
 - **Graph Tab:** Displays a graphical representation of the abstract argumentation graph.
-- **Arg Flag Tab:** Shows and allows modification of Arg2P flags. Detailed descriptions are on the [official wiki](https://pika-lab.gitlab.io/argumentation/arg2p-kt/wiki/predicate).
+- **Arg Flag Tab:** Shows and allows modification of Arg2P flags. Detailed descriptions are on the [Flags Reference](https://tuprolog.github.io/arg2p-kt/docs/flags/) page of the wiki.
 
 ---
 
@@ -121,7 +166,9 @@ Try Arg2P directly in your browser using the [Web Playground](https://tuprolog.g
 
 ![Web Playground](./imgs/playground.png)
 
-It functions the same as the Java IDE, offering an interactive experience without installation.
+No installation required. It runs in two modes: **Structured**, to write a theory and query it as in the
+desktop IDE, and **Abstract**, to draw an argumentation framework and evaluate it with `abstract::solve/5`
+under any of the supported semantics. It ships ready-made examples, and setups can be shared as a link.
 
 ---
 

package/kotlin-kotlin-stdlib.js

@@ -214,9 +214,9 @@ if (typeof String.prototype.startsWith === 'undefined') {
   initMetadataForClass(ClassCastException, 'ClassCastException', ClassCastException_init_$Create$, RuntimeException);
   initMetadataForClass(NullPointerException, 'NullPointerException', NullPointerException_init_$Create$, RuntimeException);
   initMetadataForClass(NumberFormatException, 'NumberFormatException', NumberFormatException_init_$Create$, IllegalArgumentException);
-  initMetadataForClass(ArithmeticException, 'ArithmeticException', ArithmeticException_init_$Create$, RuntimeException);
   initMetadataForClass(Error_0, 'Error', Error_init_$Create$, Error);
   initMetadataForClass(AssertionError, 'AssertionError', AssertionError_init_$Create$, Error_0);
+  initMetadataForClass(ArithmeticException, 'ArithmeticException', ArithmeticException_init_$Create$, RuntimeException);
   initMetadataForClass(UninitializedPropertyAccessException, 'UninitializedPropertyAccessException', UninitializedPropertyAccessException_init_$Create$, RuntimeException);
   initMetadataForClass(ConcurrentModificationException, 'ConcurrentModificationException', ConcurrentModificationException_init_$Create$, RuntimeException);
   initMetadataForClass(NoWhenBranchMatchedException, 'NoWhenBranchMatchedException', NoWhenBranchMatchedException_init_$Create$, RuntimeException);
@@ -391,12 +391,12 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function sliceArray(_this__u8e3s4, indices) {
     if (indices.g()) {
       // Inline function 'kotlin.collections.copyOfRange' call
-      return copyOfRange_0(_this__u8e3s4, 0, 0);
+      return copyOfRange(_this__u8e3s4, 0, 0);
     }
     var tmp2 = indices.h();
     // Inline function 'kotlin.collections.copyOfRange' call
     var toIndex = indices.i() + 1 | 0;
-    return copyOfRange_0(_this__u8e3s4, tmp2, toIndex);
+    return copyOfRange(_this__u8e3s4, tmp2, toIndex);
   }
   function requireNoNulls(_this__u8e3s4) {
     var inductionVariable = 0;
@@ -1674,44 +1674,44 @@ if (typeof String.prototype.startsWith === 'undefined') {
     }
     return tmp;
   }
-  function contentEqualsInternal(_this__u8e3s4, other) {
+  function contentHashCodeInternal(_this__u8e3s4) {
     // Inline function 'kotlin.js.asDynamic' call
     var a = _this__u8e3s4;
-    // Inline function 'kotlin.js.asDynamic' call
-    var b = other;
-    if (a === b)
-      return true;
-    if (a == null || b == null || !isArrayish(b) || a.length != b.length)
-      return false;
+    if (a == null)
+      return 0;
+    var result = 1;
     var inductionVariable = 0;
     var last = a.length;
     if (inductionVariable < last)
       do {
         var i = inductionVariable;
         inductionVariable = inductionVariable + 1 | 0;
-        if (!equals(a[i], b[i])) {
-          return false;
-        }
+        result = imul(result, 31) + hashCode(a[i]) | 0;
       }
        while (inductionVariable < last);
-    return true;
+    return result;
   }
-  function contentHashCodeInternal(_this__u8e3s4) {
+  function contentEqualsInternal(_this__u8e3s4, other) {
     // Inline function 'kotlin.js.asDynamic' call
     var a = _this__u8e3s4;
-    if (a == null)
-      return 0;
-    var result = 1;
+    // Inline function 'kotlin.js.asDynamic' call
+    var b = other;
+    if (a === b)
+      return true;
+    if (a == null || b == null || !isArrayish(b) || a.length != b.length)
+      return false;
     var inductionVariable = 0;
     var last = a.length;
     if (inductionVariable < last)
       do {
         var i = inductionVariable;
         inductionVariable = inductionVariable + 1 | 0;
-        result = imul(result, 31) + hashCode(a[i]) | 0;
+        if (!equals(a[i], b[i])) {
+          return false;
+        }
       }
        while (inductionVariable < last);
-    return result;
+    return true;
   }
   function arrayToString(array) {
     return joinToString(array, ', ', '[', ']', VOID, VOID, arrayToString$lambda);
@@ -1813,6 +1813,45 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function defineProp(obj, name, getter, setter, enumerable) {
     return Object.defineProperty(obj, name, {configurable: true, get: getter, set: setter, enumerable: enumerable});
   }
+  function hashCode(obj) {
+    if (obj == null)
+      return 0;
+    var typeOf = typeof obj;
+    var tmp;
+    switch (typeOf) {
+      case 'object':
+        tmp = 'function' === typeof obj.hashCode ? obj.hashCode() : getObjectHashCode(obj);
+        break;
+      case 'function':
+        tmp = isCallableReference(obj) ? getCallableReferenceHashCode(obj) : getObjectHashCode(obj);
+        break;
+      case 'number':
+        tmp = getNumberHashCode(obj);
+        break;
+      case 'boolean':
+        // Inline function 'kotlin.js.unsafeCast' call
+
+        tmp = getBooleanHashCode(obj);
+        break;
+      case 'string':
+        tmp = getStringHashCode(String(obj));
+        break;
+      case 'bigint':
+        // Inline function 'kotlin.js.unsafeCast' call
+
+        tmp = getBigIntHashCode(obj);
+        break;
+      case 'symbol':
+        tmp = getSymbolHashCode(obj);
+        break;
+      default:
+        tmp = function () {
+          throw new Error('Unexpected typeof `' + typeOf + '`');
+        }();
+        break;
+    }
+    return tmp;
+  }
   function equals(obj1, obj2) {
     if (obj1 == null) {
       return obj2 == null;
@@ -1867,45 +1906,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
     }
     return obj1 === obj2;
   }
-  function hashCode(obj) {
-    if (obj == null)
-      return 0;
-    var typeOf = typeof obj;
-    var tmp;
-    switch (typeOf) {
-      case 'object':
-        tmp = 'function' === typeof obj.hashCode ? obj.hashCode() : getObjectHashCode(obj);
-        break;
-      case 'function':
-        tmp = isCallableReference(obj) ? getCallableReferenceHashCode(obj) : getObjectHashCode(obj);
-        break;
-      case 'number':
-        tmp = getNumberHashCode(obj);
-        break;
-      case 'boolean':
-        // Inline function 'kotlin.js.unsafeCast' call
-
-        tmp = getBooleanHashCode(obj);
-        break;
-      case 'string':
-        tmp = getStringHashCode(String(obj));
-        break;
-      case 'bigint':
-        // Inline function 'kotlin.js.unsafeCast' call
-
-        tmp = getBigIntHashCode(obj);
-        break;
-      case 'symbol':
-        tmp = getSymbolHashCode(obj);
-        break;
-      default:
-        tmp = function () {
-          throw new Error('Unexpected typeof `' + typeOf + '`');
-        }();
-        break;
-    }
-    return tmp;
-  }
   function toString_1(o) {
     var tmp;
     if (o == null) {
@@ -2631,6 +2631,11 @@ if (typeof String.prototype.startsWith === 'undefined') {
     // Inline function 'kotlin.js.asDynamic' call
     return _this__u8e3s4.slice(fromIndex, toIndex);
   }
+  function copyOfRange_0(_this__u8e3s4, fromIndex, toIndex) {
+    Companion_instance_4.w2(fromIndex, toIndex, _this__u8e3s4.length);
+    // Inline function 'kotlin.js.asDynamic' call
+    return _this__u8e3s4.slice(fromIndex, toIndex);
+  }
   function copyOf(_this__u8e3s4, newSize) {
     // Inline function 'kotlin.require' call
     if (!(newSize >= 0)) {
@@ -2661,11 +2666,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
     }
     return arrayCopyResize(_this__u8e3s4, newSize, null);
   }
-  function copyOfRange_0(_this__u8e3s4, fromIndex, toIndex) {
-    Companion_instance_4.w2(fromIndex, toIndex, _this__u8e3s4.length);
-    // Inline function 'kotlin.js.asDynamic' call
-    return _this__u8e3s4.slice(fromIndex, toIndex);
-  }
   function digitToIntImpl(_this__u8e3s4) {
     // Inline function 'kotlin.code' call
     var ch = Char__toInt_impl_vasixd(_this__u8e3s4);
@@ -2753,6 +2753,9 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function setOf(element) {
     return hashSetOf([element]);
   }
+  function mapCapacity(expectedSize) {
+    return expectedSize;
+  }
   function copyToArray(collection) {
     var tmp;
     // Inline function 'kotlin.js.asDynamic' call
@@ -2767,9 +2770,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
     }
     return tmp;
   }
-  function mapCapacity(expectedSize) {
-    return expectedSize;
-  }
   function checkCountOverflow(count) {
     if (count < 0) {
       throwCountOverflow();
@@ -4621,29 +4621,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function NumberFormatException() {
     captureStack(this, NumberFormatException);
   }
-  function ArithmeticException_init_$Init$($this) {
-    RuntimeException_init_$Init$($this);
-    ArithmeticException.call($this);
-    return $this;
-  }
-  function ArithmeticException_init_$Create$() {
-    var tmp = ArithmeticException_init_$Init$(objectCreate(protoOf(ArithmeticException)));
-    captureStack(tmp, ArithmeticException_init_$Create$);
-    return tmp;
-  }
-  function ArithmeticException_init_$Init$_0(message, $this) {
-    RuntimeException_init_$Init$_0(message, $this);
-    ArithmeticException.call($this);
-    return $this;
-  }
-  function ArithmeticException_init_$Create$_0(message) {
-    var tmp = ArithmeticException_init_$Init$_0(message, objectCreate(protoOf(ArithmeticException)));
-    captureStack(tmp, ArithmeticException_init_$Create$_0);
-    return tmp;
-  }
-  function ArithmeticException() {
-    captureStack(this, ArithmeticException);
-  }
   function AssertionError_init_$Init$($this) {
     Error_init_$Init$($this);
     AssertionError.call($this);
@@ -4667,6 +4644,29 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function AssertionError() {
     captureStack(this, AssertionError);
   }
+  function ArithmeticException_init_$Init$($this) {
+    RuntimeException_init_$Init$($this);
+    ArithmeticException.call($this);
+    return $this;
+  }
+  function ArithmeticException_init_$Create$() {
+    var tmp = ArithmeticException_init_$Init$(objectCreate(protoOf(ArithmeticException)));
+    captureStack(tmp, ArithmeticException_init_$Create$);
+    return tmp;
+  }
+  function ArithmeticException_init_$Init$_0(message, $this) {
+    RuntimeException_init_$Init$_0(message, $this);
+    ArithmeticException.call($this);
+    return $this;
+  }
+  function ArithmeticException_init_$Create$_0(message) {
+    var tmp = ArithmeticException_init_$Init$_0(message, objectCreate(protoOf(ArithmeticException)));
+    captureStack(tmp, ArithmeticException_init_$Create$_0);
+    return tmp;
+  }
+  function ArithmeticException() {
+    captureStack(this, ArithmeticException);
+  }
   function UninitializedPropertyAccessException_init_$Init$($this) {
     RuntimeException_init_$Init$($this);
     UninitializedPropertyAccessException.call($this);
@@ -6533,12 +6533,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
     putAll(this_0, pairs);
     return this_0;
   }
-  function hashMapOf(pairs) {
-    // Inline function 'kotlin.apply' call
-    var this_0 = HashMap_init_$Create$_0(mapCapacity(pairs.length));
-    putAll(this_0, pairs);
-    return this_0;
-  }
   function EmptyMap() {
     this.ac_1 = 8246714829545688274n;
   }
@@ -6653,6 +6647,12 @@ if (typeof String.prototype.startsWith === 'undefined') {
       _this__u8e3s4.j4(key, value);
     }
   }
+  function hashMapOf(pairs) {
+    // Inline function 'kotlin.apply' call
+    var this_0 = HashMap_init_$Create$_0(mapCapacity(pairs.length));
+    putAll(this_0, pairs);
+    return this_0;
+  }
   function addAll(_this__u8e3s4, elements) {
     if (isInterface(elements, Collection))
       return _this__u8e3s4.y(elements);
@@ -6667,16 +6667,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
       return result;
     }
   }
-  function addAll_0(_this__u8e3s4, elements) {
-    var result = false;
-    var _iterator__ex2g4s = elements.m();
-    while (_iterator__ex2g4s.p()) {
-      var item = _iterator__ex2g4s.q();
-      if (_this__u8e3s4.j(item))
-        result = true;
-    }
-    return result;
-  }
   function removeAll(_this__u8e3s4, elements) {
     var list = toList_1(elements);
     var tmp;
@@ -6691,6 +6681,16 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function removeAll_0(_this__u8e3s4, elements) {
     return _this__u8e3s4.j1(convertToListIfNotCollection(elements));
   }
+  function addAll_0(_this__u8e3s4, elements) {
+    var result = false;
+    var _iterator__ex2g4s = elements.m();
+    while (_iterator__ex2g4s.p()) {
+      var item = _iterator__ex2g4s.q();
+      if (_this__u8e3s4.j(item))
+        result = true;
+    }
+    return result;
+  }
   function convertToListIfNotCollection(_this__u8e3s4) {
     var tmp;
     if (isInterface(_this__u8e3s4, Collection)) {
@@ -7455,9 +7455,6 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function mutableSetOf(elements) {
     return toCollection(elements, LinkedHashSet_init_$Create$_1(mapCapacity(elements.length)));
   }
-  function hashSetOf(elements) {
-    return toCollection(elements, HashSet_init_$Create$_0(mapCapacity(elements.length)));
-  }
   function EmptySet() {
     this.hf_1 = 3406603774387020532n;
   }
@@ -7509,6 +7506,9 @@ if (typeof String.prototype.startsWith === 'undefined') {
   function EmptySet_getInstance() {
     return EmptySet_instance;
   }
+  function hashSetOf(elements) {
+    return toCollection(elements, HashSet_init_$Create$_0(mapCapacity(elements.length)));
+  }
   function optimizeReadOnlySet(_this__u8e3s4) {
     switch (_this__u8e3s4.s()) {
       case 0:
@@ -8634,7 +8634,7 @@ if (typeof String.prototype.startsWith === 'undefined') {
   _.$_$.a2 = asSequence;
   _.$_$.b2 = collectionSizeOrDefault;
   _.$_$.c2 = contains_0;
-  _.$_$.d2 = copyOfRange;
+  _.$_$.d2 = copyOfRange_0;
   _.$_$.e2 = copyOf_0;
   _.$_$.f2 = copyOf;
   _.$_$.g2 = copyToArray;