Uses of Class
org.tweetyproject.logics.fol.syntax.FolFormula

Packages that use FolFormula

Package	Description
org.tweetyproject.action.description.syntax
org.tweetyproject.action.query.syntax
org.tweetyproject.action.signature
org.tweetyproject.arg.aspic.ruleformulagenerator
org.tweetyproject.arg.delp.parser
org.tweetyproject.arg.delp.reasoner
org.tweetyproject.arg.delp.syntax
org.tweetyproject.arg.eaf.syntax
org.tweetyproject.logics.fol.parser
org.tweetyproject.logics.fol.reasoner
org.tweetyproject.logics.fol.semantics
org.tweetyproject.logics.fol.syntax
org.tweetyproject.logics.fol.writer
org.tweetyproject.logics.ml.reasoner
org.tweetyproject.logics.ml.semantics
org.tweetyproject.logics.ml.syntax
org.tweetyproject.logics.mln.reasoner
org.tweetyproject.logics.mln.syntax
org.tweetyproject.logics.rcl.reasoner
org.tweetyproject.logics.rcl.semantics
org.tweetyproject.logics.rcl.syntax
org.tweetyproject.logics.rdl.reasoner
org.tweetyproject.logics.rdl.semantics
org.tweetyproject.logics.rdl.syntax
org.tweetyproject.logics.rpcl.reasoner
org.tweetyproject.logics.rpcl.semantics
org.tweetyproject.logics.rpcl.syntax
org.tweetyproject.logics.translators.aspfol
org.tweetyproject.logics.translators.folprop
org.tweetyproject.lp.nlp.syntax

Uses of FolFormula in org.tweetyproject.action.description.syntax

Methods in org.tweetyproject.action.description.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	DynamicLaw.getAfterFormula()	Retrieves the after formula of this causal law.
FolFormula	CLaw.getHeadFormula()	Retrieves the head formula of this causal law.
FolFormula	CLaw.getIfFormula()	Retrieves the conditional (if) formula of this causal law.

Methods in org.tweetyproject.action.description.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
abstract Set<FolFormula>	CLaw.getFormulas()	Returns the set of formulas contained in this causal law, e.g.
Set<FolFormula>	DynamicLaw.getFormulas()
Set<FolFormula>	StaticLaw.getFormulas()

Constructors in org.tweetyproject.action.description.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	CLaw(FolFormula headFormula)	Creates a causal law of the form "caused headFormula if True"
	CLaw(FolFormula headFormula, Set<GroundingRequirement> requirements)	Creates a causal law of the form "caused headFormula if True requires requirements"
	CLaw(FolFormula headFormula, FolFormula ifFormula)	Creates a causal law of the form "caused headFormula if ifFormula"
	CLaw(FolFormula headFormula, FolFormula ifFormula, Set<GroundingRequirement> requirements)	Creates a causal law of the form "caused headFormula if ifFormula requires requirements"
	DynamicLaw(FolFormula headFormula, FolFormula afterFormula)	Creates a new dynamic law of the form "caused headFormula after afterFormula"
	DynamicLaw(FolFormula headFormula, FolFormula afterFormula, Set<GroundingRequirement> requirements)	Creates a new dynamic law of the form "caused headFormula after afterFormula" requires requirements
	DynamicLaw(FolFormula headFormula, FolFormula ifFormula, FolFormula afterFormula)	Creates a new dynamic law of the form: "caused headFormula if ifFormula after afterFormula"
	DynamicLaw(FolFormula headFormula, FolFormula ifFormula, FolFormula afterFormula, Set<GroundingRequirement> requirements)	Creates a new dynamic law of the form: "caused headFormula if ifFormula after afterFormula requires requirements"
	StaticLaw(FolFormula headFormula)	Creates an empty static law of the form "caused headFormula if True"
	StaticLaw(FolFormula headFormula, Set<GroundingRequirement> requirements)	Creates an empty static law of the form "caused headFormula if True requires requirements"
	StaticLaw(FolFormula headFormula, FolFormula ifFormula)	Creates an empty static law of the form "caused headFormula if ifFormula"
	StaticLaw(FolFormula headFormula, FolFormula ifFormula, Set<GroundingRequirement> requirements)	Creates an empty static law of the form "caused headFormula if ifFormula" requires requirements

