Package org.tweetyproject.arg.dung.reasoner

Class GCF_GreedyKApproximationReasoner

java.lang.Object

org.tweetyproject.arg.dung.reasoner.GCF_GreedyKApproximationReasoner

All Implemented Interfaces:

KOptimisationReasoner, Reasoner<Integer,DungTheory,Argument>

public class GCF_GreedyKApproximationReasoner
extends Object
implements KOptimisationReasoner

Starting from the empty set, this algorithms greedily determines an approximation to a k-stable extension by iteratively adding arguments (without introducing conflicts) that add the maximal number of arguments to the range. GCF="Growing conflict-free sets". [Thimm. Optimisation and Approximation in Abstract Argumentation: The Case of Stable Semantics. IJCAI 2024]

Author:

Matthias Thimm

Constructor Summary

Constructors

Constructor	Description
GCF_GreedyKApproximationReasoner()

Method Summary

Modifier and Type	Method	Description
Integer	query(DungTheory aaf, Argument arg)	Queries the given belief base for the given formula.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

GCF_GreedyKApproximationReasoner

public GCF_GreedyKApproximationReasoner()

Method Details

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