Uses of Class
net.sf.tweety.logics.commons.syntax.RelationalFormula

Packages that use RelationalFormula

Package	Description
net.sf.tweety.arg.delp.syntax
net.sf.tweety.logics.commons.syntax
net.sf.tweety.logics.fol.syntax
net.sf.tweety.logics.fol.writer
net.sf.tweety.logics.ml.parser
net.sf.tweety.logics.ml.syntax
net.sf.tweety.logics.ml.writer
net.sf.tweety.logics.mln.syntax
net.sf.tweety.logics.rcl.syntax
net.sf.tweety.logics.rdl.syntax
net.sf.tweety.logics.rpcl.syntax
net.sf.tweety.lp.nlp.syntax

Uses of RelationalFormula in net.sf.tweety.arg.delp.syntax

Subclasses of RelationalFormula in net.sf.tweety.arg.delp.syntax

Modifier and Type	Class	Description
class	DefeasibleRule	This class models a defeasible rule in defeasible logic programming.
class	DelpFact	This class implements a fact in defeasible logic programming which encapsulates a literal.
class	DelpRule	This method is the superclass for both a strict rule and a defeasible rule in defeasible logic programming and captures their common attributes and methods.
class	StrictRule	This class models a strict rule in defeasible logic programming.

Methods in net.sf.tweety.arg.delp.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	DefeasibleRule.clone()
RelationalFormula	StrictRule.clone()
RelationalFormula	DelpRule.complement()
RelationalFormula	DefeasibleRule.substitute(Term<?> v, Term<?> t)
RelationalFormula	DelpFact.substitute(Term<?> v, Term<?> t)
abstract RelationalFormula	DelpRule.substitute(Term<?> v, Term<?> t)
RelationalFormula	StrictRule.substitute(Term<?> v, Term<?> t)

Uses of RelationalFormula in net.sf.tweety.logics.commons.syntax

Classes in net.sf.tweety.logics.commons.syntax with type parameters of type RelationalFormula

Modifier and Type	Class	Description
class	QuantifiedFormulaSupport<T extends RelationalFormula>	This class provides common functionalities for quantified formulas, i.e.

Methods in net.sf.tweety.logics.commons.syntax that return RelationalFormula

Modifier and Type	Method	Description
abstract RelationalFormula	RelationalFormula.clone()
abstract RelationalFormula	RelationalFormula.complement()
RelationalFormula	RelationalFormula.exchange(Term<?> v, Term<?> t)	Substitutes all occurrences of term "v" in this formula by term "t" and at the same time replaces all occurrences of term "t" by term "v" and eventually returns the new formula.
RelationalFormula	RelationalFormula.getFormula()
RelationalFormula	RelationalFormula.substitute(java.util.Map<? extends Term<?>,? extends Term<?>> map)	Substitutes all occurrences of all terms "v" in map.keyset() in this formula by map.get(v) and returns the new formula. NOTE: variables bound to quantifiers are not substituted in their inner formulas even if they appear in the map.
abstract RelationalFormula	RelationalFormula.substitute(Term<?> v, Term<?> t)	Substitutes all occurrences of term "v" in this formula by term "t" and returns the new formula.

Methods in net.sf.tweety.logics.commons.syntax that return types with arguments of type RelationalFormula

Modifier and Type	Method	Description
java.util.Set<RelationalFormula>	RelationalFormula.allGroundInstances(java.util.Set<Constant> constants)	Computes all ground instances of this relational formula wrt.

Uses of RelationalFormula in net.sf.tweety.logics.fol.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.fol.syntax

Modifier and Type	Class	Description
class	AssociativeFolFormula	This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.
class	Conjunction	The classical conjunction of first-order logic.
class	Contradiction	A contradictory formula.
class	Disjunction	The classical disjunction of first-order logic.
class	Equivalence	The equivalence of first-order logic.
class	ExclusiveDisjunction	The exclusive disjunction (XOR) in first-order logic.
class	ExistsQuantifiedFormula	Exists-quantified first-order logic formula.
class	FolAtom	An atom in first-order logic, i.e.
class	FolFormula	The common abstract class for formulas of first-order logic.
class	ForallQuantifiedFormula	For-All-quantified first-order logic formula.
class	Implication	The implication of first-order logic.
class	Negation	The classical negation of first-order logic.
class	SpecialFormula	This class captures the common functionalities of the special formulas tautology and contradiction.
class	Tautology	A tautological formula.

