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

Packages that use FolFormula

Package	Description
net.sf.tweety.action.description.parser
net.sf.tweety.action.description.reasoner
net.sf.tweety.action.description.syntax
net.sf.tweety.action.query.analysis
net.sf.tweety.action.query.syntax
net.sf.tweety.action.signature
net.sf.tweety.arg.aspic.ruleformulagenerator
net.sf.tweety.arg.delp
net.sf.tweety.arg.delp.parser
net.sf.tweety.arg.delp.reasoner
net.sf.tweety.arg.delp.semantics
net.sf.tweety.arg.delp.syntax
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
net.sf.tweety.logics.ml.reasoner
net.sf.tweety.logics.ml.semantics
net.sf.tweety.logics.ml.syntax
net.sf.tweety.logics.mln.reasoner
net.sf.tweety.logics.mln.syntax
net.sf.tweety.logics.rcl.reasoner
net.sf.tweety.logics.rcl.semantics
net.sf.tweety.logics.rcl.syntax
net.sf.tweety.logics.rdl.reasoner
net.sf.tweety.logics.rdl.semantics
net.sf.tweety.logics.rdl.syntax
net.sf.tweety.logics.rpcl.reasoner
net.sf.tweety.logics.rpcl.semantics
net.sf.tweety.logics.rpcl.syntax
net.sf.tweety.logics.translators.aspfol
net.sf.tweety.logics.translators.aspnlp
net.sf.tweety.logics.translators.folprop
net.sf.tweety.lp.nlp.syntax

Uses of FolFormula in net.sf.tweety.action.description.parser

Methods in net.sf.tweety.action.description.parser that return FolFormula

Modifier and Type	Method	Description
protected FolFormula	CLawParser.parseFolFormula(java.lang.String s)	Parses a FolFormula from a string using the FolParser class

Uses of FolFormula in net.sf.tweety.action.description.reasoner

Methods in net.sf.tweety.action.description.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
private java.lang.String	CTransitionSystemCalculator.getLiteralString(FolFormula f, int t, boolean negated)	Utility function representing a single literal either in a direct manner or using default negation.
private java.lang.String	CTransitionSystemCalculator.getRuleBodyString(FolFormula f, int t, boolean negated)	Calculates the representation of an inner formula of a causal rule according to the translation in "Representing Transition Systems by Logic Programs.".

Uses of FolFormula in net.sf.tweety.action.description.syntax

Fields in net.sf.tweety.action.description.syntax declared as FolFormula

Modifier and Type	Field	Description
protected FolFormula	DynamicLaw.afterFormula
protected FolFormula	CLaw.headFormula
protected FolFormula	CLaw.ifFormula

Methods in net.sf.tweety.action.description.syntax that return FolFormula

Modifier and Type	Method	Description
FolFormula	DynamicLaw.getAfterFormula()	Returns the afterFormula of this causal law.
FolFormula	CLaw.getHeadFormula()	Returns the headFormula of this causal law.
FolFormula	CLaw.getIfFormula()	Returns the ifFormula of this causal law.

Methods in net.sf.tweety.action.description.syntax that return types with arguments of type FolFormula

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

Methods in net.sf.tweety.action.description.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
protected boolean	CLaw.isConjunctiveClause(FolFormula pl)	a conjunctive clause is either a literal or a conjunction of literals.
private void	DynamicLaw.setAfterFormula(FolFormula afterFormula)	Sets the afterFormula of this causal law
private void	CLaw.setHeadFormula(FolFormula headFormula)	Sets the headFormula of this causal law
private void	CLaw.setIfFormula(FolFormula ifFormula)	Sets the IfFormula of this causal law

Constructors in net.sf.tweety.action.description.syntax with parameters of type FolFormula

