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

Packages that use FolFormula

Package	Description
net.sf.tweety.logics.fol
net.sf.tweety.logics.fol.parser
net.sf.tweety.logics.fol.prover
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

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

Modifier and Type	Method and Description
static boolean	ClassicalInference.equivalent(FolFormula f1, FolFormula f2) Tests naively whether two fol formulas are equivalent

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

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

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 and Description
FolFormula	FolParserB.formula(FolSignature signature)

Methods in net.sf.tweety.logics.fol.parser that return types with arguments of type FolFormula

Modifier and Type	Method and Description
net.sf.tweety.commons.util.Pair<Integer,FolFormula>	FolParserB.formulaex(FolSignature signature)

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

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

Modifier and Type	Method and Description
abstract boolean	FolTheoremProver.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
boolean	NaiveProver.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
boolean	Prover9.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
boolean	EProver.equivalent(FolBeliefSet kb, FolFormula a, FolFormula b)
abstract boolean	FolTheoremProver.query(FolBeliefSet kb, FolFormula query) This method determines the answer of the given query wrt.
boolean	NaiveProver.query(FolBeliefSet kb, FolFormula query)
boolean	Prover9.query(FolBeliefSet kb, FolFormula query)
boolean	EProver.query(FolBeliefSet kb, FolFormula query)

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

Method parameters in net.sf.tweety.logics.fol.semantics with type arguments of type FolFormula

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

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

Modifier and Type	Method and Description
abstract FolFormula	FolFormula.clone()
FolFormula	SpecialFormula.collapseAssociativeFormulas()
FolFormula	ForallQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	ExistsQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	FOLAtom.collapseAssociativeFormulas()
FolFormula	Negation.collapseAssociativeFormulas()
FolFormula	ForallQuantifiedFormula.getFormula()
FolFormula	ExistsQuantifiedFormula.getFormula()
FolFormula	Negation.getFormula()
FolFormula	SpecialFormula.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	FolFormula.toDnf() Makes a disjunctive normal form of this formula.
FolFormula	Conjunction.toNnf()
FolFormula	SpecialFormula.toNnf()
FolFormula	ForallQuantifiedFormula.toNnf()
abstract FolFormula	FolFormula.toNnf() Makes the negation normal form of this formula.
FolFormula	ExistsQuantifiedFormula.toNnf()
FolFormula	FOLAtom.toNnf()
FolFormula	Disjunction.toNnf()
FolFormula	Negation.toNnf()

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

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

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

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

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 and Description
void	Prover9Writer.printEquivalence(FolFormula a, FolFormula b)
void	FolWriter.printEquivalence(FolFormula a, FolFormula b) Prints an Equivalence
void	TptpWriter.printEquivalence(FolFormula a, FolFormula b)
void	Prover9Writer.printQuery(FolFormula query)
void	FolWriter.printQuery(FolFormula query) Prints formatted representation of a Query.
void	TptpWriter.printQuery(FolFormula query)