Uses of FolFormula in org.tweetyproject.action.query.syntax

Methods in org.tweetyproject.action.query.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	QueryProposition.getInnerFormula()	Returns the inner formula of this query proposition, e.g.

Methods in org.tweetyproject.action.query.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Set<FolFormula>	SActionQuery.getInnerFormulas()	Returns all inner formulas that are contained in query propositions in this action query.

Constructors in org.tweetyproject.action.query.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	AlwaysQuery(FolFormula formula)	Creates a new always query with the given inner formula.
	HoldsQuery(FolFormula formula)	Creates a new holds query with the given inner formula.
	NecessarilyQuery(FolFormula formula)	Creates a new necessarily query with an empty action sequence.
	NecessarilyQuery(FolFormula formula, List<FolAction> actions)	Creates a new necessarily query with the given inner formula and list of actions.
	NecessarilyQuery(FolFormula formula, FolAction action)	Creates a new necessarily query with the given inner formula and a single action.
	QueryProposition(FolFormula formula, String name)	Creates a new query proposition with the given formula and a unique name, which is used by the base class.

Uses of FolFormula in org.tweetyproject.action.signature

Constructors in org.tweetyproject.action.signature with parameters of type FolFormula

Modifier	Constructor	Description
	ActionSignature(FolFormula f)	Creates a new ActionSignature for a single first-order formula.

Uses of FolFormula in org.tweetyproject.arg.aspic.ruleformulagenerator

Subclasses with type arguments of type FolFormula in org.tweetyproject.arg.aspic.ruleformulagenerator

Modifier and Type	Class	Description
class	FolFormulaGenerator	Implements RuleFormulaGenerator for first order logic.

Methods in org.tweetyproject.arg.aspic.ruleformulagenerator that return FolFormula

Modifier and Type	Method	Description
FolFormula	FolFormulaGenerator.getRuleFormula(DefeasibleInferenceRule<FolFormula> r)

Method parameters in org.tweetyproject.arg.aspic.ruleformulagenerator with type arguments of type FolFormula

Modifier and Type	Method	Description
FolFormula	FolFormulaGenerator.getRuleFormula(DefeasibleInferenceRule<FolFormula> r)

Uses of FolFormula in org.tweetyproject.arg.delp.parser

Methods in org.tweetyproject.arg.delp.parser that return FolFormula

Modifier and Type	Method	Description
final FolFormula	DelpParser.Formula(FolSignature signature)	Parses a formula from the given signature.
final FolFormula	DelpParser.Literal(DefeasibleLogicProgram delp, FolSignature signature)	Parses a literal, which could be an atom or its negation.

Uses of FolFormula in org.tweetyproject.arg.delp.reasoner

Classes in org.tweetyproject.arg.delp.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	DelpReasoner	This reasoner performs default dialectical reasoning on some given DeLP.

Methods in org.tweetyproject.arg.delp.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
static Set<DelpArgument>	DelpReasoner.getArgumentsWithConclusion(DefeasibleLogicProgram delp, FolFormula f)	Returns all arguments with the given conclusion from the delp.
DelpAnswer.Type	DelpReasoner.query(DefeasibleLogicProgram delp, FolFormula f)

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

Classes in org.tweetyproject.arg.delp.syntax that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
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	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.

Methods in org.tweetyproject.arg.delp.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	DelpArgument.getConclusion()	returns the conclusion of this argument
FolFormula	DelpRule.getConclusion()

Methods in org.tweetyproject.arg.delp.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Set<FolFormula>	DelpArgument.getAttackOpportunities(DefeasibleLogicProgram delp)	Computes the set of literals that disagree with the conclusion of a subargument of this argument
Collection<? extends FolFormula>	DelpRule.getPremise()
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure()	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals, Set<DefeasibleRule> defeasibleRules)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals, Set<DefeasibleRule> defeasibleRules, boolean usefacts)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.

