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
Serialised version of the admissible semantics
- Author:
- Lars Bengel
-
Constructor Summary
Constructors -
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 theory, i.e.booleanChecks whether the current state satisfies some condition, i.e.Methods inherited from class org.tweetyproject.arg.dung.reasoner.serialisable.SerialisableExtensionReasoner
getModel, getModels, getSerialisableReasonerForSemanticsMethods inherited from class org.tweetyproject.arg.dung.reasoner.AbstractExtensionReasoner
getSimpleReasonerForSemantics, isInstalled, query, query
-
Constructor Details
-
SerialisedAdmissibleReasoner
public SerialisedAdmissibleReasoner()
-
-
Method Details
-
selectionFunction
public Collection<Extension<DungTheory>> selectionFunction(Collection<Extension<DungTheory>> unattacked, Collection<Extension<DungTheory>> unchallenged, Collection<Extension<DungTheory>> challenged) Description copied from class:SerialisableExtensionReasonerselect a subset of the initial sets of the theory, i.e. the possible successor states- Specified by:
selectionFunctionin classSerialisableExtensionReasoner- Parameters:
unattacked- the set of unattacked initial setsunchallenged- the set of unchallenged initial setschallenged- the set of challenged initial sets- Returns:
- a subset of the initial sets of the theory, selected via a specific criteria
-
terminationFunction
Description copied from class:SerialisableExtensionReasonerChecks whether the current state satisfies some condition, i.e. its extension can be accepted by the corresponding semantics- Specified by:
terminationFunctionin classSerialisableExtensionReasoner- Parameters:
state- the current state of the transition system- Returns:
- true, if the state satisfies the condition
-