Package net.sf.tweety.logics.fol.syntax

Class SpecialFormula

java.lang.Object

net.sf.tweety.logics.commons.syntax.RelationalFormula

net.sf.tweety.logics.fol.syntax.FolFormula

net.sf.tweety.logics.fol.syntax.SpecialFormula

All Implemented Interfaces:

net.sf.tweety.commons.Formula, net.sf.tweety.logics.commons.syntax.interfaces.ClassicalFormula, net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula, net.sf.tweety.logics.commons.syntax.interfaces.Conjunctable, net.sf.tweety.logics.commons.syntax.interfaces.Disjunctable, net.sf.tweety.logics.commons.syntax.interfaces.Invertable, net.sf.tweety.logics.commons.syntax.interfaces.LogicStructure, net.sf.tweety.logics.commons.syntax.interfaces.ProbabilityAware, net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula, net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula

Direct Known Subclasses:

Contradiction, Tautology

public abstract class SpecialFormula
extends FolFormula

This class captures the common functionalities of the special formulas tautology and contradiction.

Author:

Matthias Thimm

Constructor Summary

Constructors

Constructor	Description
SpecialFormula()

Method Summary

Modifier and Type	Method	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<?>> Set<C>	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.

Methods inherited from class net.sf.tweety.logics.fol.syntax.FolFormula

clone, combineWithAnd, combineWithOr, complement, getQuantifierVariables, getSignature, getUniformProbability, toDnf

Methods inherited from class net.sf.tweety.logics.commons.syntax.RelationalFormula

allGroundInstances, allSubstitutions, containsTermsOfType, exchange, getFormula, getPredicateCls, getSatisfactionRatio, isGround, isWellFormed, substitute, toString

Methods inherited from class java.lang.Object

equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Methods inherited from interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula

equals, hashCode

Constructor Detail

SpecialFormula

public SpecialFormula()

Method Detail

containsQuantifier

public boolean containsQuantifier()

getTerms

public Set<net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> getTerms()

getTerms

public <C extends net.sf.tweety.logics.commons.syntax.interfaces.Term<?>> Set<C> getTerms(Class<C> cls)

getAtoms

public Set<FolAtom> getAtoms()

Specified by:

getAtoms in interface net.sf.tweety.logics.commons.syntax.interfaces.SimpleLogicalFormula

Specified by:

getAtoms in class net.sf.tweety.logics.commons.syntax.RelationalFormula

getPredicates

public Set<net.sf.tweety.logics.commons.syntax.Predicate> getPredicates()

isClosed

public boolean isClosed()

isClosed

public boolean isClosed(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)

isWellBound

public boolean isWellBound()

isWellBound

public boolean isWellBound(Set<net.sf.tweety.logics.commons.syntax.Variable> boundVariables)

isLiteral

public boolean isLiteral()

substitute

public FolFormula substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v,
                             net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)

Specified by:

substitute in interface net.sf.tweety.logics.commons.syntax.interfaces.ComplexLogicalFormula

Specified by:

substitute in class FolFormula

getUnboundVariables

public Set<net.sf.tweety.logics.commons.syntax.Variable> getUnboundVariables()

getFunctors

public Set<net.sf.tweety.logics.commons.syntax.Functor> getFunctors()

Specified by:

getFunctors in class net.sf.tweety.logics.commons.syntax.RelationalFormula

getQuantifiedFormulas

public Set<FolFormula> getQuantifiedFormulas()

getDisjunctions

public Set<Disjunction> getDisjunctions()

getConjunctions

public Set<Conjunction> getConjunctions()

isDnf

public boolean isDnf()

Description copied from class: FolFormula

Checks whether this formula is in disjunctive normal form.

Specified by:

isDnf in class FolFormula

Returns:

"true" iff this formula is in disjunctive normal form.

toNnf

public FolFormula toNnf()

Description copied from class: FolFormula

Makes the negation normal form of this formula.

Specified by:

toNnf in class FolFormula

Returns:

the NNF of this formula

collapseAssociativeFormulas

public FolFormula collapseAssociativeFormulas()

Description copied from class: FolFormula

This method collapses all associative operations appearing in this term, e.g. every a||(b||c) becomes a||b||c.

Specified by:

collapseAssociativeFormulas in class FolFormula

Returns:

the collapsed formula.