Methods in org.tweetyproject.arg.delp.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
void	DelpRule.addPremise(FolFormula premise)
DelpArgument	DelpArgument.getDisagreementSubargument(FolFormula lit, DefeasibleLogicProgram delp)	Computes the disagreement subargument of this argument for the given literal
Set<DelpRule>	DefeasibleLogicProgram.getRulesWithHead(FolFormula l)	Returns all defeasible and strict rules appearing in this program with the given literal as head
Set<DelpRule>	DelpArgument.getRulesWithHead(FolFormula l)	Returns all defeasible rules of the support of this argument with the given literal as head
void	DelpRule.setConclusion(FolFormula conclusion)

Method parameters in org.tweetyproject.arg.delp.syntax with type arguments of type FolFormula

Modifier and Type	Method	Description
void	DelpRule.addPremises(Collection<? extends FolFormula> premises)
boolean	DefeasibleLogicProgram.disagree(Set<FolFormula> literals)	Checks whether the given set of literals disagree with respect to the strict part of this program.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals, Set<DefeasibleRule> defeasibleRules)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
Set<FolFormula>	DefeasibleLogicProgram.getStrictClosure(Set<FolFormula> literals, Set<DefeasibleRule> defeasibleRules, boolean usefacts)	Computes the strict closure of the program, i.e., the set of all strictly derivable literals.
boolean	DelpRule.isApplicable(Collection<? extends FolFormula> literals)	Checks whether this rule is applicaple in the given context literals,

Constructors in org.tweetyproject.arg.delp.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	DefeasibleRule(FolFormula head, Set<FolFormula> body)	Initializes the defeasible rule with the given parameters
	DelpArgument(Set<DefeasibleRule> support, FolFormula conclusion)	constructor; initializes this argument with the given parameters
	DelpArgument(FolFormula conclusion)	constructor; initializes the conclusion of this argument with the given literal
	DelpFact(FolFormula literal)	Default constructor; initializes this fact with the given literal
	StrictRule(FolFormula head, Set<FolFormula> body)	Default constructor; initializes head and body of the strict rule

Constructor parameters in org.tweetyproject.arg.delp.syntax with type arguments of type FolFormula

Modifier	Constructor	Description
	DefeasibleRule(FolFormula head, Set<FolFormula> body)	Initializes the defeasible rule with the given parameters
	StrictRule(FolFormula head, Set<FolFormula> body)	Default constructor; initializes head and body of the strict rule

Uses of FolFormula in org.tweetyproject.arg.eaf.syntax

Methods in org.tweetyproject.arg.eaf.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	EpistemicArgumentationFramework.getConstraint()	Retrieves the current epistemic constraint of the framework.

Methods in org.tweetyproject.arg.eaf.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	EpistemicArgumentationFramework.isStrongerConstraint(FolFormula newConstraint, Semantics w)	Computes if the given newConstraint is stronger than the underlying constraint of the EAF.
boolean	EpistemicArgumentationFramework.setConstraint(FolFormula constraint)	Sets a new epistemic formula as the constraint of EAF.

Constructors in org.tweetyproject.arg.eaf.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	EpistemicArgumentationFramework(Graph<Argument> graph, FolFormula constraint)	Constructor for an EAF from a graph and a modal logic formula as the constraint.

Uses of FolFormula in org.tweetyproject.logics.fol.parser

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.fol.parser

Modifier and Type	Class	Description
class	FolParser	This class implements a parser for first-order logic.
class	TPTPParser	This class implements a parser for the TPTP syntax that parses single fol formulas and knowledge bases (TPTP problem files or axiom files).

Methods in org.tweetyproject.logics.fol.parser that return FolFormula

Modifier and Type	Method	Description
FolFormula	FolParser.parseFormula(Reader reader)
FolFormula	TPTPParser.parseFormula(Reader reader)

Uses of FolFormula in org.tweetyproject.logics.fol.reasoner

