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 Summary
ConstructorDescriptionConstructs aRandomDecomposer
for the specifiedAbstractDialecticalFramework
. -
Method Summary
Modifier and TypeMethodDescriptiondecompose
(int desired) Decomposes the framework or system into a collection ofInterpretation
objects based on the provided criterion.
-
Constructor Details
-
RandomDecomposer
Constructs aRandomDecomposer
for the specifiedAbstractDialecticalFramework
.- Parameters:
adf
- the Abstract Dialectical Framework to decompose, must not benull
-
-
Method Details
-
decompose
Description copied from interface:Decomposer
Decomposes the framework or system into a collection ofInterpretation
objects based on the provided criterion.- Specified by:
decompose
in interfaceDecomposer
- 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
- Returns:
- asTwoValued
-