MostComplexAcceptanceConditionDecomposer

java.lang.Object

org.tweetyproject.arg.adf.reasoner.sat.decomposer.MostComplexAcceptanceConditionDecomposer

All Implemented Interfaces:: Decomposer

public class MostComplexAcceptanceConditionDecomposer extends Object

Returns the arguments with the most complex acceptance condition, according to their logical complexity.

Author:: Mathias Hofer

Constructor Summary

Constructors

Constructor

Description

MostComplexAcceptanceConditionDecomposer(AbstractDialecticalFramework adf)
Method Summary

Modifier and Type

Method

Description

Decomposer

asTwoValued()

Collection<Interpretation>

decompose(int desired)

Decomposes the framework or system into a collection of Interpretation objects based on the provided criterion.

Methods inherited from class java.lang.Object
equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details
- MostComplexAcceptanceConditionDecomposer
  
  public MostComplexAcceptanceConditionDecomposer(AbstractDialecticalFramework adf)
  
  Parameters:
  
  adf - AbstractDialecticalFramework
Method Details
- decompose
  
  public Collection<Interpretation> decompose(int desired)
  
  Description copied from interface: Decomposer
  
  Decomposes the framework or system into a collection of Interpretation objects based on the provided criterion.
  
  Specified by:
  
  decompose in interface Decomposer
  
  Parameters:
  
  desired - an integer representing the desired criterion for decomposition; the meaning of this parameter is implementation-specific (e.g., it could represent the number of desired interpretations or a specific threshold for decomposition)
  
  Returns:
  
  a collection of decomposed Interpretation objects based on the specified criterion
- asTwoValued
  
  public Decomposer asTwoValued()
  
  Returns:
  
  asTwoValued