Methods in net.sf.tweety.logics.fol.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	Conjunction.collapseAssociativeFormulas()
RelationalFormula	Disjunction.collapseAssociativeFormulas()
RelationalFormula	Equivalence.collapseAssociativeFormulas()
RelationalFormula	ExclusiveDisjunction.collapseAssociativeFormulas()
abstract RelationalFormula	FolFormula.collapseAssociativeFormulas()	This method collapses all associative operations appearing in this term, e.g.
RelationalFormula	Implication.collapseAssociativeFormulas()
RelationalFormula	FolFormula.complement()
RelationalFormula	AssociativeFolFormula.get(int index)
RelationalFormula	AssociativeFolFormula.remove(int index)
RelationalFormula	AssociativeFolFormula.set(int index, RelationalFormula element)

Methods in net.sf.tweety.logics.fol.syntax that return types with arguments of type RelationalFormula

Modifier and Type	Method	Description
java.util.List<RelationalFormula>	AssociativeFolFormula.getFormulas()
Pair<RelationalFormula,RelationalFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
Pair<RelationalFormula,RelationalFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
Pair<RelationalFormula,RelationalFormula>	Implication.getFormulas()	Returns the formulas of the implication.
Pair<RelationalFormula,RelationalFormula>	Implication.getFormulas()	Returns the formulas of the implication.
java.util.Iterator<RelationalFormula>	AssociativeFolFormula.iterator()
java.util.ListIterator<RelationalFormula>	AssociativeFolFormula.listIterator()
java.util.ListIterator<RelationalFormula>	AssociativeFolFormula.listIterator(int index)
java.util.List<RelationalFormula>	AssociativeFolFormula.subList(int fromIndex, int toIndex)

Methods in net.sf.tweety.logics.fol.syntax with parameters of type RelationalFormula

Modifier and Type	Method	Description
void	AssociativeFolFormula.add(int index, RelationalFormula element)
boolean	AssociativeFolFormula.add(RelationalFormula e)
RelationalFormula	AssociativeFolFormula.set(int index, RelationalFormula element)
void	Equivalence.setFormulas(RelationalFormula formula1, RelationalFormula formula2)	Sets the formulas of the equivalence.
void	Implication.setFormulas(RelationalFormula left, RelationalFormula right)	Sets the formulas of the implication.

Method parameters in net.sf.tweety.logics.fol.syntax with type arguments of type RelationalFormula

Modifier and Type	Method	Description
boolean	AssociativeFolFormula.addAll(int index, java.util.Collection<? extends RelationalFormula> c)
boolean	AssociativeFolFormula.addAll(java.util.Collection<? extends RelationalFormula> c)
void	Equivalence.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)	Sets the formulas of the equivalence.
void	Equivalence.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)	Sets the formulas of the equivalence.
void	Implication.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)	Sets the formulas of the implication.
void	Implication.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)	Sets the formulas of the implication.

Constructors in net.sf.tweety.logics.fol.syntax with parameters of type RelationalFormula

Constructor	Description
AssociativeFolFormula(RelationalFormula first, RelationalFormula second)	Creates a new associative formula with the two given formulae
Conjunction(RelationalFormula first, RelationalFormula second)	Creates a new conjunction with the two given formulae
Disjunction(RelationalFormula first, RelationalFormula second)	Creates a new disjunction with the two given formulae
Equivalence(RelationalFormula a, RelationalFormula b)	Creates a new equivalence with the given two formulas
ExclusiveDisjunction(RelationalFormula first, RelationalFormula second)	Creates a new exclusive disjunction with the two given formulae
ExistsQuantifiedFormula(RelationalFormula folFormula, java.util.Set<Variable> variables)	Creates a new quantified folFormula with the given folFormula and variables.
ExistsQuantifiedFormula(RelationalFormula folFormula, Variable variable)	Creates a new quantified folFormula with the given folFormula and variable.
ForallQuantifiedFormula(RelationalFormula folFormula, java.util.Set<Variable> variables)	Creates a new quantified folFormula with the given folFormula and variables.
ForallQuantifiedFormula(RelationalFormula folFormula, Variable variable)	Creates a new quantified folFormula with the given folFormula and variable.
Implication(RelationalFormula a, RelationalFormula b)	Creates a new implication a=>b with the two given formulas
Negation(RelationalFormula formula)

Constructor parameters in net.sf.tweety.logics.fol.syntax with type arguments of type RelationalFormula

Constructor	Description
AssociativeFolFormula(java.util.Collection<? extends RelationalFormula> formulas)	Creates a new associative formula with the given inner formulas.
Conjunction(java.util.Collection<? extends RelationalFormula> formulas)	Creates a new conjunction with the given inner formulas.
Disjunction(java.util.Collection<? extends RelationalFormula> formulas)	Creates a new disjunction with the given inner formulas.
Equivalence(Pair<RelationalFormula,RelationalFormula> formulas)	Creates a new equivalence with the given pair of formulas
Equivalence(Pair<RelationalFormula,RelationalFormula> formulas)	Creates a new equivalence with the given pair of formulas
ExclusiveDisjunction(java.util.Collection<? extends RelationalFormula> formulas)	Creates a new exclusive disjunction with the given inner formulas.
Implication(Pair<RelationalFormula,RelationalFormula> formulas)	Creates a new implication with the given pair of formulas
Implication(Pair<RelationalFormula,RelationalFormula> formulas)	Creates a new implication with the given pair of formulas

