Merge branch 'main' into epistemicConstraintFramework

Author: sandra-hoffmann

.github/workflows/package.yml

@@ -0,0 +1,28 @@
+name: Package
+
+on:
+  push:
+    branches: [ "main" ]
+  pull_request:
+    branches: [ "main" ]
+
+jobs:
+  build:
+
+    runs-on: ubuntu-latest
+
+    steps:
+      - uses: actions/checkout@v4
+      - name: Set up JDK 21
+        uses: actions/setup-java@v4
+        with:
+          # Compile source and target are still specified in pom.xml
+          java-version: '21'
+          distribution: 'temurin'
+          cache: maven
+      - name: Build with Maven
+        run: mvn --batch-mode package
+
+      # Optional: Uploads the full dependency graph to GitHub to improve the quality of Dependabot alerts this repository can receive
+      - name: Update dependency graph
+        uses: advanced-security/maven-dependency-submission-action@v4

.gitignore

@@ -36,3 +36,4 @@ testBuild
 
 gurobi-9.1.0.jar
 isula-1.1.1.jar
+logs/server.log.lck

org-tweetyproject-arg-deductive/src/main/java/org/tweetyproject/arg/deductive/util/RandomDeductiveKnowledgeBaseGenerator.java

@@ -89,7 +89,7 @@ public DeductiveKnowledgeBase next() {
         return kb;
     }
 
-    
+
     /**
      * Description missing
      * @param <C> Description missing

org-tweetyproject-arg-dung/src/main/java/org/tweetyproject/arg/dung/examples/GraphPlotterExample.java

@@ -0,0 +1,54 @@
+/*
+ * This file is part of "TweetyProject", a collection of Java libraries for
+ * logical aspects of artificial intelligence and knowledge representation.
+ *
+ * TweetyProject is free software: you can redistribute it and/or modify
+ * it under the terms of the GNU Lesser General Public License version 3 as
+ * published by the Free Software Foundation.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU Lesser General Public License for more details.
+ *
+ * You should have received a copy of the GNU Lesser General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ * Copyright 2025 The TweetyProject Team <http://tweetyproject.org/contact/>
+ */
+package org.tweetyproject.arg.dung.examples;
+
+import org.tweetyproject.arg.dung.semantics.Semantics;
+import org.tweetyproject.arg.dung.serialisability.util.AigSerialisationPlotter;
+import org.tweetyproject.arg.dung.syntax.Argument;
+import org.tweetyproject.arg.dung.syntax.DungTheory;
+import org.tweetyproject.arg.dung.util.DefaultDungTheoryGenerator;
+import org.tweetyproject.graphs.util.AigGraphPlotter;
+
+import java.io.IOException;
+import java.net.URISyntaxException;
+
+/**
+ * Example Usage of the {@link AigGraphPlotter} which renders a given graph via html in the webbrowser
+ *
+ * @author Lars Bengel
+ */
+public class GraphPlotterExample {
+    public static void main(String[] args) throws URISyntaxException, IOException {
+        DungTheory theory = new DefaultDungTheoryGenerator(9, 0.2).next();
+
+        // Initialize plotter for argumentation framework
+        AigGraphPlotter<DungTheory,Argument> plotter = new AigGraphPlotter<>(theory);
+
+        // Set options for rendering of the graph, eg
+        plotter.setLinkDeletable(false);
+
+        // Render graph
+        plotter.show();
+
+        // Plot an argumentation framework and its serialisation wrt. complete semantics
+        //AigSerialisationPlotter.showSerialisation(theory, Semantics.CO);
+
+
+    }
+}

org-tweetyproject-arg-dung/src/main/java/org/tweetyproject/arg/dung/serialisability/semantics/SerialisationGraph.java

@@ -18,7 +18,6 @@
  */
 package org.tweetyproject.arg.dung.serialisability.semantics;
 
-import org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner;
 import org.tweetyproject.arg.dung.reasoner.SerialisedExtensionReasoner;
 import org.tweetyproject.arg.dung.semantics.Extension;
 import org.tweetyproject.arg.dung.semantics.Semantics;
