Uses of Class
net.sf.tweety.logics.fol.syntax.FolFormula

Packages that use FolFormula

Package	Description
net.sf.tweety.logics.fol.parser
net.sf.tweety.logics.fol.reasoner
net.sf.tweety.logics.fol.semantics
net.sf.tweety.logics.fol.syntax
net.sf.tweety.logics.fol.writer

Uses of FolFormula in net.sf.tweety.logics.fol.parser

Methods in net.sf.tweety.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 net.sf.tweety.logics.fol.reasoner

Methods in net.sf.tweety.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 net.sf.tweety.logics.fol.semantics

Methods in net.sf.tweety.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 net.sf.tweety.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 net.sf.tweety.logics.fol.syntax

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

Fields in net.sf.tweety.logics.fol.syntax with type parameters of type FolFormula

Modifier and Type	Field	Description
protected net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport<FolFormula>	ExistsQuantifiedFormula.support	This helper class implements common functionalities of quantified formulas, meaning the implementation can delegate the method calls to the support class.
protected net.sf.tweety.logics.commons.syntax.QuantifiedFormulaSupport<FolFormula>	ForallQuantifiedFormula.support	This helper class implements common functionalities of quantified formulas, meaning the implementation can delegate the method calls to the support class.

Methods in net.sf.tweety.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()
FolFormula	ForallQuantifiedFormula.getFormula()
FolFormula	Negation.getFormula()
FolFormula	Equivalence.substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)
abstract FolFormula	FolFormula.substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)
FolFormula	Implication.substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)
FolFormula	SpecialFormula.substitute(net.sf.tweety.logics.commons.syntax.interfaces.Term<?> v, net.sf.tweety.logics.commons.syntax.interfaces.Term<?> t)
FolFormula	FolFormula.toDnf()	Makes a disjunctive normal form of this formula.
FolFormula	Conjunction.toNnf()
FolFormula	Disjunction.toNnf()
FolFormula	Equivalence.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 net.sf.tweety.logics.fol.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
Set<FolFormula>	ExistsQuantifiedFormula.getQuantifiedFormulas()
Set<FolFormula>	ForallQuantifiedFormula.getQuantifiedFormulas()
Set<FolFormula>	SpecialFormula.getQuantifiedFormulas()

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

Modifier and Type	Method	Description
boolean	FolSignature.isRepresentable(FolFormula folFormula)	Checks whether the given formula can be represented by this signature.
void	ExistsQuantifiedFormula.setFormula(FolFormula formula)
void	ForallQuantifiedFormula.setFormula(FolFormula formula)

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

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

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

Methods in net.sf.tweety.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)