Package org.tweetyproject.arg.dung.principles

Class SccDecomposabilityPrinciple

java.lang.Object

org.tweetyproject.arg.dung.principles.Principle

org.tweetyproject.arg.dung.principles.SccDecomposabilityPrinciple

All Implemented Interfaces:

Postulate<Argument>

public class SccDecomposabilityPrinciple
extends Principle

SCC Decomposability Principle (also SCC-Recursiveness)

A semantics satisfies SCC decomposability iff for all AFs we have: The extensions of F are the same as computing the extensions of each SCC individually and combining the result Can return false even if principle is not violated, in case that the semantics is different to the base function. E.g. SCF2-semantics or CF2-semantics

Author:

Lars Bengel

See Also:

• "Pietro Baroni et al. 'On the input/output behavior of argumentation frameworks' 2014"

Field Summary

Fields inherited from class org.tweetyproject.arg.dung.principles.Principle

ADMISSIBILITY, ALLOWING_ABSTENTION, CF_REINSTATEMENT, CONFLICT_FREE, DEFENCE, DIRECTIONALITY, I_MAXIMALITY, INRA, MODULARIZATION, NAIVETY, NON_INTERFERENCE, REDUCT_ADM, REINSTATEMENT, SCC_DECOMPOSABILITY, SCOOC, SEMI_DIRECTIONALITY, SEMIQUAL_ADM, STRONG_ADMISSIBILITY, WEAK_DIRECTIONALITY, WEAK_REINSTATEMENT

Constructor Summary

Constructors

Constructor	Description
SccDecomposabilityPrinciple()

Method Summary

Modifier and Type	Method	Description
String	getName()	The textual name of the postulate
boolean	isApplicable(Collection<Argument> kb)	Checks whether the given kb represents a non-trivial instance for this postulate, i.e., whether assumptions of this postulates are satisfied (evaluating an approach on a non-applicable instance always succeeds).
boolean	isSatisfied(Collection<Argument> kb, AbstractExtensionReasoner ev)	Computes whether the given extension reasoner (i.e.

Methods inherited from class org.tweetyproject.arg.dung.principles.Principle

isSatisfied

Methods inherited from class java.lang.Object

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

Constructor Details

SccDecomposabilityPrinciple

public SccDecomposabilityPrinciple()

Method Details

getName

public String getName()

Description copied from interface: Postulate

The textual name of the postulate

Returns:

a string

isApplicable

public boolean isApplicable(Collection<Argument> kb)

Description copied from interface: Postulate

Checks whether the given kb represents a non-trivial instance for this postulate, i.e., whether assumptions of this postulates are satisfied (evaluating an approach on a non-applicable instance always succeeds).

Specified by:

isApplicable in interface Postulate<Argument>

Specified by:

isApplicable in class Principle

Parameters:

kb - some knowledge base

Returns:

true if the knowledge base is a non trivial instance of this postulate.

isSatisfied

public boolean isSatisfied(Collection<Argument> kb,
 AbstractExtensionReasoner ev)

Description copied from class: Principle

Computes whether the given extension reasoner (i.e. semantics) satisfies this principle for this specific instance

Specified by:

isSatisfied in class Principle

Parameters:

kb - some argumentation framework

ev - an extension reasoner

Returns:

true, if this principle is satisfied for this instance and semantics