Classes in org.tweetyproject.logics.fol.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	FolReasoner	Abstract FOL Prover to be implemented by concrete solvers.

Methods in org.tweetyproject.logics.fol.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	EFOLReasoner.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
abstract boolean	FolReasoner.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)	This method determines whether two formulas are equivalent wrt.
boolean	Prover9FolReasoner.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
boolean	SimpleFolReasoner.equivalent(FolBeliefSet kb, FolFormula f1, FolFormula f2)
boolean	SpassFolReasoner.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
Boolean	EFOLReasoner.query(FolBeliefSet kb, FolFormula query)
abstract Boolean	FolReasoner.query(FolBeliefSet beliefbase, FolFormula formula)
Boolean	Prover9FolReasoner.query(FolBeliefSet kb, FolFormula query)
Boolean	SimpleFolReasoner.query(FolBeliefSet kb, FolFormula formula)
Boolean	SpassFolReasoner.query(FolBeliefSet kb, FolFormula query)

Uses of FolFormula in org.tweetyproject.logics.fol.semantics

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.fol.semantics

Modifier and Type	Class	Description
class	HerbrandInterpretation	A Herbrand interpretation is an interpretation for a first-order signature, stating all ground atoms that are true in the interpretation.

Methods in org.tweetyproject.logics.fol.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	HerbrandInterpretation.satisfies(FolFormula formula)	Checks whether this Herbrand interpretation satisfies the given formula.

Method parameters in org.tweetyproject.logics.fol.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
boolean	HerbrandInterpretation.satisfies(Set<FolFormula> formulas)	Checks whether this Herbrand interpretation satisfies each of the formulas in the given set of first-order formulas.

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

Subclasses of FolFormula 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	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.

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.fol.syntax

Modifier and Type	Class	Description
class	FolBeliefSet	This class models a first-order knowledge base, i.e.

Methods in org.tweetyproject.logics.fol.syntax that return FolFormula

Modifier and Type	Method	Description
abstract FolFormula	FolFormula.clone()
FolFormula	ExistsQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	FolAtom.collapseAssociativeFormulas()
FolFormula	ForallQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	Negation.collapseAssociativeFormulas()
FolFormula	SpecialFormula.collapseAssociativeFormulas()
FolFormula	ExistsQuantifiedFormula.getFormula()	returns formula
FolFormula	ForallQuantifiedFormula.getFormula()	returns formula
FolFormula	Negation.getFormula()
FolFormula	Equivalence.substitute(Term<?> v, Term<?> t)
abstract FolFormula	FolFormula.substitute(Term<?> v, Term<?> t)
FolFormula	Implication.substitute(Term<?> v, Term<?> t)
FolFormula	SpecialFormula.substitute(Term<?> v, Term<?> t)
FolFormula	FolFormula.toDnf()	Makes a disjunctive normal form of this formula.
FolFormula	Conjunction.toNnf()
FolFormula	Disjunction.toNnf()
FolFormula	Equivalence.toNnf()
FolFormula	ExclusiveDisjunction.toNnf()
FolFormula	ExistsQuantifiedFormula.toNnf()
FolFormula	FolAtom.toNnf()
abstract FolFormula	FolFormula.toNnf()	Makes the negation normal form of this formula.
FolFormula	ForallQuantifiedFormula.toNnf()
FolFormula	Implication.toNnf()
FolFormula	Negation.toNnf()
FolFormula	SpecialFormula.toNnf()

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

Modifier and Type	Method	Description
Set<FolFormula>	ExistsQuantifiedFormula.getQuantifiedFormulas()	Return quantified formulas
Set<FolFormula>	ForallQuantifiedFormula.getQuantifiedFormulas()	Return the quantified formulars
Set<FolFormula>	SpecialFormula.getQuantifiedFormulas()	Return formulas

