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

  • Type Parameters:
    T - is the type of the language that the ASPIC theory's rules range over
    All Implemented Interfaces:
    net.sf.tweety.commons.Formula, net.sf.tweety.commons.util.rules.Rule<T,​T>

    public class StrictInferenceRule<T extends net.sf.tweety.logics.commons.syntax.interfaces.Invertable>
    extends InferenceRule<T>
    Author:
    Nils Geilen Indefeasible implementation of InferenceRule<T>
    • Constructor Detail

      • StrictInferenceRule

        public StrictInferenceRule()
        Constructs an empty instance
      • StrictInferenceRule

        public StrictInferenceRule​(T conclusion,
                                   Collection<T> premise)
        Constructs a strict inference rule p -> c
        Parameters:
        conclusion - ^= p
        premise - ^= c
    • Method Detail

      • isDefeasible

        public boolean isDefeasible()
        Specified by:
        isDefeasible in class InferenceRule<T extends net.sf.tweety.logics.commons.syntax.interfaces.Invertable>
        Returns:
        true iff this rule is defeasible