Class RandomAspicReasoner<T extends net.sf.tweety.logics.commons.syntax.interfaces.Invertable>

  • Type Parameters:
    T - The type of formulas.
    All Implemented Interfaces:
    net.sf.tweety.commons.QualitativeReasoner<AspicArgumentationTheory<T>,​T>, net.sf.tweety.commons.Reasoner<Boolean,​AspicArgumentationTheory<T>,​T>

    public class RandomAspicReasoner<T extends net.sf.tweety.logics.commons.syntax.interfaces.Invertable>
    extends AbstractAspicReasoner<T>
    This class implements an approximate reasoner for ASPIC+ that randomly samples arguments.
    Author:
    Matthias Thimm
    • Constructor Detail

      • RandomAspicReasoner

        public RandomAspicReasoner​(net.sf.tweety.arg.dung.reasoner.AbstractExtensionReasoner aafReasoner,
                                   int maxArguments,
                                   int maxDuplicates)
        Creates a new instance.
        Parameters:
        aafReasoner - Underlying reasoner for AAFs.
        maxArguments - The maximal number of arguments constructed by this reasoner.
        maxDuplicates - The maximal number of duplicates tolerated before this reasoner cancels looking for more arguments (even if maxArguments is not yet reached).
    • Method Detail

      • getDungTheory

        public net.sf.tweety.arg.dung.syntax.DungTheory getDungTheory​(AspicArgumentationTheory<T> aat,
                                                                      T query)
        Description copied from class: AbstractAspicReasoner
        Computes the Dung theory from which the answer will be derived
        Specified by:
        getDungTheory in class AbstractAspicReasoner<T extends net.sf.tweety.logics.commons.syntax.interfaces.Invertable>
        Parameters:
        aat - some Aspic theory
        query - some query
        Returns:
        a Dung theory