Methods in org.tweetyproject.logics.fol.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	AssociativeFolFormula.add(FolFormula... formulas)	Adds the specified elements to the end of this collection (optional operation).
boolean	FolSignature.isRepresentable(FolFormula folFormula)	Checks whether the given formula can be represented by this signature.
void	ExistsQuantifiedFormula.setFormula(FolFormula formula)	set formula
void	ForallQuantifiedFormula.setFormula(FolFormula formula)	sets formula

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

Modifier	Constructor	Description
	FolBeliefSet(Collection<FolFormula> formulas)	Creates a new first-order knowledge base with the given set of formulas.

Uses of FolFormula in org.tweetyproject.logics.fol.writer

Methods in org.tweetyproject.logics.fol.writer with parameters of type FolFormula

Modifier and Type	Method	Description
void	FolWriter.printEquivalence(FolFormula a, FolFormula b)	Prints an Equivalence.
void	Prover9Writer.printEquivalence(FolFormula a, FolFormula b)
void	StandardFolWriter.printEquivalence(FolFormula a, FolFormula b)
void	TPTPWriter.printEquivalence(FolFormula a, FolFormula b)
void	FolWriter.printQuery(FolFormula query)	Prints formatted representation of a query.
void	Prover9Writer.printQuery(FolFormula query)
void	StandardFolWriter.printQuery(FolFormula query)
void	TPTPWriter.printQuery(FolFormula query)

Uses of FolFormula in org.tweetyproject.logics.ml.reasoner

Classes in org.tweetyproject.logics.ml.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	AbstractMlReasoner	Abstract modal reasoner to be implemented by concrete reasoners.

Methods in org.tweetyproject.logics.ml.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
abstract Boolean	AbstractMlReasoner.query(MlBeliefSet beliefbase, FolFormula formula)
Boolean	MleanCoPReasoner.query(MlBeliefSet beliefbase, FolFormula formula)
Boolean	SimpleMlReasoner.query(MlBeliefSet mbs, FolFormula formula)
Boolean	SPASSMlReasoner.query(MlBeliefSet kb, FolFormula query)

Uses of FolFormula in org.tweetyproject.logics.ml.semantics

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.ml.semantics

Modifier and Type	Class	Description
class	KripkeModel	This class models a Kripke model, i.e.
class	MlHerbrandInterpretation	Modified version of HerbrandInterpretation that allows for modal formulas.

Methods in org.tweetyproject.logics.ml.semantics that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Set<Interpretation<FolBeliefSet, FolFormula>>	AccessibilityRelation.getNodes()	Returns all interpretations of the accessibility relation.
Set<Interpretation<FolBeliefSet, FolFormula>>	AccessibilityRelation.getSuccessors(Interpretation<FolBeliefSet, FolFormula> i)	Returns all interpretations that are accessible to a given interpretation i.

Methods in org.tweetyproject.logics.ml.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	KripkeModel.satisfies(FolFormula formula)
boolean	MlHerbrandInterpretation.satisfies(FolFormula formula)

Method parameters in org.tweetyproject.logics.ml.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
Set<Interpretation<FolBeliefSet, FolFormula>>	AccessibilityRelation.getSuccessors(Interpretation<FolBeliefSet, FolFormula> i)	Returns all interpretations that are accessible to a given interpretation i.
boolean	MlHerbrandInterpretation.satisfies(Set<FolFormula> formulas)	Checks whether this Herbrand interpretation satisfies each of the formulas in the given set of first-order formulas.
boolean	MlHerbrandInterpretation.satisfies(Formula formula, Set<Interpretation<FolBeliefSet, FolFormula>> successors)	Checks whether this Herbrand interpretation satisfies the given formula.

Constructor parameters in org.tweetyproject.logics.ml.semantics with type arguments of type FolFormula

Modifier	Constructor	Description
	AccessibilityRelation(Set<Pair<Interpretation<FolBeliefSet, FolFormula>, Interpretation<FolBeliefSet, FolFormula>>> tuples)	Constructs a new accessibility relation.
	AccessibilityRelation(Set<Pair<Interpretation<FolBeliefSet, FolFormula>, Interpretation<FolBeliefSet, FolFormula>>> tuples)	Constructs a new accessibility relation.
	KripkeModel(Set<? extends Interpretation<FolBeliefSet, FolFormula>> possibleWorlds, AccessibilityRelation accRelation)	Creates a new Kripke model.

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