@@ -46,6 +45,8 @@ public class SerialisationGraph implements Graph<SerialisationState> {
     /** explicit storage of children for each node */
     private Map<SerialisationState, Set<SerialisationState>> children = new HashMap<>();
 
+    private Collection<GeneralEdge<SerialisationState>> edges = new HashSet<>();
+
 
     /**
      * Construct a serialisation graph for the given argumentation framework and serialisation reasoner
@@ -65,7 +66,7 @@ public SerialisationGraph(DungTheory theory, SerialisedExtensionReasoner reasone
                 DungTheory reduct = theory.getReduct(ext);
                 SerialisationState node = new SerialisationState(reduct, new Extension<>(ext), reasoner.isTerminal(reduct, ext));
                 this.add(node);
-                this.add(new DirectedEdge<>(predecessor, node));
+                this.add(new DirectedEdge<>(predecessor, node, set.toString()));
                 predecessor = node;
             }
             predecessor = root;
@@ -84,7 +85,7 @@ public SerialisationGraph(DungTheory theory, Semantics semantics) {
     /** Pretty print of the graph.
      * @return the pretty print of the graph.
      */
-    public String prettyPrint(){
+    public String prettyPrint() {
         StringBuilder output = new StringBuilder();
         for (SerialisationState serialisationNode : this)
             output.append("node(").append(serialisationNode.toString()).append(").\n");
@@ -162,6 +163,7 @@ public boolean add(GeneralEdge<SerialisationState> edge) {
         result |= this.add(e.getNodeB());
         result |= children.get(e.getNodeA()).add(e.getNodeB());
         result |= parents.get(e.getNodeB()).add(e.getNodeA());
+        result |= edges.add(e);
         return result;
     }
 
@@ -190,19 +192,18 @@ public boolean areAdjacent(SerialisationState a, SerialisationState b) {
 
     @Override
     public GeneralEdge<SerialisationState> getEdge(SerialisationState a, SerialisationState b) {
-        return new DirectedEdge<>(a, b);
+        for (GeneralEdge<SerialisationState> edge : edges) {
+            DirectedEdge<SerialisationState> e = (DirectedEdge<SerialisationState>) edge;
+            if (e.getNodeA().equals(a) && e.getNodeB().equals(b)) {
+                return new DirectedEdge<>(e.getNodeA(), e.getNodeB(), e.getLabel());
+            }
+        }
+        return null;
     }
 
     @Override
     public Collection<? extends GeneralEdge<? extends SerialisationState>> getEdges() {
-        Collection<DirectedEdge<SerialisationState>> edges = new HashSet<>();
-        for (SerialisationState node: this) {
-            for (SerialisationState succ: this.children.get(node)) {
-                DirectedEdge<SerialisationState> edge = new DirectedEdge<>(node, succ);
-                edges.add(edge);
-            }
-        }
-        return edges;
+        return new HashSet<>(this.edges);
     }
 
     @Override

org-tweetyproject-arg-dung/src/main/java/org/tweetyproject/arg/dung/serialisability/util/AigSerialisationPlotter.java

@@ -0,0 +1,54 @@
+package org.tweetyproject.arg.dung.serialisability.util;
+
+import org.tweetyproject.arg.dung.reasoner.SerialisedExtensionReasoner;
+import org.tweetyproject.arg.dung.semantics.Extension;
+import org.tweetyproject.arg.dung.semantics.Semantics;
+import org.tweetyproject.arg.dung.serialisability.semantics.SerialisationGraph;
+import org.tweetyproject.arg.dung.serialisability.semantics.SerialisationState;
+import org.tweetyproject.arg.dung.syntax.Argument;
+import org.tweetyproject.arg.dung.syntax.DungTheory;
+import org.tweetyproject.graphs.util.AigGraphPlotter;
+
+import java.awt.*;
+import java.io.File;
+import java.io.IOException;
+import java.nio.file.Files;
+import java.nio.file.Path;
+import java.nio.file.Paths;
+
+
+public abstract class AigSerialisationPlotter extends AigGraphPlotter<DungTheory,Argument> {
+
+    public AigSerialisationPlotter(DungTheory graph) {
+        super(graph);
+    }
+
+    public static void showSerialisation(DungTheory theory, Semantics semantics) {
+        SerialisedExtensionReasoner reasoner = new SerialisedExtensionReasoner(semantics);
+
+        SerialisationGraph serialisation = reasoner.getSerialisationGraph(theory);
+        SerialisationState root = new SerialisationState(theory, new Extension<>(), reasoner.isTerminal(theory, new Extension<>()));
+
+        AigGraphPlotter<DungTheory,Argument> plotter1 = new AigGraphPlotter<>(theory);
+        AigGraphPlotter<SerialisationGraph,SerialisationState> plotter2 = new AigGraphPlotter<>(serialisation);
+        plotter2.makeLeveled(root);
+
+        Path outputPath = Paths.get("index.html");
+        try {
+            String template = Files.readString(Paths.get(getResource("aiggraph/serialisation.template")));
+            String output = String.format(template,
+                    plotter1.write(), plotter2.write(),
+                    getResource("aiggraph/favicon.ico"), getResource("aiggraph/style.css"),
+                    getResource("aiggraph/load-mathjax.js"), getResource("aiggraph/graph-component.js")
+            );
+
+            Files.writeString(outputPath, output);
+
+            // show graph in web browser
+            File htmlFile = new File("index.html");
+            Desktop.getDesktop().browse(htmlFile.toURI());
+        } catch (IOException e) {
+            throw new RuntimeException(e);
+        }
+    }
+}

org-tweetyproject-arg-rankings/src/main/java/org/tweetyproject/arg/rankings/reasoner/StrategyBasedRankingReasoner.java

@@ -122,8 +122,7 @@ public double computeStrengthOfArgument(Argument a, DungTheory kb, Set<Set<Argum
 		/*
 		 * Solve problem with simplex algorithm
 		 */
-		ApacheCommonsSimplex solver = new ApacheCommonsSimplex();
-		solver.onlyPositive = true;
+		ApacheCommonsSimplex solver = new ApacheCommonsSimplex(true);
 		try {
 			Map<Variable, Term> solution = solver.solve(problem);
 			return solution.get(targetVar).doubleValue();

org-tweetyproject-arg-rankings/src/main/java/org/tweetyproject/arg/rankings/util/LexicographicIntTupleComparator.java

@@ -24,7 +24,7 @@
  *  This comparator compares tuples of integers according to the lexicographic ordering as described in 
  *  [Cayrol, Lagasquie-Schiex. Graduality in argumentation. 2005].
  * 
- * @author Anna Gessler
+ * @author Anna Gessler, Matthias Thimm
  *
  */
 public class LexicographicIntTupleComparator implements Comparator<int[]> {
@@ -35,18 +35,28 @@ public class LexicographicIntTupleComparator implements Comparator<int[]> {
 	public static final double PRECISION = 0.001;
 	@Override
 	public int compare(int[] o1, int[] o2) {
-		String s1 = "";
-		String s2 = "";
-		for (int i : o1) 
-			s1 += i; 
-		for (int j : o2) 
-			s2 += j; 
-		return s1.compareTo(s2);
+		int idx = 0;
+		while(true) {
+			if(o1.length == idx && o2.length == idx)
+				return 0;
+			if(o1.length == idx)
+				return -1;
+			if(o2.length == idx)
+				return 1;
+			
+			if(o1[idx] > o2[idx])
+				return 1;
+			if(o1[idx] < o2[idx])
+				return -1;
+			idx++;
+		}
+		
 	}
 
 
     /** Default Constructor */
-    public LexicographicIntTupleComparator(){}
+    public LexicographicIntTupleComparator(){}   
+    
 }
 
 

org-tweetyproject-arg-setaf/src/test/java/SetAfTheoryTest.java

@@ -17,10 +17,7 @@
  *  Copyright 2021 The TweetyProject Team <http://tweetyproject.org/contact/>
  */
 
-
-
-
-import static org.junit.jupiter.api.Assertions.assertTrue;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 import java.util.HashSet;
 import java.util.Set;
@@ -36,6 +33,7 @@
  * Examples of SetAf Theorys and their semantics
  * 
  * @author Sebastian Franke
+ * @author Oleksandr Dzhychko
  *
  */
 public class SetAfTheoryTest {
@@ -69,12 +67,10 @@ public void extensionTest() {
 		String grS = gr.getModel(s).toString();
 		String adS = ad.getModels(s).toString();
 		String prS = pr.getModels(s).toString();
-		
-		assertTrue(grS.equals("{b,d}"));
-		assertTrue(adS.equals("[{b}, {d}, {b,d}, {}]"));
-		assertTrue(prS.equals("[{b,d}]"));
-
 
+        assertEquals("{b,c,d}", grS);
+        assertEquals("[{b}, {d}, {b,d}, {b,c,d}, {}]", adS);
+        assertEquals("[{b,c,d}]", prS);
 	}
 
 }