Package net.sf.tweety.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, AlwaysQuery, ASPAtom, ASPBodyElement, ASPElement, ASPHead, ASPLiteral, ASPRule, AssertionalAxiom, AssociativeDlFormula, AssociativeFolFormula, AssociativeFormulaSupport, AssociativePlFormula, Assumption, AtomicConcept, AtomicRole, BottomConcept, 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, InferenceRule, InferenceRule, Intersection, LdoArgument, LdoAssociativeFormula, LdoBoxModality, LdoConjunction, LdoDiamondModality, LdoDisjunction, LdoFormula, LdoGraphBoxModality, LdoGraphDiamondModality, LdoNegation, LdoRelation, MlFormula, MlnFormula, NecessarilyQuery, Necessity, Negation, Negation, Negation, NLPNot, NLPRule, PlFormula, Possibility, ProbabilisticConditional, Proposition, QueryProposition, RelationalConditional, RelationalFormula, RelationalProbabilisticConditional, RoleAssertion, SpecialFormula, SpecialFormula, StrictInferenceRule, StrictNegation, StrictRule, Tautology, Tautology, TopConcept, Union, UniversalRestriction

public interface SimpleLogicalFormula
extends Formula

A formula of a logical language

Author:

Tim Janus

Method Summary

Modifier and Type	Method	Description
SimpleLogicalFormula	clone()	Creates a deep copy of this formula
boolean	equals(java.lang.Object other)
java.util.Set<? extends Atom>	getAtoms()	Processes the set of all atoms which appear in this formula
java.lang.Class<? extends Predicate>	getPredicateCls()
java.util.Set<? extends Predicate>	getPredicates()	Processes the set of all predicates which appear in this formula
int	hashCode()
boolean	isLiteral()

Methods inherited from interface net.sf.tweety.commons.Formula

getSignature

Method Detail

getAtoms

java.util.Set<? extends Atom> getAtoms()

Processes the set of all atoms which appear in this formula

Returns:

The set of all atoms

getPredicates

java.util.Set<? extends Predicate> getPredicates()

Processes the set of all predicates which appear in this formula

Returns:

all predicates that appear in this formula

getPredicateCls

java.lang.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 java.lang.Object

equals

boolean equals(java.lang.Object other)

Overrides:

equals in class java.lang.Object

clone

SimpleLogicalFormula clone()

Creates a deep copy of this formula

Returns:

the cloned formula