Subclasses of FolFormula 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.

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

Modifier and Type	Method	Description
FolFormula	Necessity.clone()
FolFormula	Possibility.clone()
FolFormula	Necessity.substitute(Term<?> v, Term<?> t)
FolFormula	Possibility.substitute(Term<?> v, Term<?> t)
FolFormula	Necessity.toNnf()
FolFormula	Possibility.toNnf()

Uses of FolFormula in org.tweetyproject.logics.mln.reasoner

Classes in org.tweetyproject.logics.mln.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	AbstractMlnReasoner	This class provides common methods for MLN reasoner.

Methods in org.tweetyproject.logics.mln.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
double	AlchemyMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
double	SimpleMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
Double	AbstractMlnReasoner.query(MarkovLogicNetwork mln, FolFormula query)
Double	AbstractMlnReasoner.query(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)	Queries the given MLN wrt.

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

Methods in org.tweetyproject.logics.mln.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	MlnFormula.getFormula()	Returns the inner formula.

Constructors in org.tweetyproject.logics.mln.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	MlnFormula(FolFormula formula)	Creates a new strict MLN formula with the given formula.
	MlnFormula(FolFormula formula, Double weight)	Creates a new MLN formula with the given formula and weight.
	MlnFormula(FolFormula formula, Probability p)	Creates a new MLN formula and estimates its weight w by the given probability p using the formula w = log(p/(1-p)*f) where "f" is the ratio of the number of worlds not satisfying the formula and the worlds satisfying the formula.

Uses of FolFormula in org.tweetyproject.logics.rcl.reasoner

Classes in org.tweetyproject.logics.rcl.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	SimpleRelationalCReasoner	This class models a relational brute force c-reasoner for relational conditional logic.

Methods in org.tweetyproject.logics.rcl.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
Boolean	SimpleRelationalCReasoner.query(RclBeliefSet bs, FolFormula query)
Boolean	SimpleRelationalCReasoner.query(RclBeliefSet bs, FolFormula query, FolSignature signature)	Queries the given belief set wrt.

Uses of FolFormula in org.tweetyproject.logics.rcl.semantics

Methods in org.tweetyproject.logics.rcl.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
Integer	RelationalRankingFunction.rank(FolFormula formula)	Gets the rank of the given sentence (ground formula).

Uses of FolFormula in org.tweetyproject.logics.rcl.syntax

Classes in org.tweetyproject.logics.rcl.syntax that implement interfaces with type arguments of type FolFormula

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

Methods in org.tweetyproject.logics.rcl.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	RelationalConditional.getConclusion()

Methods in org.tweetyproject.logics.rcl.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Collection<? extends FolFormula>	RelationalConditional.getPremise()

Methods in org.tweetyproject.logics.rcl.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
void	RelationalConditional.addPremise(FolFormula premise)
void	RelationalConditional.setConclusion(FolFormula conclusion)

Method parameters in org.tweetyproject.logics.rcl.syntax with type arguments of type FolFormula

Modifier and Type	Method	Description
void	RelationalConditional.addPremises(Collection<? extends FolFormula> premises)

Constructors in org.tweetyproject.logics.rcl.syntax with parameters of type FolFormula

Modifier	Constructor	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.

Uses of FolFormula in org.tweetyproject.logics.rdl.reasoner

Classes in org.tweetyproject.logics.rdl.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	SimpleDefaultReasoner	Implements a naive reasoner for default logic based on exhaustive application of defaults in process trees.
class	SimpleDefaultReasoner	Implements a naive reasoner for default logic based on exhaustive application of defaults in process trees.

Methods in org.tweetyproject.logics.rdl.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
Boolean	SimpleDefaultReasoner.query(DefaultTheory theory, FolFormula query)
Boolean	SimpleDefaultReasoner.query(DefaultTheory theory, FolFormula query, InferenceMode inferenceMode)	Queries the given default theory for the given query using the given inference mode.

