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 SummaryFields inherited from class org.tweetyproject.arg.dung.equivalence.kernel.EquivalenceKernelADMISSIBLE, COMPLETE, GROUNDED, STABLE
- 
Constructor SummaryConstructors
- 
Method SummaryModifier 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.EquivalenceKernelgetKernel, getKernelForSemantics
- 
Constructor Details- 
AdmissibleKernelpublic AdmissibleKernel()
 
- 
- 
Method Details- 
getRedundantAttacksDescription copied from class:EquivalenceKernelcompute the set of redundant attacks, i.e., all attacks that are removed in oder to retrieve the kernel of the given AF- Specified by:
- getRedundantAttacksin class- EquivalenceKernel
- Parameters:
- theory- a dung theory
- Returns:
- the set of redundant attacks
 
 
-