Class RandomDecomposer
java.lang.Object
org.tweetyproject.arg.adf.reasoner.sat.decomposer.RandomDecomposer
- All Implemented Interfaces:
- Decomposer
The 
RandomDecomposer is a concrete implementation of the
 AbstractDecomposer, designed to randomly partition the arguments
 of an AbstractDialecticalFramework (ADF).
 The decomposition randomly shuffles the arguments in the ADF and then selects a subset of them based on the specified count. This allows for random partitions of the argument set, which can be useful for certain applications like random sampling or stochastic analysis of argumentation frameworks.
 Usage of this class involves instantiating it with a specific ADF and then
 calling the decomposition methods provided by the superclass
 AbstractDecomposer.
 
- Author:
- Sebastian Matthias Thimm
- 
Constructor SummaryConstructorsConstructorDescriptionConstructs aRandomDecomposerfor the specifiedAbstractDialecticalFramework.
- 
Method SummaryModifier and TypeMethodDescriptiondecompose(int desired) Decomposes the framework or system into a collection ofInterpretationobjects based on the provided criterion.
- 
Constructor Details- 
RandomDecomposerConstructs aRandomDecomposerfor the specifiedAbstractDialecticalFramework.- Parameters:
- adf- the Abstract Dialectical Framework to decompose, must not be- null
 
 
- 
- 
Method Details- 
decomposeDescription copied from interface:DecomposerDecomposes the framework or system into a collection ofInterpretationobjects based on the provided criterion.- Specified by:
- decomposein 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 Interpretationobjects based on the specified criterion
 
- 
asTwoValued- Returns:
- asTwoValued
 
 
-