Uses of FolFormula in org.tweetyproject.logics.rdl.semantics

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.rdl.semantics

Modifier and Type	Class	Description
class	Extension	An extension of a default theory, i.e.

Classes in org.tweetyproject.logics.rdl.semantics that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	Extension	An extension of a default theory, i.e.

Methods in org.tweetyproject.logics.rdl.semantics that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Collection<FolFormula>	DefaultSequence.getIn()	Return the sequence's in set
Collection<FolFormula>	DefaultSequence.getOut()	Return the sequence's out set
Iterator<FolFormula>	Extension.iterator()

Methods in org.tweetyproject.logics.rdl.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
boolean	Extension.add(FolFormula e)
boolean	Extension.satisfies(FolFormula formula)

Method parameters in org.tweetyproject.logics.rdl.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
boolean	Extension.addAll(Collection<? extends FolFormula> c)

Constructor parameters in org.tweetyproject.logics.rdl.semantics with type arguments of type FolFormula

Modifier	Constructor	Description
	Extension(Collection<FolFormula> formulas)	Creates a new extension with the given set of formulas.

Uses of FolFormula in org.tweetyproject.logics.rdl.syntax

Methods in org.tweetyproject.logics.rdl.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	DefaultRule.getConclusion()	Return the default's conclusion
FolFormula	DefaultRule.getPrerequisite()	Return the default's prerequisite

Methods in org.tweetyproject.logics.rdl.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Collection<FolFormula>	DefaultRule.getJustification()	Return the default's justification

Constructors in org.tweetyproject.logics.rdl.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	DefaultRule(FolFormula pre, Collection<FolFormula> jus, FolFormula conc)	Creates a new DefaultRule
	DefaultRule(FolFormula pre, FolFormula jus, FolFormula conc)	Creates a new DefaultRule

Constructor parameters in org.tweetyproject.logics.rdl.syntax with type arguments of type FolFormula

Modifier	Constructor	Description
	DefaultRule(FolFormula pre, Collection<FolFormula> jus, FolFormula conc)	Creates a new DefaultRule

Uses of FolFormula in org.tweetyproject.logics.rpcl.reasoner

Classes in org.tweetyproject.logics.rpcl.reasoner that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	RpclMeReasoner	General ME-reasoner for RPCL.

Methods in org.tweetyproject.logics.rpcl.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
Double	RpclMeReasoner.query(RpclBeliefSet beliefbase, FolFormula formula)
Double	RpclMeReasoner.query(RpclBeliefSet beliefbase, FolFormula query, FolSignature signature)	Queries the knowledge base wrt.

Uses of FolFormula in org.tweetyproject.logics.rpcl.semantics

Classes in org.tweetyproject.logics.rpcl.semantics with type parameters of type FolFormula

Modifier and Type	Class	Description
class	RpclProbabilityDistribution<T extends Interpretation<FolBeliefSet, FolFormula>>	Objects of this class represent probability distributions on the interpretations of an underlying first-order signature for a relational probabilistic conditional knowledge base.

Subclasses with type arguments of type FolFormula in org.tweetyproject.logics.rpcl.semantics

Modifier and Type	Class	Description
class	ReferenceWorld	Instances of this class represent reference worlds, i.e.

Methods in org.tweetyproject.logics.rpcl.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
Integer	ReferenceWorld.getMultiplicator(FolFormula f)	Returns the multiplicator of this reference world for the given formula, i.e.
Probability	CondensedProbabilityDistribution.probability(FolFormula f)
Probability	RpclProbabilityDistribution.probability(FolFormula f)	Gets the probability of the given closed formula, i.e.
boolean	ReferenceWorld.satisfies(FolFormula formula)

Method parameters in org.tweetyproject.logics.rpcl.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
abstract Statement	AbstractRpclSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable> worlds2vars)
Statement	AggregatingSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable> worlds2vars)
Statement	AveragingSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable> worlds2vars)
Statement	RpclSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, Map<Interpretation<FolBeliefSet, FolFormula>, FloatVariable> worlds2vars)	Returns the mathematical statement corresponding to the satisfaction of the given conditional wrt.

