net.sf.tweety.logics.fol.syntax

Class Negation

java.lang.Object

net.sf.tweety.logics.fol.syntax.RelationalFormula

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

net.sf.tweety.logics.fol.syntax.Negation

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.Conjuctable, 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

public class Negation
extends FolFormula

The classical negation of first-order logic.

Author:

Matthias Thimm

Constructor Summary

Constructors

Constructor and Description
Negation(RelationalFormula formula)

Method Summary

Modifier and Type	Method and Description
Negation	clone()
FolFormula	collapseAssociativeFormulas() This method collapses all associative operations appearing in this term, e.g.
boolean	containsQuantifier()
boolean	equals(Object obj)
Set<FOLAtom>	getAtoms()
FolFormula	getFormula()
Set<net.sf.tweety.logics.commons.syntax.Functor>	getFunctors()
Set<? extends net.sf.tweety.logics.commons.syntax.Predicate>	getPredicates()
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()
int	hashCode()
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)
Negation	substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t) Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.
FolFormula	toNnf() Makes the negation normal form of this formula.
String	toString()

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

combineWithAnd, combineWithOr, complement, getQuantifierVariables, getUniformProbability, toDnf

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

allGroundInstances, allSubstitutions, containsTermsOfType, exchange, getPredicateCls, getSatisfactionRatio, getSignature, isGround, isWellFormed, substitute

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait

Constructor Detail

Negation

public Negation(RelationalFormula formula)

Method Detail

getFormula

public FolFormula getFormula()

Specified by:

getFormula in interface net.sf.tweety.logics.commons.syntax.interfaces.QuantifiedFormula

Overrides:

getFormula in class RelationalFormula

getPredicates

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

getFunctors

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

Specified by:

getFunctors in class RelationalFormula

Returns:

all functor that appear in this formula.

getAtoms

public Set<FOLAtom> getAtoms()

Specified by:

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

Specified by:

getAtoms in class RelationalFormula

Returns:

all atoms that appear in this formula.

containsQuantifier

public boolean containsQuantifier()

isClosed

public boolean isClosed()

substitute

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

Description copied from class: RelationalFormula

Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula. NOTE: if "v" is a variable and bound to a quantifier then "v" is not substituted in that quantifiers inner formula.

Specified by:

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

Specified by:

substitute in class FolFormula

Parameters:

v - the term to be substituted.

t - the term to substitute.

Returns:

a formula where every occurrence of "v" is replaced by "t".

Throws:

IllegalArgumentException - if "v" and "t" are of different sorts (NOTE: this exception is only thrown when "v" actually appears in this formula).

isClosed

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

getUnboundVariables

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

isWellBound

public boolean isWellBound()

isWellBound

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

isLiteral

public boolean isLiteral()

toString

public String toString()

Specified by:

toString in class RelationalFormula

hashCode

public int hashCode()

Specified by:

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

Overrides:

hashCode in class Object

equals

public boolean equals(Object obj)

Specified by:

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

Overrides:

equals in class Object

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.

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)

clone

public Negation clone()

Specified by:

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

Specified by:

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

Specified by:

clone in class FolFormula