public abstract class SpecialFormula extends FolFormula
| Constructor and Description |
|---|
SpecialFormula() |
| Modifier and Type | Method and Description |
|---|---|
FolFormula |
collapseAssociativeFormulas()
This method collapses all associative operations appearing
in this term, e.g.
|
boolean |
containsQuantifier() |
Set<FOLAtom> |
getAtoms() |
Set<Conjunction> |
getConjunctions() |
Set<Disjunction> |
getDisjunctions() |
Set<net.sf.tweety.logics.commons.syntax.Functor> |
getFunctors() |
Set<net.sf.tweety.logics.commons.syntax.Predicate> |
getPredicates() |
Set<FolFormula> |
getQuantifiedFormulas() |
Set<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> |
getTerms() |
<C extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> |
getTerms(Class<C> cls) |
Set<net.sf.tweety.logics.commons.syntax.Variable> |
getUnboundVariables() |
boolean |
isClosed() |
boolean |
isClosed(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables) |
boolean |
isDnf()
Checks whether this formula is in disjunctive normal form.
|
boolean |
isLiteral() |
boolean |
isWellBound() |
boolean |
isWellBound(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables) |
FolFormula |
substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v,
net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t) |
FolFormula |
toNnf()
Makes the negation normal form of this formula.
|
clone, combineWithAnd, combineWithOr, complement, getQuantifierVariables, getSignature, getUniformProbability, toDnfallGroundInstances, allSubstitutions, containsTermsOfType, exchange, getFormula, getPredicateCls, getSatisfactionRatio, isGround, isWellFormed, substitute, toStringpublic boolean containsQuantifier()
public Set<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> getTerms()
public <C extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> Set<C> getTerms(Class<C> cls)
public Set<FOLAtom> getAtoms()
getAtoms in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormulagetAtoms in class net.sf.tweety.logics.commons.syntax.RelationalFormulapublic Set<net.sf.tweety.logics.commons.syntax.Predicate> getPredicates()
public boolean isClosed()
public boolean isClosed(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)
public boolean isWellBound()
public boolean isWellBound(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)
public boolean isLiteral()
public FolFormula substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)
substitute in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormulasubstitute in class FolFormulapublic Set<net.sf.tweety.logics.commons.syntax.Variable> getUnboundVariables()
public Set<net.sf.tweety.logics.commons.syntax.Functor> getFunctors()
getFunctors in class net.sf.tweety.logics.commons.syntax.RelationalFormulapublic Set<FolFormula> getQuantifiedFormulas()
public Set<Disjunction> getDisjunctions()
public Set<Conjunction> getConjunctions()
public boolean isDnf()
FolFormulaisDnf in class FolFormulapublic FolFormula toNnf()
FolFormulatoNnf in class FolFormulapublic FolFormula collapseAssociativeFormulas()
FolFormulacollapseAssociativeFormulas in class FolFormulaCopyright © 2018. All rights reserved.