net.sf.tweety.logics.rcl.syntax

Class RelationalConditional

java.lang.Object

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

net.sf.tweety.logics.rcl.syntax.RelationalConditional

All Implemented Interfaces:

Formula, Rule<FolFormula,FolFormula>, ClassicalFormula, ComplexLogicalFormula, Conjuctable, Disjunctable, Invertable, LogicStructure, ProbabilityAware, QuantifiedFormula, SimpleLogicalFormula

Direct Known Subclasses:

RelationalProbabilisticConditional

public class RelationalConditional
extends RelationalFormula
implements Rule<FolFormula,FolFormula>

Instances of this class represent relational conditionals.
Premise and conclusion of this conditional must confirm to a fol language without quantifiers and without functions (@see net.sf.tweety.logics.firstorderlogic.lang.FolLanguageNoQuantifiersNoFunctions)

Author:

Matthias Thimm

Field Summary

Fields

Modifier and Type	Field and Description
private FolFormula	conclusion The conclusion of the conditional.
private FolFormula	premise The premise of the conditional.

Constructor Summary

Constructors

Constructor and Description
RelationalConditional(FolFormula conclusion) Creates a new conditional with the given conclusion and a tautological premise.
RelationalConditional(FolFormula premise, FolFormula conclusion) Creates a new conditional with the given premise and conclusion.

Method Summary

Modifier and Type	Method and Description
void	addPremise(FolFormula premise)
void	addPremises(java.util.Collection<? extends FolFormula> premises)
RelationalConditional	clone() Creates a deep copy of this formula
Conjunction	combineWithAnd(Conjuctable f) Returns a conjunction of this and the given formula.
Disjunction	combineWithOr(Disjunctable f)
RelationalFormula	complement()
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	getConclusion() Returns the conclusion of this rule.
java.util.Set<Functor>	getFunctors()
java.util.Set<Predicate>	getPredicates() Processes the set of all predicates which appear in this formula
java.util.Collection<? extends FolFormula>	getPremise() Returns the premise of this rule.
java.util.Set<Variable>	getQuantifierVariables()
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()
Probability	getUniformProbability()
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	isConstraint()
boolean	isFact() Checks whether this conditional is a fact, i.e.
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.
void	setConclusion(FolFormula conclusion)
RelationalFormula	substitute(Term<?> v, Term<?> t) Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.
java.lang.String	toString()

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

Methods inherited from interface net.sf.tweety.commons.util.rules.Rule

getSignature

Field Detail

premise

private FolFormula premise

The premise of the conditional.

conclusion

private FolFormula conclusion

The conclusion of the conditional.

Constructor Detail

RelationalConditional

public RelationalConditional(FolFormula premise,
                             FolFormula conclusion)

Creates a new conditional with the given premise and conclusion.

Parameters:

premise - a fol formula.

conclusion - a fol formula.

RelationalConditional

public RelationalConditional(FolFormula conclusion)

Creates a new conditional with the given conclusion and a tautological premise.

Parameters:

conclusion - a fol formula.

Method Detail

containsQuantifier

public boolean containsQuantifier()

Description copied from interface: QuantifiedFormula

Checks whether this formula contains any quantification.

Specified by:

containsQuantifier in interface QuantifiedFormula

Returns:

"true" if this formula contains a quantification.

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.

getPredicates

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

Description copied from interface: SimpleLogicalFormula

Processes the set of all predicates which appear in this formula

Specified by:

getPredicates in interface SimpleLogicalFormula

Returns:

all predicates that appear in this formula

getUnboundVariables

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

Specified by:

getUnboundVariables in interface QuantifiedFormula

Returns:

a set of of unbound variables

isFact

public boolean isFact()

Checks whether this conditional is a fact, i.e. has a tautological premise.

Specified by:

isFact in interface Rule<FolFormula,FolFormula>

Returns:

"true" iff this conditional is a fact.

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.

Specified by:

isClosed in interface QuantifiedFormula

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.

Specified by:

isClosed in interface QuantifiedFormula

Parameters:

boundVariables - the variables assumed to be bound.

Returns:

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

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.

Specified by:

isWellBound in interface QuantifiedFormula

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.

Specified by:

isWellBound in interface QuantifiedFormula

Parameters:

boundVariables - the variables assumed to be bound.

Returns:

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

substitute

public RelationalFormula 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 RelationalFormula

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

toString

public java.lang.String toString()

Specified by:

toString in class RelationalFormula

getFunctors

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

Specified by:

getFunctors in class RelationalFormula

Returns:

all functor that appear in this formula.

getConclusion

public FolFormula getConclusion()

Description copied from interface: Rule

Returns the conclusion of this rule.

Specified by:

getConclusion in interface Rule<FolFormula,FolFormula>

Returns:

the conclusion of this rule.

getPremise

public java.util.Collection<? extends FolFormula> getPremise()

Description copied from interface: Rule

Returns the premise of this rule.

Specified by:

getPremise in interface Rule<FolFormula,FolFormula>

Returns:

the premise of this rule.

combineWithAnd

public Conjunction combineWithAnd(Conjuctable f)

Description copied from interface: Conjuctable

Returns a conjunction of this and the given formula.

Specified by:

combineWithAnd in interface Conjuctable

Specified by:

combineWithAnd in class RelationalFormula

Parameters:

f - a formula to be combined with AND and this.

Returns:

a conjunction of this and the given formula.

combineWithOr

public Disjunction combineWithOr(Disjunctable f)

Specified by:

combineWithOr in interface Disjunctable

Specified by:

combineWithOr in class RelationalFormula

Parameters:

f - a formula to be combined with OR and this.

Returns:

a disjunction of this and the given formula.

complement

public RelationalFormula complement()

Specified by:

complement in interface Invertable

Specified by:

complement in class RelationalFormula

Returns:

the complement of this formula.

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

getUniformProbability

public Probability getUniformProbability()

Specified by:

getUniformProbability in interface ProbabilityAware

Specified by:

getUniformProbability in class RelationalFormula

Returns:

this formula's probability in the uniform distribution.

isLiteral

public boolean isLiteral()

Specified by:

isLiteral in interface SimpleLogicalFormula

Returns:

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

getTerms

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

Specified by:

getTerms in interface LogicStructure

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.

Specified by:

getTerms in interface LogicStructure

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

getQuantifierVariables

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

Specified by:

getQuantifierVariables in interface QuantifiedFormula

Returns:

a set containing all quantified variables

clone

public RelationalConditional 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 RelationalFormula

isConstraint

public boolean isConstraint()

Specified by:

isConstraint in interface Rule<FolFormula,FolFormula>

setConclusion

public void setConclusion(FolFormula conclusion)

Specified by:

setConclusion in interface Rule<FolFormula,FolFormula>

addPremise

public void addPremise(FolFormula premise)

Specified by:

addPremise in interface Rule<FolFormula,FolFormula>

addPremises

public void addPremises(java.util.Collection<? extends FolFormula> premises)

Specified by:

addPremises in interface Rule<FolFormula,FolFormula>