net.sf.tweety.logics.fol.syntax

Class QuantifiedFormula

java.lang.Object

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

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

net.sf.tweety.logics.fol.syntax.QuantifiedFormula

All Implemented Interfaces:

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

Direct Known Subclasses:

ExistsQuantifiedFormula, ForallQuantifiedFormula

public abstract class QuantifiedFormula
extends FolFormula

The common parent of exists and forall quantified formulas, which contains common functionalities.

Author:

Matthias Thimm

Field Summary

Fields

Modifier and Type	Field and Description
private FolFormula	folFormula The folFormula this quantified folFormula ranges over.
private java.util.Set<Variable>	quantifier_variables The variables of this quantified folFormula.

Constructor Summary

Constructors

Constructor and Description
QuantifiedFormula(FolFormula folFormula, Variable variable) Creates a new quantified folFormula with the given folFormula and variable.
QuantifiedFormula(RelationalFormula folFormula, java.util.Set<Variable> variables) Creates a new quantified folFormula with the given folFormula and variables.

Method Summary

Modifier and Type	Method and Description
boolean	containsQuantifier() Checks whether this formula contains any quantification.
boolean	equals(java.lang.Object obj)
java.util.Set<FOLAtom>	getAtoms() Processes the set of all atoms which appear in this formula
FolFormula	getFormula() Returns the folFormula this quantified folFormula ranges over
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<QuantifiedFormula>	getQuantifiedFormulas()
java.util.Set<Variable>	getQuantifierVariables() Returns the variables of this quantified folFormula.
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.

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

clone, collapseAssociativeFormulas, combineWithAnd, combineWithOr, complement, getUniformProbability, substitute, toDnf, toNnf

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

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

Methods inherited from class java.lang.Object

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

Field Detail

folFormula

private FolFormula folFormula

The folFormula this quantified folFormula ranges over.

quantifier_variables

private java.util.Set<Variable> quantifier_variables

The variables of this quantified folFormula.

Constructor Detail

QuantifiedFormula

public QuantifiedFormula(RelationalFormula folFormula,
                         java.util.Set<Variable> variables)

Creates a new quantified folFormula with the given folFormula and variables.

Parameters:

folFormula - the folFormula this quantified folFormula ranges over.

variables - the variables of this quantified folFormula.

QuantifiedFormula

public QuantifiedFormula(FolFormula folFormula,
                         Variable variable)

Creates a new quantified folFormula with the given folFormula and variable.

Parameters:

folFormula - the folFormula this quantified folFormula ranges over.

variable - the variable of this quantified folFormula.

Method Detail

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.

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.

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

getFunctors

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

Specified by:

getFunctors in class RelationalFormula

Returns:

all functor that appear in this formula.

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.

getUnboundVariables

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

Returns:

a set of of unbound variables

getFormula

public FolFormula getFormula()

Returns the folFormula this quantified folFormula ranges over

Specified by:

getFormula in interface QuantifiedFormula

Overrides:

getFormula in class RelationalFormula

Returns:

the folFormula this quantified folFormula ranges over

getQuantifierVariables

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

Returns the variables of this quantified folFormula.

Specified by:

getQuantifierVariables in interface QuantifiedFormula

Overrides:

getQuantifierVariables in class FolFormula

Returns:

the variables of this quantified folFormula.

getQuantifiedFormulas

public java.util.Set<QuantifiedFormula> getQuantifiedFormulas()

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.

isLiteral

public boolean isLiteral()

Returns:

true if the formula represents a literal in the language or 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

hashCode

public int hashCode()

Specified by:

hashCode in interface SimpleLogicalFormula

Overrides:

hashCode in class java.lang.Object

equals

public boolean equals(java.lang.Object obj)

Specified by:

equals in interface SimpleLogicalFormula

Overrides:

equals in class java.lang.Object