Package org.tweetyproject.logics.ml.syntax

Class MlFormula

java.lang.Object
org.tweetyproject.logics.commons.syntax.RelationalFormula
org.tweetyproject.logics.fol.syntax.FolFormula
org.tweetyproject.logics.ml.syntax.MlFormula
All Implemented Interfaces:
Formula, ClassicalFormula, ComplexLogicalFormula, Conjunctable, Disjunctable, Invertable, LogicStructure, ProbabilityAware, QuantifiedFormula, SimpleLogicalFormula
Direct Known Subclasses:
Necessity, Possibility
public abstract class MlFormula extends FolFormula
This class models a modal formula, i.e. it encapsulates an modal operator and a formula (either a modal formula or a FolFormula).
Author:
Matthias Thimm

  • Constructor Details

    • MlFormula

      public MlFormula(RelationalFormula formula)
      Creates a new modal formula with the given inner formula.
      Parameters:
      formula - a modal formula or first-order formula

  • Method Details

    • getSignature

      public FolSignature getSignature()
      Description copied from interface: Formula
      Returns the signature of the language of this formula.
      Specified by:
      getSignature in interface Formula
      Overrides:
      getSignature in class FolFormula
      Returns:
      the signature of the language of this formula.

    • getUniformProbability

      public Probability getUniformProbability()
      Specified by:
      getUniformProbability in interface ProbabilityAware
      Overrides:
      getUniformProbability in class FolFormula
      Returns:
      this formula's probability in the uniform distribution.

    • getFormula

      public RelationalFormula getFormula()
      Specified by:
      getFormula in interface QuantifiedFormula
      Overrides:
      getFormula in class RelationalFormula
      Returns:
      the inner formula of this modal formula.

    • 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

    • getFunctors

      public Set<Functor> getFunctors()
      Specified by:
      getFunctors in class RelationalFormula
      Returns:
      all functors that appear in this formula.

    • getAtoms

      public Set<FolAtom> getAtoms()
      Description copied from interface: SimpleLogicalFormula
      Processes the set of all atoms which appear in this formula
      Specified by:
      getAtoms in interface SimpleLogicalFormula
      Specified by:
      getAtoms in class RelationalFormula
      Returns:
      all atoms that appear in this formula.

    • containsQuantifier

      public boolean containsQuantifier()
      Description copied from interface: QuantifiedFormula
      Checks whether this formula contains any quantification.
      Returns:
      "true" if this formula contains a quantification.

    • isClosed

      public boolean isClosed()
      Description copied from interface: QuantifiedFormula
      Checks whether this formula is closed, i.e. whether every variables occurring in the formula is bound by a quantifier.
      Returns:
      "true" if this formula is closed, "false" otherwise.

    • isClosed

      public boolean isClosed(Set<Variable> boundVariables)
      Description copied from interface: QuantifiedFormula
      Checks whether this formula is closed, i.e. whether every variables occurring in the formula is bound by a quantifier. Every variable in "boundVariables" is already assumed to be bound.
      Parameters:
      boundVariables - the variables assumed to be bound.
      Returns:
      "true" if this formula is closed wrt. "boundVariables", "false" otherwise.

    • getUnboundVariables

      public Set<Variable> getUnboundVariables()
      Returns:
      a set of of unbound variables

    • isWellBound

      public boolean isWellBound()
      Description copied from interface: QuantifiedFormula
      Checks whether this formula is well-bound, i.e. whether no variable bound by a quantifier is again bound by another quantifier within the first quantifier's range.
      Returns:
      "true" if this formula is well-bound, "false" otherwise.

    • isWellBound

      public boolean isWellBound(Set<Variable> boundVariables)
      Description copied from interface: QuantifiedFormula
      Checks whether this formula is well-bound, i.e. whether no variable bound by a quantifier is again bound by another quantifier within the first quantifier range. Every variable in "boundVariables" is assumed to be bound already.
      Parameters:
      boundVariables - the variables assumed to be bound.
      Returns:
      "true" if this formula is well-bound, "false" otherwise.

    • combineWithAnd

      public Conjunction combineWithAnd(Conjunctable f)
      Description copied from interface: Conjunctable
      Returns a conjunction of this and the given formula.
      Specified by:
      combineWithAnd in interface Conjunctable
      Overrides:
      combineWithAnd in class FolFormula
      Parameters:
      f - a formula to be combined with AND and this.
      Returns:
      a conjunction of this and the given formula.

    • combineWithOr

      public Disjunction combineWithOr(Disjunctable f)
      Specified by:
      combineWithOr in interface Disjunctable
      Overrides:
      combineWithOr in class FolFormula
      Parameters:
      f - a formula to be combined with OR and this.
      Returns:
      a disjunction of this and the given formula.

    • complement

      public RelationalFormula complement()
      Specified by:
      complement in interface Invertable
      Overrides:
      complement in class FolFormula
      Returns:
      the complement of this formula.

    • isLiteral

      public boolean isLiteral()
      Returns:
      true if the formula represents a literal in the language or false otherwise

    • 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

    • getQuantifierVariables

      public Set<Variable> getQuantifierVariables()
      Specified by:
      getQuantifierVariables in interface QuantifiedFormula
      Overrides:
      getQuantifierVariables in class FolFormula
      Returns:
      a set containing all quantified variables

    • 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

    • containsModalityOperator

      public boolean containsModalityOperator()
      Checks whether this formula contains a modal operator ("necessity" operator or "possibility" operator).
      Returns:
      true if formula contains modality, false otherwise