Class MaxSatKAdmissibleAstReasoner

java.lang.Object
org.tweetyproject.arg.dung.reasoner.MaxSatKAdmissibleAstReasoner
All Implemented Interfaces:
KOptimisationReasoner, Reasoner<Integer,DungTheory,Argument>

public class MaxSatKAdmissibleAstReasoner extends Object implements KOptimisationReasoner
A MaxSAT-based implementation for solving the MaxAdm* problem from [Skiba,Thimm; 2024]
Author:
Matthias Thimm
  • Constructor Details

    • MaxSatKAdmissibleAstReasoner

      public MaxSatKAdmissibleAstReasoner(MaxSatSolver solver)
      Parameters:
      solver - the max sat solver
  • Method Details

    • defendsAgainstOutsideAttackers

      public static boolean defendsAgainstOutsideAttackers(DungTheory aaf, Collection<Argument> set)
      Returns "true" if set defends against all attacks from outside of set
      Parameters:
      aaf - some AAF.
      set - some set of arguments.
      Returns:
      "true" if set defends against all attacks from outside of set
    • eval

      public static int eval(DungTheory aaf, Collection<Argument> set)
      Returns the maximal k such that the given extension is a k-adm* extension of the given AAF. Returns Integer.MIN_VALUE if the given set is not a k-stable* extension for any k (i.e., iff it does not defend against all attacks from outside)
      Parameters:
      aaf - some AAF.
      set - some set of arguments.
      Returns:
      the maximal k such that the given extension is a k-adm* extension of the given AAF.
    • query

      public Integer query(DungTheory aaf, Argument arg)
      Description copied from interface: Reasoner
      Queries the given belief base for the given formula.
      Specified by:
      query in interface KOptimisationReasoner
      Specified by:
      query in interface Reasoner<Integer,DungTheory,Argument>
      Parameters:
      aaf - a belief base
      arg - a formula
      Returns:
      the answer to the query