Class SimpleRecursiveExtendedAdmissibleReasoner
java.lang.Object
org.tweetyproject.arg.extended.reasoner.AbstractRecursiveExtendedExtensionReasoner
org.tweetyproject.arg.extended.reasoner.SimpleRecursiveExtendedAdmissibleReasoner
public class SimpleRecursiveExtendedAdmissibleReasoner
extends AbstractRecursiveExtendedExtensionReasoner
Simple reasoner for computing admissible sets of recursive extended theories.
This reasoner uses the concept of admissible sets in recursive extended theories.
A set is admissible if it is conflict-free and defends itself against attacks.
The reasoner first generates conflict-free sets using the
SimpleRecursiveExtendedConflictFreeReasoner
,
then checks which of these sets are admissible.- Author:
- Lars Bengel
- See Also:
-
Constructor Summary
ConstructorDescriptionDefault constructor forSimpleRecursiveExtendedAdmissibleReasoner
. -
Method Summary
Modifier and TypeMethodDescriptiongetModels
(RecursiveExtendedTheory bbase) Returns the collection of admissible sets of Dung entities for the given recursive extended theory.Methods inherited from class org.tweetyproject.arg.extended.reasoner.AbstractRecursiveExtendedExtensionReasoner
getSimpleReasonerForSemantics, isInstalled, query, query
-
Constructor Details
-
SimpleRecursiveExtendedAdmissibleReasoner
public SimpleRecursiveExtendedAdmissibleReasoner()Default constructor forSimpleRecursiveExtendedAdmissibleReasoner
. This constructor initializes the reasoner without any specific parameters.
-
-
Method Details
-
getModels
Returns the collection of admissible sets of Dung entities for the given recursive extended theory. This method retrieves all conflict-free sets from theSimpleRecursiveExtendedConflictFreeReasoner
, and then filters them to include only those that are admissible.- Specified by:
getModels
in classAbstractRecursiveExtendedExtensionReasoner
- Parameters:
bbase
- the recursive extended theory for which admissible sets are to be computed- Returns:
- a collection of admissible sets of Dung entities
-