Class AdmissibleKernel
java.lang.Object
org.tweetyproject.arg.dung.equivalence.kernel.EquivalenceKernel
org.tweetyproject.arg.dung.equivalence.kernel.AdmissibleKernel
Kernel AK = (A, R') for strong equivalence wrt. admissible, preferred, unchallenged, ideal, semi-stable and eager semantics
defined as: R' = R \ { (a, b) | a!=b, (a,a) in R, (b,a) in R || (b,b) in R }
- Author:
- Lars Bengel
-
Field Summary
Fields inherited from class org.tweetyproject.arg.dung.equivalence.kernel.EquivalenceKernel
ADMISSIBLE, COMPLETE, GROUNDED, STABLE
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptiongetRedundantAttacks
(DungTheory theory) compute the set of redundant attacks, i.e., all attacks that are removed in oder to retrieve the kernel of the given AFMethods inherited from class org.tweetyproject.arg.dung.equivalence.kernel.EquivalenceKernel
getKernel, getKernelForSemantics
-
Constructor Details
-
AdmissibleKernel
public AdmissibleKernel()
-
-
Method Details
-
getRedundantAttacks
Description copied from class:EquivalenceKernel
compute the set of redundant attacks, i.e., all attacks that are removed in oder to retrieve the kernel of the given AF- Specified by:
getRedundantAttacks
in classEquivalenceKernel
- Parameters:
theory
- a dung theory- Returns:
- the set of redundant attacks
-