Constructor	Description
CLaw(FolFormula headFormula)	Creates a causal law of the form caused headFormula if True
CLaw(FolFormula headFormula, java.util.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, java.util.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, java.util.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, java.util.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, java.util.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, java.util.Set<GroundingRequirement> requirements)	Creates an empty static law of the form caused headFormula if ifFormula requires requirements

Uses of FolFormula in net.sf.tweety.action.query.analysis

Methods in net.sf.tweety.action.query.analysis that return types with arguments of type FolFormula

Modifier and Type	Method	Description
private java.util.Set<FolFormula>	SActionQuerySatisfactionTester.getStateParts(FolFormula formula)	Calculates the set of all possible parts of the propositional formula given.

Methods in net.sf.tweety.action.query.analysis with parameters of type FolFormula

Modifier and Type	Method	Description
private java.lang.String	SActionQuerySatisfactionTester.getStatePartRules(FolFormula statePart)	This function translates a propositional formula into a logic program according to certain rules.
private java.util.Set<FolFormula>	SActionQuerySatisfactionTester.getStateParts(FolFormula formula)	Calculates the set of all possible parts of the propositional formula given.

Uses of FolFormula in net.sf.tweety.action.query.syntax

Fields in net.sf.tweety.action.query.syntax declared as FolFormula

Modifier and Type	Field	Description
protected FolFormula	QueryProposition.formula

Methods in net.sf.tweety.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 net.sf.tweety.action.query.syntax that return types with arguments of type FolFormula

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

Constructors in net.sf.tweety.action.query.syntax with parameters of type FolFormula

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, java.util.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, java.lang.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 net.sf.tweety.action.signature

Constructors in net.sf.tweety.action.signature with parameters of type FolFormula

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

Uses of FolFormula in net.sf.tweety.arg.aspic.ruleformulagenerator

Methods in net.sf.tweety.arg.aspic.ruleformulagenerator that return FolFormula

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

Method parameters in net.sf.tweety.arg.aspic.ruleformulagenerator with type arguments of type FolFormula

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

Uses of FolFormula in net.sf.tweety.arg.delp

Fields in net.sf.tweety.arg.delp declared as FolFormula

Modifier and Type	Field	Description
private static FolFormula	TestArguments.FOL_FLIES_TINA
private static FolFormula	TestArguments.FOL_NOT_FLIES_TINA

Fields in net.sf.tweety.arg.delp with type parameters of type FolFormula

