Package org.tweetyproject.logics.commons.syntax.interfaces

Interface SimpleLogicalFormula

All Superinterfaces:
Formula
All Known Subinterfaces:
AssociativeFormula<T>, Atom, ClassicalFormula, ComplexLogicalFormula, Conjunctable, Disjunctable, Invertable, QuantifiedFormula
All Known Implementing Classes:
AbaElement, AbaRule, AbstractGraphLdoModality, AbstractLdoModality, AggregateAtom, AggregateElement, AggregateHead, AlwaysQuery, ASPAtom, ASPBodyElement, ASPElement, ASPHead, ASPLiteral, ASPRule, AssertionalAxiom, AssociativeDlFormula, AssociativeFolFormula, AssociativeFormulaSupport, AssociativePlFormula, Assumption, AtomicConcept, AtomicRole, BottomConcept, ChoiceElement, ChoiceHead, ClassicalHead, ComparativeAtom, Complement, ComplexConcept, ComplexLogicalFormulaAdapter, ConceptAssertion, Conditional, Conjunction, Conjunction, Contradiction, Contradiction, DefaultNegation, DefaultRule, DefeasibleInferenceRule, DefeasibleRule, DelpFact, DelpRule, Disjunction, Disjunction, DlAxiom, Equivalence, Equivalence, EquivalenceAxiom, ExclusiveDisjunction, ExclusiveDisjunction, ExistentialRestriction, ExistsQuantifiedFormula, ExistsQuantifiedFormula, FolAtom, FolFormula, ForallQuantifiedFormula, ForallQuantifiedFormula, HoldsQuery, Implication, Implication, Indecision, InferenceRule, InferenceRule, Intersection, LdoArgument, LdoAssociativeFormula, LdoBoxModality, LdoConjunction, LdoDiamondModality, LdoDisjunction, LdoFormula, LdoGraphBoxModality, LdoGraphDiamondModality, LdoNegation, LdoRelation, MlFormula, MlnFormula, NecessarilyQuery, Necessity, Negation, Negation, Negation, NLPNot, NLPRule, OptimizationElement, OptimizationStatement, PlFormula, Possibility, ProbabilisticConditional, Proposition, QueryProposition, RelationalConditional, RelationalFormula, RelationalProbabilisticConditional, RoleAssertion, SpecialFormula, SpecialFormula, StrictInferenceRule, StrictNegation, StrictRule, Tautology, Tautology, TopConcept, Union, UniversalRestriction, WeakNegation
public interface SimpleLogicalFormula extends Formula
A formula of a logical language
Author:
Tim Janus

  • Method Details

    • getAtoms

      Set<? extends Atom> getAtoms()
      Processes the set of all atoms which appear in this formula
      Returns:
      The set of all atoms

    • getPredicates

      Set<? extends Predicate> getPredicates()
      Processes the set of all predicates which appear in this formula
      Returns:
      all predicates that appear in this formula

    • getPredicateCls

      Class<? extends Predicate> getPredicateCls()
      Returns:
      The class description of the predicate used by this formula.

    • isLiteral

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

    • hashCode

      int hashCode()
      Overrides:
      hashCode in class Object

    • equals

      boolean equals(Object other)
      Overrides:
      equals in class Object

    • clone

      SimpleLogicalFormula clone()
      Creates a deep copy of this formula
      Returns:
      the cloned formula