Uses of Class
org.tweetyproject.logics.commons.syntax.RelationalFormula
Package
Description
-
Uses of RelationalFormula in org.tweetyproject.arg.delp.syntax
Modifier and TypeClassDescriptionclass
This class models a defeasible rule in defeasible logic programming.final class
This class implements a fact in defeasible logic programming which encapsulates a literal.class
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
This class models a strict rule in defeasible logic programming.Modifier and TypeMethodDescriptionDefeasibleRule.clone()
StrictRule.clone()
DelpRule.complement()
DefeasibleRule.substitute
(Term<?> v, Term<?> t) DelpFact.substitute
(Term<?> v, Term<?> t) abstract RelationalFormula
DelpRule.substitute
(Term<?> v, Term<?> t) StrictRule.substitute
(Term<?> v, Term<?> t) -
Uses of RelationalFormula in org.tweetyproject.logics.commons.syntax
Modifier and TypeClassDescriptionclass
QuantifiedFormulaSupport<T extends RelationalFormula>
This class provides common functionalities for quantified formulas, i.e.Modifier and TypeMethodDescriptionabstract RelationalFormula
RelationalFormula.clone()
abstract RelationalFormula
RelationalFormula.complement()
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.getFormula()
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.Modifier and TypeMethodDescriptionRelationalFormula.allGroundInstances
(Set<Constant> constants) Computes all ground instances of this relational formula wrt. -
Uses of RelationalFormula in org.tweetyproject.logics.fol.syntax
Modifier and TypeClassDescriptionclass
This class captures the common functionalities first order associative formulas like conjunction, disjunction, etc.class
The classical conjunction of first-order logic.class
A contradictory formula.class
The classical disjunction of first-order logic.class
The equivalence of first-order logic.class
The exclusive disjunction (XOR) in first-order logic.class
Exists-quantified first-order logic formula.class
An atom in first-order logic, i.e.class
The common abstract class for formulas of first-order logic.class
For-All-quantified first-order logic formula.class
The implication of first-order logic.class
The classical negation of first-order logic.class
This class captures the common functionalities of the special formulas tautology and contradiction.class
A tautological formula.Modifier and TypeMethodDescriptionConjunction.collapseAssociativeFormulas()
Disjunction.collapseAssociativeFormulas()
Equivalence.collapseAssociativeFormulas()
ExclusiveDisjunction.collapseAssociativeFormulas()
abstract RelationalFormula
FolFormula.collapseAssociativeFormulas()
This method collapses all associative operations appearing in this term, e.g.Implication.collapseAssociativeFormulas()
FolFormula.complement()
AssociativeFolFormula.get
(int index) Implication.getFirstFormula()
Get the left side formula of the implication left => right.Implication.getSecondFormula()
Get the right side formula of the implication left => rightAssociativeFolFormula.remove
(int index) AssociativeFolFormula.set
(int index, RelationalFormula element) Modifier and TypeMethodDescriptionAssociativeFolFormula.getFormulas()
Equivalence.getFormulas()
Returns the formulas of the equivalence.Equivalence.getFormulas()
Returns the formulas of the equivalence.Implication.getFormulas()
Returns the formulas of the implication.Implication.getFormulas()
Returns the formulas of the implication.AssociativeFolFormula.iterator()
AssociativeFolFormula.listIterator()
AssociativeFolFormula.listIterator
(int index) AssociativeFolFormula.subList
(int fromIndex, int toIndex) Modifier and TypeMethodDescriptionvoid
AssociativeFolFormula.add
(int index, RelationalFormula element) boolean
AssociativeFolFormula.add
(RelationalFormula e) AssociativeFolFormula.set
(int index, RelationalFormula element) void
Implication.setFirstFormula
(RelationalFormula left) Sets the left side formula of the implication left => rightvoid
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 => rightModifier and TypeMethodDescriptionboolean
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.ModifierConstructorDescriptionAssociativeFolFormula
(RelationalFormula first, RelationalFormula second) Creates a new associative formula with the two given formulaeConjunction
(RelationalFormula first, RelationalFormula second) Creates a new conjunction with the two given formulaeDisjunction
(RelationalFormula first, RelationalFormula second) Creates a new disjunction with the two given formulaeCreates a new equivalence with the given two formulasExclusiveDisjunction
(RelationalFormula first, RelationalFormula second) Creates a new exclusive disjunction with the two given formulaeExistsQuantifiedFormula
(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.Creates a new implication a=>b with the two given formulasNegation
(RelationalFormula formula) Relational formula to be negated.ModifierConstructorDescriptionAssociativeFolFormula
(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 formulasEquivalence
(Pair<RelationalFormula, RelationalFormula> formulas) Creates a new equivalence with the given pair of formulasExclusiveDisjunction
(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 formulasImplication
(Pair<RelationalFormula, RelationalFormula> formulas) Creates a new implication with the given pair of formulas -
Uses of RelationalFormula in org.tweetyproject.logics.fol.writer
Modifier and TypeMethodDescriptionvoid
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
-
Uses of RelationalFormula in org.tweetyproject.logics.ml.syntax
Modifier and TypeClassDescriptionclass
This class models a modal formula, i.e.class
This class models the necessity modality.class
This class models the possibility modality.Modifier and TypeMethodDescriptionNecessity.collapseAssociativeFormulas()
Possibility.collapseAssociativeFormulas()
MlFormula.complement()
MlFormula.getFormula()
ModifierConstructorDescriptionMlFormula
(RelationalFormula formula) Creates a new modal formula with the given inner formula.Necessity
(RelationalFormula formula) Creates a new necessity formula with the given inner formulaPossibility
(RelationalFormula formula) Creates a new possibility formula with the given inner formula.ModifierConstructorDescriptionMlBeliefSet
(Set<RelationalFormula> formulas) Creates a new modal knowledge base with the given set of formulas. -
Uses of RelationalFormula in org.tweetyproject.logics.ml.writer
Modifier and TypeMethodDescriptionvoid
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.ModifierConstructorDescriptionMlWriter
(RelationalFormula formula) Initializes a new `MlWriter` instance. -
Uses of RelationalFormula in org.tweetyproject.logics.mln.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent first-order formulas with a weight.Modifier and TypeMethodDescriptionMlnFormula.clone()
MlnFormula.complement()
MlnFormula.substitute
(Term<?> v, Term<?> t) -
Uses of RelationalFormula in org.tweetyproject.logics.rcl.syntax
Modifier and TypeClassDescriptionclass
Instances of this class represent relational conditionals.Modifier and TypeMethodDescriptionRelationalConditional.complement()
RelationalConditional.substitute
(Term<?> v, Term<?> t) -
Uses of RelationalFormula in org.tweetyproject.logics.rdl.syntax
Modifier and TypeClassDescriptionclass
Models a default rule in Reiter's default logic, see [R.Modifier and TypeMethodDescriptionDefaultRule.clone()
DefaultRule.complement()
DefaultRule.substitute
(Term<?> v, Term<?> t) -
Uses of RelationalFormula in org.tweetyproject.logics.rpcl.syntax
Modifier and TypeClassDescriptionclass
This class represents a relational probabilistic conditional, i.e.Modifier and TypeMethodDescriptionRelationalProbabilisticConditional.substitute
(Term<?> v, Term<?> t) -
Uses of RelationalFormula in org.tweetyproject.lp.nlp.syntax
Modifier and TypeClassDescriptionclass
A default negation of a first order formula, nested logic programs only allow not quantified formulas.