Class MaxSatKAdmissibleAstReasoner
java.lang.Object
org.tweetyproject.arg.dung.reasoner.MaxSatKAdmissibleAstReasoner
- All Implemented Interfaces:
KOptimisationReasoner,Reasoner<Integer,DungTheory, Argument>
A MaxSAT-based implementation for solving the MaxAdm* problem from
[Skiba,Thimm; 2024]
- Author:
- Matthias Thimm
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionstatic booleanReturns "true" if set defends against all attacks from outside of setstatic inteval(DungTheory aaf, Collection<Argument> set) Returns the maximal k such that the given extension is a k-adm* extension of the given AAF.query(DungTheory aaf, Argument arg) Queries the given belief base for the given formula.
-
Constructor Details
-
MaxSatKAdmissibleAstReasoner
- Parameters:
solver- the max sat solver
-
-
Method Details
-
defendsAgainstOutsideAttackers
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
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
Description copied from interface:ReasonerQueries the given belief base for the given formula.- Specified by:
queryin interfaceKOptimisationReasoner- Specified by:
queryin interfaceReasoner<Integer,DungTheory, Argument> - Parameters:
aaf- a belief basearg- a formula- Returns:
- the answer to the query
-