Class SerialisedAdmissibleReasoner
java.lang.Object
org.tweetyproject.arg.dung.reasoner.AbstractDungReasoner
org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner
org.tweetyproject.arg.dung.reasoner.serialisable.SerialisableExtensionReasoner
org.tweetyproject.arg.dung.reasoner.serialisable.SerialisedAdmissibleReasoner
- All Implemented Interfaces:
ModelProvider<Argument,
,DungTheory, Extension<DungTheory>> PostulateEvaluatable<Argument>
,QualitativeReasoner<DungTheory,
,Argument> Reasoner<Boolean,
DungTheory, Argument>
- Direct Known Subclasses:
SerialisedCompleteReasoner
,SerialisedPreferredReasoner
,SerialisedStableReasoner
,SerialisedStronglyAdmissibleReasoner
Serialised version of the admissible semantics
- Author:
- Lars Bengel
-
Constructor Summary
-
Method Summary
Modifier and TypeMethodDescriptionselectionFunction
(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) Select a subset of the initial sets of the AF, i.e.boolean
terminationFunction
(DungTheory theory, Extension<DungTheory> extension) Determines whether the current state represents an extension wrt.Methods inherited from class org.tweetyproject.arg.dung.reasoner.serialisable.SerialisableExtensionReasoner
getModel, getModels, getSemantics, getSequences, getSerialisableReasonerForSemantics, getSerialisationGraph
Methods inherited from class org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner
getSimpleReasonerForSemantics, isInstalled, query, query
-
Constructor Details
-
SerialisedAdmissibleReasoner
public SerialisedAdmissibleReasoner()Initializes aSerialisableExtensionReasoner
for the admissible semantics
-
-
Method Details
-
selectionFunction
public Collection<Extension<DungTheory>> selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) Select a subset of the initial sets of the AF, i.e. the possible successor states- Parameters:
unattacked
- the set of unattacked initial setsunchallenged
- the set of unchallenged initial setschallenged
- the set of challenged initial sets- Returns:
- all initial sets
-
terminationFunction
Determines whether the current state represents an extension wrt. the semantics of the reasoner or not.- Specified by:
terminationFunction
in classSerialisableExtensionReasoner
- Parameters:
theory
- The current framework of the transition systemextension
- The extension constructed so far- Returns:
- true, since every state corresponds to an admissible extension
-