Uses of Class
org.tweetyproject.logics.commons.syntax.RelationalFormula

Packages that use RelationalFormula

Package	Description
org.tweetyproject.arg.delp.syntax
org.tweetyproject.logics.commons.syntax
org.tweetyproject.logics.fol.syntax
org.tweetyproject.logics.fol.writer
org.tweetyproject.logics.ml.parser
org.tweetyproject.logics.ml.syntax
org.tweetyproject.logics.ml.writer
org.tweetyproject.logics.mln.syntax
org.tweetyproject.logics.rcl.syntax
org.tweetyproject.logics.rdl.syntax
org.tweetyproject.logics.rpcl.syntax
org.tweetyproject.lp.nlp.syntax

Uses of RelationalFormula in org.tweetyproject.arg.delp.syntax

Subclasses of RelationalFormula in org.tweetyproject.arg.delp.syntax

Modifier and Type	Class	Description
class	DefeasibleRule	This class models a defeasible rule in defeasible logic programming.
final 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 org.tweetyproject.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 org.tweetyproject.logics.commons.syntax

Classes in org.tweetyproject.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 org.tweetyproject.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(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 org.tweetyproject.logics.commons.syntax that return types with arguments of type RelationalFormula

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

Uses of RelationalFormula in org.tweetyproject.logics.fol.syntax

Subclasses of RelationalFormula in org.tweetyproject.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.

Classes in org.tweetyproject.logics.fol.syntax that implement interfaces with type arguments of type RelationalFormula

Modifier and Type	Class	Description
class	AssociativeFolFormula	This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.

Methods in org.tweetyproject.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	Implication.getFirstFormula()	Get the left side formula of the implication left => right.
RelationalFormula	Implication.getSecondFormula()	Get the right side formula of the implication left => right
RelationalFormula	AssociativeFolFormula.remove(int index)
RelationalFormula	AssociativeFolFormula.set(int index, RelationalFormula element)

Methods in org.tweetyproject.logics.fol.syntax that return types with arguments of type RelationalFormula

Modifier and Type	Method	Description
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.
Iterator<RelationalFormula>	AssociativeFolFormula.iterator()
ListIterator<RelationalFormula>	AssociativeFolFormula.listIterator()
ListIterator<RelationalFormula>	AssociativeFolFormula.listIterator(int index)
List<RelationalFormula>	AssociativeFolFormula.subList(int fromIndex, int toIndex)

Methods in org.tweetyproject.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	Implication.setFirstFormula(RelationalFormula left)	Sets the left side formula of the implication left => right
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.
void	Implication.setSecondFormula(RelationalFormula right)	Sets the right side formula of the implication left => right

Method parameters in org.tweetyproject.logics.fol.syntax with type arguments of type RelationalFormula

Modifier and Type	Method	Description
boolean	AssociativeFolFormula.addAll(int index, Collection<? extends RelationalFormula> c)
boolean	AssociativeFolFormula.addAll(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 org.tweetyproject.logics.fol.syntax with parameters of type RelationalFormula

Modifier	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, 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, 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)	Relational formula to be negated.

Constructor parameters in org.tweetyproject.logics.fol.syntax with type arguments of type RelationalFormula

Modifier	Constructor	Description
	AssociativeFolFormula(Collection<? extends RelationalFormula> formulas)	Creates a new associative formula with the given inner formulas.
	Conjunction(Collection<? extends RelationalFormula> formulas)	Creates a new conjunction with the given inner formulas.
	Disjunction(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(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 org.tweetyproject.logics.fol.writer

Methods in org.tweetyproject.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 org.tweetyproject.logics.ml.parser

Subclasses with type arguments of type RelationalFormula in org.tweetyproject.logics.ml.parser

Modifier and Type	Class	Description
class	MlParser	This class implements a parser for modal logic.

Methods in org.tweetyproject.logics.ml.parser that return RelationalFormula

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

Uses of RelationalFormula in org.tweetyproject.logics.ml.syntax

Subclasses of RelationalFormula in org.tweetyproject.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.

Subclasses with type arguments of type RelationalFormula in org.tweetyproject.logics.ml.syntax

Modifier and Type	Class	Description
class	MlBeliefSet	This class models a modal knowledge base, i.e.

Methods in org.tweetyproject.logics.ml.syntax that return RelationalFormula

Modifier and Type	Method	Description
RelationalFormula	Necessity.collapseAssociativeFormulas()
RelationalFormula	Possibility.collapseAssociativeFormulas()
RelationalFormula	MlFormula.complement()
RelationalFormula	MlFormula.getFormula()

Constructors in org.tweetyproject.logics.ml.syntax with parameters of type RelationalFormula

Modifier	Constructor	Description
	MlFormula(RelationalFormula formula)	Creates a new modal formula with the given inner 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 org.tweetyproject.logics.ml.syntax with type arguments of type RelationalFormula

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

Uses of RelationalFormula in org.tweetyproject.logics.ml.writer

Methods in org.tweetyproject.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 org.tweetyproject.logics.ml.writer with parameters of type RelationalFormula

Modifier	Constructor	Description
	MlWriter(RelationalFormula formula)	Initializes a new `MlWriter` instance.

Uses of RelationalFormula in org.tweetyproject.logics.mln.syntax

Subclasses of RelationalFormula in org.tweetyproject.logics.mln.syntax

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

Methods in org.tweetyproject.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 org.tweetyproject.logics.rcl.syntax

Subclasses of RelationalFormula in org.tweetyproject.logics.rcl.syntax

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

Methods in org.tweetyproject.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 org.tweetyproject.logics.rdl.syntax

Subclasses of RelationalFormula in org.tweetyproject.logics.rdl.syntax

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

Methods in org.tweetyproject.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 org.tweetyproject.logics.rpcl.syntax

Subclasses of RelationalFormula in org.tweetyproject.logics.rpcl.syntax

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

Methods in org.tweetyproject.logics.rpcl.syntax that return RelationalFormula

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

Uses of RelationalFormula in org.tweetyproject.lp.nlp.syntax

Subclasses of RelationalFormula in org.tweetyproject.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.