Modifier and Type	Field	Description
(package private) static java.util.Comparator<FolFormula>	Utilities.compareLiterals	Compare DeLP literals as they arise in rules, i.e., ~B < A (negation is always smaller) A < B (atoms = predicates are sorted by predicate name first...

Methods in net.sf.tweety.arg.delp with parameters of type FolFormula

Modifier and Type	Method	Description
private DelpAnswer.Type	TestQueries.query(DefeasibleLogicProgram delp, FolFormula formula)

Uses of FolFormula in net.sf.tweety.arg.delp.parser

Methods in net.sf.tweety.arg.delp.parser that return FolFormula

Modifier and Type	Method	Description
FolFormula	DelpParser.Formula(FolSignature signature)
FolFormula	DelpParser.Literal(DefeasibleLogicProgram delp, FolSignature signature)

Uses of FolFormula in net.sf.tweety.arg.delp.reasoner

Methods in net.sf.tweety.arg.delp.reasoner with parameters of type FolFormula

Modifier and Type	Method	Description
static java.util.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 net.sf.tweety.arg.delp.semantics

Methods in net.sf.tweety.arg.delp.semantics that return types with arguments of type FolFormula

Modifier and Type	Method	Description
private java.util.Set<java.util.Set<FolFormula>>	GeneralizedSpecificity.ntActSets(java.util.Set<ArgumentCompletion> argumentCompletions)	Computes the activation sets of all given argument completions
private java.util.Set<java.util.Set<FolFormula>>	GeneralizedSpecificity.ntActSets(ArgumentCompletion argument)	Computes the activation sets of the given argument completion.

Methods in net.sf.tweety.arg.delp.semantics with parameters of type FolFormula

Modifier and Type	Method	Description
java.util.Set<DelpRule>	ArgumentCompletion.getRulesWithHead(FolFormula l)

Method parameters in net.sf.tweety.arg.delp.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
private boolean	GeneralizedSpecificity.actSetTest(java.util.Set<java.util.Set<FolFormula>> ntActSets, DelpArgument arg, DefeasibleLogicProgram delp)	Test whether all given activation sets activate the given argument.
private boolean	GeneralizedSpecificity.isActivated(DelpArgument arg, java.util.Set<FolFormula> activationSet, DefeasibleLogicProgram delp)	Test whether the given argument is activated by the given activation set.

Uses of FolFormula in net.sf.tweety.arg.delp.syntax

Fields in net.sf.tweety.arg.delp.syntax declared as FolFormula

Modifier and Type	Field	Description
private FolFormula	DelpArgument.conclusion	The conclusion of this argument (must be a literal)
protected FolFormula	DelpRule.head	The head of the rule (this must be a literal).

Fields in net.sf.tweety.arg.delp.syntax with type parameters of type FolFormula

Modifier and Type	Field	Description
protected java.util.Set<FolFormula>	DelpRule.body	The body of the rule (these must be a literals).

Methods in net.sf.tweety.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 net.sf.tweety.arg.delp.syntax that return types with arguments of type FolFormula

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

Methods in net.sf.tweety.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
java.util.Set<DelpRule>	DefeasibleLogicProgram.getRulesWithHead(FolFormula l)	Returns all defeasible and strict rules appearing in this program with the given literal as head
java.util.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 net.sf.tweety.arg.delp.syntax with type arguments of type FolFormula

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

Constructors in net.sf.tweety.arg.delp.syntax with parameters of type FolFormula

Constructor	Description
DefeasibleRule(FolFormula head, java.util.Set<FolFormula> body)	Initializes the defeasible rule with the given parameters
DelpArgument(java.util.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
DelpRule(FolFormula head, java.util.Collection<? extends FolFormula> body)	Default constructor; initializes head and body of the rule
StrictRule(FolFormula head, java.util.Set<FolFormula> body)	Default constructor; initializes head and body of the strict rule

Constructor parameters in net.sf.tweety.arg.delp.syntax with type arguments of type FolFormula

Constructor	Description
DefeasibleRule(FolFormula head, java.util.Set<FolFormula> body)	Initializes the defeasible rule with the given parameters
DelpRule(FolFormula head, java.util.Collection<? extends FolFormula> body)	Default constructor; initializes head and body of the rule
StrictRule(FolFormula head, java.util.Set<FolFormula> body)	Default constructor; initializes head and body of the strict rule

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
private FolFormula	FolParser.parseAtomic(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseAtomic(java.util.List<java.lang.Object> l)
private FolFormula	FolParser.parseConjunction(java.util.List<java.lang.Object> l)	Parses a simple conjunction as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseConjunction(java.util.List<java.lang.Object> l)	Parses a conjunction as a list of String tokens or formulas into a fol formula.
private FolFormula	FolParser.parseDisjunction(java.util.List<java.lang.Object> l)	Parses a disjunction as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseDisjunction(java.util.List<java.lang.Object> l)	Parses a disjunction as a list of String tokens or formulas into a fol formula.
private FolFormula	FolParser.parseEquivalence(java.util.List<java.lang.Object> l)	Parses an equivalence as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseEquivalence(java.util.List<java.lang.Object> l)	Parses an equivalence as a list of String tokens or formulas into a fol formula.
FolFormula	FolParser.parseFormula(java.io.Reader reader)
FolFormula	TPTPParser.parseFormula(java.io.Reader reader)
private FolFormula	FolParser.parseImplication(java.util.List<java.lang.Object> l)	Parses an implication as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseImplication(java.util.List<java.lang.Object> l)	Parses an implication as a list of String tokens or formulas into a fol formula.
private FolFormula	FolParser.parseNegation(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a fol formula.
private FolFormula	TPTPParser.parseNegation(java.util.List<java.lang.Object> l)
private FolFormula	FolParser.parseQuantification(java.util.List<java.lang.Object> l)	Parses a quantified formula as a list of String tokens or formulas.
private FolFormula	TPTPParser.parseQuantification(java.util.List<java.lang.Object> l)	Parses a quantified formula as a list of String tokens or formulas.

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)
java.lang.Boolean	EFOLReasoner.query(FolBeliefSet kb, FolFormula query)
abstract java.lang.Boolean	FolReasoner.query(FolBeliefSet beliefbase, FolFormula formula)
java.lang.Boolean	Prover9FolReasoner.query(FolBeliefSet kb, FolFormula query)
java.lang.Boolean	SimpleFolReasoner.query(FolBeliefSet kb, FolFormula formula)
java.lang.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(java.util.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 declared as FolFormula

Modifier and Type	Field	Description
private FolFormula	Negation.folFormula

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

Modifier and Type	Field	Description
protected 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 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(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	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
java.util.Set<FolFormula>	ExistsQuantifiedFormula.getQuantifiedFormulas()
java.util.Set<FolFormula>	ForallQuantifiedFormula.getQuantifiedFormulas()
java.util.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(java.util.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)

Uses of FolFormula in net.sf.tweety.logics.ml.reasoner

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

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

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

Fields in net.sf.tweety.logics.ml.semantics with type parameters of type FolFormula

Modifier and Type	Field	Description
private java.util.Set<? extends Interpretation<FolBeliefSet,FolFormula>>	KripkeModel.possibleWorlds	The possible worlds of this model.
private java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>>	AccessibilityRelation.tuples	The actual relation
private java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>>	AccessibilityRelation.tuples	The actual relation

Methods in net.sf.tweety.logics.ml.semantics that return types with arguments of type FolFormula

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

Methods in net.sf.tweety.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 net.sf.tweety.logics.ml.semantics with type arguments of type FolFormula

Modifier and Type	Method	Description
java.util.Set<Interpretation<FolBeliefSet,FolFormula>>	AccessibilityRelation.getSuccessors(Interpretation<FolBeliefSet,FolFormula> i)	Returns all interpretations that are accessible to a given interpretation i.
boolean	MlHerbrandInterpretation.satisfies(java.util.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, java.util.Set<Interpretation<FolBeliefSet,FolFormula>> successors)	Checks whether this Herbrand interpretation satisfies the given formula.

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

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

Uses of FolFormula in net.sf.tweety.logics.ml.syntax

Subclasses of FolFormula in net.sf.tweety.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 net.sf.tweety.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 net.sf.tweety.logics.mln.reasoner

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

Modifier and Type	Method	Description
protected abstract double	AbstractMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)	Performs the actual querying.
double	AlchemyMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
protected double	ApproximateNaiveMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
protected double	IteratingMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
double	SimpleMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
protected double	SimpleSamplingMlnReasoner.doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
protected int	AbstractMlnReasoner.numberOfGroundSatisfactions(FolFormula formula, HerbrandInterpretation hInt, FolSignature signature)	Computes the number of instantiations of the formula, wrt.
java.lang.Double	AbstractMlnReasoner.query(MarkovLogicNetwork mln, FolFormula query)
java.lang.Double	AbstractMlnReasoner.query(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)	Queries the given MLN wrt.
private java.io.File	AlchemyMlnReasoner.writeAlchemyMlnFile(MarkovLogicNetwork mln, FolSignature signature, FolFormula formula)	Writes the given MLN wrt.

Uses of FolFormula in net.sf.tweety.logics.mln.syntax

Fields in net.sf.tweety.logics.mln.syntax declared as FolFormula

Modifier and Type	Field	Description
private FolFormula	MlnFormula.formula	the first-order formula.

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

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

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

Constructor	Description
MlnFormula(FolFormula formula)	Creates a new strict MLN formula with the given formula.
MlnFormula(FolFormula formula, java.lang.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 net.sf.tweety.logics.rcl.reasoner

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

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

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

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

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

Uses of FolFormula in net.sf.tweety.logics.rcl.syntax

Fields in net.sf.tweety.logics.rcl.syntax declared as FolFormula

Modifier and Type	Field	Description
private FolFormula	RelationalConditional.conclusion	The conclusion of the conditional.
private FolFormula	RelationalConditional.premise	The premise of the conditional.

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

Modifier and Type	Method	Description
FolFormula	RelationalConditional.getConclusion()

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

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

Methods in net.sf.tweety.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 net.sf.tweety.logics.rcl.syntax with type arguments of type FolFormula

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

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

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 net.sf.tweety.logics.rdl.reasoner

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

Modifier and Type	Method	Description
java.lang.Boolean	SimpleDefaultReasoner.query(DefaultTheory theory, FolFormula query)
java.lang.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 net.sf.tweety.logics.rdl.semantics

Fields in net.sf.tweety.logics.rdl.semantics with type parameters of type FolFormula

Modifier and Type	Field	Description
private java.util.Collection<FolFormula>	Extension.formulas	The formulas
private java.util.Set<FolFormula>	DefaultSequence.out	the out set

Methods in net.sf.tweety.logics.rdl.semantics that return types with arguments of type FolFormula

Modifier and Type	Method	Description
java.util.Collection<FolFormula>	DefaultSequence.getIn()
java.util.Collection<FolFormula>	DefaultSequence.getOut()
java.util.Iterator<FolFormula>	Extension.iterator()

Methods in net.sf.tweety.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 net.sf.tweety.logics.rdl.semantics with type arguments of type FolFormula

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

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

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

Uses of FolFormula in net.sf.tweety.logics.rdl.syntax

Fields in net.sf.tweety.logics.rdl.syntax declared as FolFormula

Modifier and Type	Field	Description
private FolFormula	DefaultRule.conc	The conclusion of the default rule
private FolFormula	DefaultRule.pre	The prerequisite of the default rule

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

Modifier and Type	Field	Description
private java.util.Collection<FolFormula>	DefaultRule.jus	The justifications of the default rule

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

Modifier and Type	Method	Description
FolFormula	DefaultRule.getConclusion()
FolFormula	DefaultRule.getPrerequisite()

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

Modifier and Type	Method	Description
java.util.Collection<FolFormula>	DefaultRule.getJustification()

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

Modifier and Type	Method	Description
(package private) void	DefaultTheory.addFact(FolFormula fact)	add facts to knowledge base
(package private) void	DefaultTheory.removeFact(FolFormula fact)	removes fact from knowledge base

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

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

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

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

Uses of FolFormula in net.sf.tweety.logics.rpcl.reasoner

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

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

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

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

Fields in net.sf.tweety.logics.rpcl.semantics with type parameters of type FolFormula

Modifier and Type	Field	Description
private java.util.Map<FolFormula,java.lang.Integer>	ReferenceWorld.multiplicators	Multiplicators for formulas; saved for efficiency.

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

Modifier and Type	Method	Description
java.lang.Integer	ReferenceWorld.getMultiplicator(FolFormula f)	Returns the multiplicator of this reference world for the given formula, i.e.
private java.lang.Integer	ReferenceWorld.getMultiplicatorForConjunction(FolFormula f)	Returns the multiplicator of this reference world for the given formula (which is a conjunction of literals or a single literal), i.e.
private java.lang.Integer	ReferenceWorld.getNumberOfOccurences(FolFormula f, Predicate p, java.util.Collection<? extends Constant> constants, boolean positive)	Determines the number of occurrences of instances of predicate "p" with a constant in "constants".
Probability	CondensedProbabilityDistribution.probability(FolFormula f)
Probability	RpclProbabilityDistribution.probability(FolFormula f)	Gets the probability of the given closed formula, i.e.
protected Term	AbstractRpclSemantics.probabilityTerm(FolFormula f, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)	Constructs the term expressing the probability of the given formula "f" wrt.
boolean	ReferenceWorld.satisfies(FolFormula formula)

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

Modifier and Type	Method	Description
abstract Statement	AbstractRpclSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)
Statement	AggregatingSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)
Statement	AveragingSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)
Statement	RpclSemantics.getSatisfactionStatement(RelationalProbabilisticConditional r, FolSignature signature, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)	Returns the mathematical statement corresponding to the satisfaction of the given conditional wrt.
protected Term	AbstractRpclSemantics.probabilityTerm(FolFormula f, java.util.Map<Interpretation<FolBeliefSet,FolFormula>,FloatVariable> worlds2vars)	Constructs the term expressing the probability of the given formula "f" wrt.

Uses of FolFormula in net.sf.tweety.logics.rpcl.syntax

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

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 net.sf.tweety.logics.translators.aspfol

Methods in net.sf.tweety.logics.translators.aspfol that return FolFormula

Modifier and Type	Method	Description
FolFormula	AspFolTranslator.toFOL(ASPLiteral source)

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

Modifier and Type	Method	Description
ASPLiteral	AspFolTranslator.toASP(FolFormula source)

Uses of FolFormula in net.sf.tweety.logics.translators.aspnlp

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

Modifier and Type	Method	Description
private void	AspNlpTranslator.bodiesFromFormula(FolFormula source, java.util.List<java.util.List<ASPBodyElement>> bodies)	Helper method: Generates a list of possible bodies for the given FOL-Formula.

Uses of FolFormula in net.sf.tweety.logics.translators.folprop

Methods in net.sf.tweety.logics.translators.folprop that return FolFormula

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

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

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

Uses of FolFormula in net.sf.tweety.lp.nlp.syntax

Subclasses of FolFormula in net.sf.tweety.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.

Fields in net.sf.tweety.lp.nlp.syntax declared as FolFormula

Modifier and Type	Field	Description
(package private) FolFormula	NLPRule.conclusion
private FolFormula	NLPNot.inner

Fields in net.sf.tweety.lp.nlp.syntax with type parameters of type FolFormula

Modifier and Type	Field	Description
(package private) java.util.Set<FolFormula>	NLPRule.premise

Methods in net.sf.tweety.lp.nlp.syntax that return FolFormula

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

Methods in net.sf.tweety.lp.nlp.syntax that return types with arguments of type FolFormula

Modifier and Type	Method	Description
java.util.Set<FolFormula>	NLPProgram.getFacts()
java.util.Collection<FolFormula>	NLPRule.getPremise()

Methods in net.sf.tweety.lp.nlp.syntax with parameters of type FolFormula

Modifier and Type	Method	Description
void	NLPProgram.addFact(FolFormula fact)
void	NLPRule.addPremise(FolFormula premise)
private void	NLPRule.checkFormula(FolFormula formula)	Helper methods checks if the given FOL formula is supported by the nested logic program language, that means it checks if it contains quantifiers and if that is the case it throws a LanguageException
void	NLPRule.setConclusion(FolFormula conclusion)

Method parameters in net.sf.tweety.lp.nlp.syntax with type arguments of type FolFormula

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

Constructors in net.sf.tweety.lp.nlp.syntax with parameters of type FolFormula

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)
NLPRule(FolFormula conclusion, java.util.Collection<FolFormula> premise)
NLPRule(FolFormula conclusion, FolFormula premise)

Constructor parameters in net.sf.tweety.lp.nlp.syntax with type arguments of type FolFormula

Constructor	Description
NLPRule(FolFormula conclusion, java.util.Collection<FolFormula> premise)