Package org.tweetyproject.arg.dung.reasoner.serialisable
package org.tweetyproject.arg.dung.reasoner.serialisable
-
ClassesClassDescriptionAbstract class for computing extensions via a serialised transition system to implement this class, you need to define a selection and a termination function Selection function a(UA, UC, C): selects and returns a subset of the initial sets Termination function b((AF, S)): If the given state satisfies a specific condition, its extension may be accepted by the associated serialised semanticsSerialised version of the admissible semanticsSerialised version of the complete semanticsSerialised version of the grounded semanticsSerialised version of the preferred semanticsSerialised version of the stable semanticsSerialised reasoner for the unchallenged semantics The unchallenged semantics amounts to exhaustively adding unattacked and unchallenged initial sets