Class RandomAspicReasoner<T extends Invertable>
java.lang.Object
org.tweetyproject.arg.aspic.reasoner.AbstractAspicReasoner<T>
org.tweetyproject.arg.aspic.reasoner.RandomAspicReasoner<T>
- Type Parameters:
T
- The type of formulas.
- All Implemented Interfaces:
QualitativeReasoner<AspicArgumentationTheory<T>,
,T> Reasoner<Boolean,
AspicArgumentationTheory<T>, T>
This class implements an approximate reasoner for ASPIC+ that randomly
samples arguments.
- Author:
- Matthias Thimm
-
Constructor Summary
ConstructorDescriptionRandomAspicReasoner
(AbstractExtensionReasoner aafReasoner, int maxArguments, int maxDuplicates) Creates a new instance. -
Method Summary
Modifier and TypeMethodDescriptiongetDungTheory
(AspicArgumentationTheory<T> aat, T query) Computes the Dung theory from which the answer will be derivedboolean
Checks whether the underlying solver or reasoning mechanism used by this reasoner is installed and available for use.toString()
Methods inherited from class org.tweetyproject.arg.aspic.reasoner.AbstractAspicReasoner
query, query, query
-
Constructor Details
-
RandomAspicReasoner
public RandomAspicReasoner(AbstractExtensionReasoner aafReasoner, int maxArguments, int maxDuplicates) Creates a new instance.- Parameters:
aafReasoner
- Underlying reasoner for AAFs.maxArguments
- The maximal number of arguments constructed by this reasoner.maxDuplicates
- The maximal number of duplicates tolerated before this reasoner cancels looking for more arguments (even ifmaxArguments
is not yet reached).
-
-
Method Details
-
getDungTheory
Description copied from class:AbstractAspicReasoner
Computes the Dung theory from which the answer will be derived- Specified by:
getDungTheory
in classAbstractAspicReasoner<T extends Invertable>
- Parameters:
aat
- some Aspic theoryquery
- some query- Returns:
- a Dung theory
-
toString
-
isInstalled
public boolean isInstalled()Description copied from interface:QualitativeReasoner
Checks whether the underlying solver or reasoning mechanism used by this reasoner is installed and available for use. This can be helpful when the reasoner depends on external tools or libraries for performing the reasoning tasks.- Returns:
- `true` if the solver is installed and available, `false` otherwise.
-