net.sf.tweety.lp.nlp.syntax

Class NLPNot

java.lang.Object

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

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

net.sf.tweety.lp.nlp.syntax.NLPNot

All Implemented Interfaces:

Formula, ClassicalFormula, ComplexLogicalFormula, Conjuctable, Disjunctable, Invertable, LogicStructure, ProbabilityAware, QuantifiedFormula, SimpleLogicalFormula

public class NLPNot
extends FolFormula

A default negation of a first order formula, nested logic programs only allow not quantified formulas. The NLPNot wraps a FOLFormula and checks that this formula does not contain quantifiers, the functionality is delegated to the used inner formula instance.

Author:

Tim Janus

Field Summary

Fields

Modifier and Type	Field and Description
private FolFormula	inner

Constructor Summary

Constructors

Constructor and Description
NLPNot(FolFormula inner) Ctor: Creates a new default not for nested logic programs by using the given FOL formula as inner formula.

Method Summary

Modifier and Type	Method and Description
NLPNot	clone() Creates a deep copy of this formula
NLPNot	collapseAssociativeFormulas() This method collapses all associative operations appearing in this term, e.g.
boolean	containsQuantifier() Checks whether this formula contains any quantification.
boolean	equals(java.lang.Object other)
java.util.Set<FOLAtom>	getAtoms() Processes the set of all atoms which appear in this formula
java.util.Set<Functor>	getFunctors()
java.util.Set<? extends Predicate>	getPredicates() Processes the set of all predicates which appear in this formula
java.util.Set<Term<?>>	getTerms()
<C extends Term<?>> java.util.Set<C>	getTerms(java.lang.Class<C> cls) Processes the set containing all terms of type C.
java.util.Set<Variable>	getUnboundVariables()
int	hashCode()
boolean	isClosed() Checks whether this formula is closed, i.e.
boolean	isClosed(java.util.Set<Variable> boundVariables) Checks whether this formula is closed, i.e.
boolean	isDnf() Checks whether this formula is in disjunctive normal form.
boolean	isLiteral()
boolean	isWellBound() Checks whether this formula is well-bound, i.e.
boolean	isWellBound(java.util.Set<Variable> boundVariables) Checks whether this formula is well-bound, i.e.
NLPNot	substitute(Term<?> v, 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.
java.lang.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, getFormula, getPredicateCls, getSatisfactionRatio, getSignature, isGround, isWellFormed, substitute

Methods inherited from class java.lang.Object

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

Field Detail

inner

private FolFormula inner

Constructor Detail

NLPNot

public NLPNot(FolFormula inner)

Ctor: Creates a new default not for nested logic programs by using the given FOL formula as inner formula.

Parameters:

inner - The FOL formula used as inner formula.

Method Detail

getPredicates

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

Description copied from interface: SimpleLogicalFormula

Processes the set of all predicates which appear in this formula

Returns:

all predicates that appear in this formula

isLiteral

public boolean isLiteral()

Returns:

true if the formula represents a literal in the language or false otherwise

getUnboundVariables

public java.util.Set<Variable> getUnboundVariables()

Returns:

a set of of unbound variables

containsQuantifier

public boolean containsQuantifier()

Description copied from interface: QuantifiedFormula

Checks whether this formula contains any quantification.

Returns:

"true" if this formula contains a quantification.

isWellBound

public boolean isWellBound()

Description copied from interface: QuantifiedFormula

Checks whether this formula is well-bound, i.e. whether no variable bound by a quantifier is again bound by another quantifier within the first quantifier's range.

Returns:

"true" if this formula is well-bound, "false" otherwise.

isWellBound

public boolean isWellBound(java.util.Set<Variable> boundVariables)

Description copied from interface: QuantifiedFormula

Checks whether this formula is well-bound, i.e. whether no variable bound by a quantifier is again bound by another quantifier within the first quantifier range. Every variable in "boundVariables" is assumed to be bound already.

Parameters:

boundVariables - the variables assumed to be bound.

Returns:

"true" if this formula is well-bound, "false" otherwise.

isClosed

public boolean isClosed()

Description copied from interface: QuantifiedFormula

Checks whether this formula is closed, i.e. whether every variables occurring in the formula is bound by a quantifier.

Returns:

"true" if this formula is closed, "false" otherwise.

isClosed

public boolean isClosed(java.util.Set<Variable> boundVariables)

Description copied from interface: QuantifiedFormula

Checks whether this formula is closed, i.e. whether every variables occurring in the formula is bound by a quantifier. Every variable in "boundVariables" is already assumed to be bound.

Parameters:

boundVariables - the variables assumed to be bound.

Returns:

"true" if this formula is closed wrt. "boundVariables", "false" otherwise.

getTerms

public java.util.Set<Term<?>> getTerms()

Returns:

a set containing all terms of this logical structure

getTerms

public <C extends Term<?>> java.util.Set<C> getTerms(java.lang.Class<C> cls)

Description copied from interface: LogicStructure

Processes the set containing all terms of type C. This method uses the equals method of the given Class and therefore does not add terms which are sub classes of type C to the set.

Parameters:

cls - The Class structure containing type information about the searched term

Returns:

A set containing all terms of type C of this logical structure

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 NLPNot 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.

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.

substitute

public NLPNot substitute(Term<?> v,
                         Term<?> t)
                  throws java.lang.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 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:

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

clone

public NLPNot clone()

Description copied from interface: SimpleLogicalFormula

Creates a deep copy of this formula

Specified by:

clone in interface ComplexLogicalFormula

Specified by:

clone in interface SimpleLogicalFormula

Specified by:

clone in class FolFormula

getAtoms

public java.util.Set<FOLAtom> getAtoms()

Description copied from interface: SimpleLogicalFormula

Processes the set of all atoms which appear in this formula

Specified by:

getAtoms in interface SimpleLogicalFormula

Specified by:

getAtoms in class RelationalFormula

Returns:

all atoms that appear in this formula.

getFunctors

public java.util.Set<Functor> getFunctors()

Specified by:

getFunctors in class RelationalFormula

Returns:

all functor that appear in this formula.

toString

public java.lang.String toString()

Specified by:

toString in class RelationalFormula

equals

public boolean equals(java.lang.Object other)

Specified by:

equals in interface SimpleLogicalFormula

Overrides:

equals in class java.lang.Object

hashCode

public int hashCode()

Specified by:

hashCode in interface SimpleLogicalFormula

Overrides:

hashCode in class java.lang.Object