Package org.tweetyproject.arg.aba.syntax

Class Negation<T extends Formula>

java.lang.Object
org.tweetyproject.arg.aba.syntax.AbaElement<T>
org.tweetyproject.arg.aba.syntax.Negation<T>
Type Parameters:
T - the type of formulas
All Implemented Interfaces:
Formula, ComplexLogicalFormula, LogicStructure, SimpleLogicalFormula
public class Negation<T extends Formula> extends AbaElement<T>
Author:
Nils Geilen (geilenn@uni-koblenz.de) This represents a negation relation of form "not formula = negation"

  • Constructor Details

    • Negation

      public Negation(T formula, T negation)
      Creates a new Negation
      Parameters:
      formula - a formula
      negation - it's complement

  • Method Details

    • hashCode

      public int hashCode()
      Specified by:
      hashCode in interface SimpleLogicalFormula
      Overrides:
      hashCode in class Object

    • equals

      public boolean equals(Object obj)
      Specified by:
      equals in interface SimpleLogicalFormula
      Overrides:
      equals in class Object

    • getSignature

      public Signature getSignature()
      Description copied from interface: Formula
      Returns the signature of the language of this formula.
      Returns:
      the signature of the language of this formula.

    • toString

      public String toString()
      Overrides:
      toString in class Object

    • getPredicates

      public Set<? extends Predicate> getPredicates()
      Description copied from interface: SimpleLogicalFormula
      Processes the set of all predicates which appear in this formula
      Returns:
      all predicates that appear in this formula

    • getTerms

      public Set<Term<?>> getTerms()
      Returns:
      a set containing all terms of this logical structure

    • getTerms

      public <C extends Term<?>> Set<C> getTerms(Class<C> cls)
      Description copied from interface: LogicStructure
      Processes the set containing all terms of type C. This method uses the equals method of the given Class and therefore does not add terms which are sub classes of type C to the set.
      Type Parameters:
      C - the type of terms
      Parameters:
      cls - The Class structure containing type information about the searched term
      Returns:
      A set containing all terms of type C of this logical structure

    • clone

      public Negation<T> clone()
      Description copied from interface: SimpleLogicalFormula
      Creates a deep copy of this formula
      Specified by:
      clone in interface ComplexLogicalFormula
      Specified by:
      clone in interface SimpleLogicalFormula
      Specified by:
      clone in class AbaElement<T extends Formula>
      Returns:
      the cloned formula

    • substitute

      public Negation<T> substitute(Term<?> v, Term<?> t) throws IllegalArgumentException
      Description copied from interface: ComplexLogicalFormula
      Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.
      Specified by:
      substitute in interface ComplexLogicalFormula
      Specified by:
      substitute in class AbaElement<T extends Formula>
      Parameters:
      v - the term to be substituted.
      t - the term to substitute.
      Returns:
      a formula where every occurrence of "v" is replaced by "t".
      Throws:
      IllegalArgumentException - if "v" and "t" are of different sorts