Uses of FolFormula in org.tweetyproject.logics.rpcl.syntax

Constructors in org.tweetyproject.logics.rpcl.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	RelationalProbabilisticConditional(FolFormula premise, FolFormula conclusion, Probability probability)	Creates a new conditional with the given premise, conclusion and probability.
	RelationalProbabilisticConditional(FolFormula conclusion, Probability probability)	Creates a new conditional with the given conclusion and probability and a tautological premise.

Uses of FolFormula in org.tweetyproject.logics.translators.aspfol

Methods in org.tweetyproject.logics.translators.aspfol that return FolFormula

Modifier and Type	Method	Description
FolFormula	AspFolTranslator.toFOL(ASPLiteral source)	Translates an ASPLiteral to a FolFormula.

Methods in org.tweetyproject.logics.translators.aspfol with parameters of type FolFormula

Modifier and Type	Method	Description
ASPLiteral	AspFolTranslator.toASP(FolFormula source)	Translates a FolFormula to an ASPLiteral.

Uses of FolFormula in org.tweetyproject.logics.translators.folprop

Methods in org.tweetyproject.logics.translators.folprop that return FolFormula

Modifier and Type	Method	Description
FolFormula	FOLPropTranslator.toFOL(PlFormula propFormula)	Return FolFormula toFOL

Methods in org.tweetyproject.logics.translators.folprop with parameters of type FolFormula

Modifier and Type	Method	Description
PlFormula	FOLPropTranslator.toPropositional(FolFormula folFormula)	Return PlFormula toPropositional

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

Subclasses of FolFormula 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.

Classes in org.tweetyproject.lp.nlp.syntax that implement interfaces with type arguments of type FolFormula

Modifier and Type	Class	Description
class	NLPProgram	Represents a nested logic program (NLP) in the form of a set of rules.
class	NLPProgram	Represents a nested logic program (NLP) in the form of a set of rules.
class	NLPRule	A rule of a nested logic program.
class	NLPRule	A rule of a nested logic program.

Methods in org.tweetyproject.lp.nlp.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	NLPRule.getConclusion()
FolFormula	NLPNot.toNnf()

Methods in org.tweetyproject.lp.nlp.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Set<FolFormula>	NLPProgram.getFacts()	Retrieves a set of facts from the nested logic program.
Collection<FolFormula>	NLPRule.getPremise()

Methods in org.tweetyproject.lp.nlp.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
void	NLPProgram.addFact(FolFormula fact)	Adds a fact to the nested logic program.
void	NLPProgram.addFacts(FolFormula... facts)	Adds multiple facts to the nested logic program.
void	NLPRule.addPremise(FolFormula premise)
void	NLPRule.setConclusion(FolFormula conclusion)

Method parameters in org.tweetyproject.lp.nlp.syntax with type arguments of type FolFormula

Modifier and Type	Method	Description
void	NLPRule.addPremises(Collection<? extends FolFormula> premises)

Constructors in org.tweetyproject.lp.nlp.syntax with parameters of type FolFormula

Modifier	Constructor	Description
	NLPNot(FolFormula inner)	Ctor: Creates a new default not for nested logic programs by using the given FOL formula as inner formula.
	NLPRule(FolFormula conclusion)	Constructor that creates a `NLPRule` with a specified conclusion.
	NLPRule(FolFormula conclusion, Collection<FolFormula> premise)	Constructor that creates a `NLPRule` with a specified conclusion and a collection of premises.
	NLPRule(FolFormula conclusion, FolFormula premise)	Constructor that creates a `NLPRule` with a specified conclusion and a single premise.

Constructor parameters in org.tweetyproject.lp.nlp.syntax with type arguments of type FolFormula

Modifier	Constructor	Description
	NLPRule(FolFormula conclusion, Collection<FolFormula> premise)	Constructor that creates a `NLPRule` with a specified conclusion and a collection of premises.