Uses of RelationalFormula in net.sf.tweety.logics.fol.writer

Methods in net.sf.tweety.logics.fol.writer with parameters of type RelationalFormula

Modifier and Type	Method	Description
void	SPASSWriter.printProblem(FolBeliefSet kb, RelationalFormula formula)	Prints the contents of a SPASS problem file for a given knowledge base and a formula.

Uses of RelationalFormula in net.sf.tweety.logics.ml.parser

Methods in net.sf.tweety.logics.ml.parser that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	MlParser.parseFormula(java.io.Reader reader)

Uses of RelationalFormula in net.sf.tweety.logics.ml.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.ml.syntax

Modifier and Type	Class	Description
class	MlFormula	This class models a modal formula, i.e.
class	Necessity	This class models the necessity modality.
class	Possibility	This class models the possibility modality.

Methods in net.sf.tweety.logics.ml.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	Necessity.collapseAssociativeFormulas()
RelationalFormula	Possibility.collapseAssociativeFormulas()
RelationalFormula	MlFormula.complement()
RelationalFormula	MlFormula.getFormula()	Returns the inner formula of this modal formula.

Constructors in net.sf.tweety.logics.ml.syntax with parameters of type RelationalFormula

Constructor	Description
MlFormula(RelationalFormula formula)
Necessity(RelationalFormula formula)	Creates a new necessity formula with the given inner formula
Possibility(RelationalFormula formula)	Creates a new possibility formula with the given inner formula

Constructor parameters in net.sf.tweety.logics.ml.syntax with type arguments of type RelationalFormula

Constructor	Description
MlBeliefSet(java.util.Set<RelationalFormula> formulas)	Creates a new modal knowledge base with the given set of formulas.

Uses of RelationalFormula in net.sf.tweety.logics.ml.writer

Methods in net.sf.tweety.logics.ml.writer with parameters of type RelationalFormula

Modifier and Type	Method	Description
void	SPASSWriter.printProblem(MlBeliefSet kb, RelationalFormula formula)	Prints the contents of a SPASS problem file for a given knowledge base and a formula.
void	MleanCoPWriter.printQuery(RelationalFormula f)	Prints the query.

Constructors in net.sf.tweety.logics.ml.writer with parameters of type RelationalFormula

Constructor	Description
MlWriter(RelationalFormula formula)

Uses of RelationalFormula in net.sf.tweety.logics.mln.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.mln.syntax

Modifier and Type	Class	Description
class	MlnFormula	Instances of this class represent first-order formulas with a weight.

Methods in net.sf.tweety.logics.mln.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	MlnFormula.clone()
RelationalFormula	MlnFormula.complement()
RelationalFormula	MlnFormula.substitute(Term<?> v, Term<?> t)

Uses of RelationalFormula in net.sf.tweety.logics.rcl.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.rcl.syntax

Modifier and Type	Class	Description
class	RelationalConditional	Instances of this class represent relational conditionals.

Methods in net.sf.tweety.logics.rcl.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	RelationalConditional.complement()
RelationalFormula	RelationalConditional.substitute(Term<?> v, Term<?> t)

Uses of RelationalFormula in net.sf.tweety.logics.rdl.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.rdl.syntax

Modifier and Type	Class	Description
class	DefaultRule	Models a default rule in Reiter's default logic, see [R.

Methods in net.sf.tweety.logics.rdl.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	DefaultRule.clone()
RelationalFormula	DefaultRule.complement()
RelationalFormula	DefaultRule.substitute(Term<?> v, Term<?> t)

Uses of RelationalFormula in net.sf.tweety.logics.rpcl.syntax

Subclasses of RelationalFormula in net.sf.tweety.logics.rpcl.syntax

Modifier and Type	Class	Description
class	RelationalProbabilisticConditional	This class represents a relational probabilistic conditional, i.e.

Methods in net.sf.tweety.logics.rpcl.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	RelationalProbabilisticConditional.substitute(Term<?> v, Term<?> t)

Uses of RelationalFormula in net.sf.tweety.lp.nlp.syntax

Subclasses of RelationalFormula in net.sf.tweety.lp.nlp.syntax

Modifier and Type	Class	Description
class	NLPNot	A default negation of a first order formula, nested logic programs only allow not quantified formulas.