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 Details

    • SimpleRecursiveExtendedAdmissibleReasoner

      public SimpleRecursiveExtendedAdmissibleReasoner()
      Default constructor for SimpleRecursiveExtendedAdmissibleReasoner. This constructor initializes the reasoner without any specific parameters.
  • Method Details