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

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
boolean	ClassicalInference.eq(FolFormula f1, FolFormula f2) Tests naively whether two fol formulas are equivalent
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.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
class	FOLAtom An atom in first-order logic, i.e.
class	ForallQuantifiedFormula For-All quantified formula.
class	Negation The classical negation of first-order logic.
class	QuantifiedFormula The common parent of exists and forall quantified formulas, which contains common functionalities.
class	SpecialFormula This class captures the common functionalities of the special formulas tautology and contradiction.
class	Tautology A tautological formula.

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	Negation.collapseAssociativeFormulas()
FolFormula	ForallQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	FOLAtom.collapseAssociativeFormulas()
FolFormula	ExistsQuantifiedFormula.collapseAssociativeFormulas()
FolFormula	QuantifiedFormula.getFormula() Returns the folFormula this quantified folFormula ranges over
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	SpecialFormula.toNnf()
FolFormula	Negation.toNnf()
FolFormula	ForallQuantifiedFormula.toNnf()
abstract FolFormula	FolFormula.toNnf() Makes the negation normal form of this formula.
FolFormula	FOLAtom.toNnf()
FolFormula	ExistsQuantifiedFormula.toNnf()
FolFormula	Disjunction.toNnf()
FolFormula	Conjunction.toNnf()

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.

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

Constructor and Description
ExistsQuantifiedFormula(FolFormula folFormula, net.sf.tweety.logics.commons.syntax.Variable variable) Creates a new exists-quantified formula with the given formula and variable.
ForallQuantifiedFormula(FolFormula folFormula, net.sf.tweety.logics.commons.syntax.Variable variable) Creates a new for-all-quantified formula with the given formula and variable.
QuantifiedFormula(FolFormula folFormula, net.sf.tweety.logics.commons.syntax.Variable variable) Creates a new quantified folFormula with the given folFormula and variable.