Uses of Class
net.sf.tweety.logics.fol.syntax.FolFormula
-
-
-
Uses of FolFormula in net.sf.tweety.action.description.syntax
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()
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 TrueCLaw(FolFormula headFormula, java.util.Set<GroundingRequirement> requirements)
Creates a causal law of the form caused headFormula if True requires requirementsCLaw(FolFormula headFormula, FolFormula ifFormula)
Creates a causal law of the form caused headFormula if ifFormulaCLaw(FolFormula headFormula, FolFormula ifFormula, java.util.Set<GroundingRequirement> requirements)
Creates a causal law of the form caused headFormula if ifFormula requires requirementsDynamicLaw(FolFormula headFormula, FolFormula afterFormula)
Creates a new dynamic law of the form caused headFormula after afterFormulaDynamicLaw(FolFormula headFormula, FolFormula afterFormula, java.util.Set<GroundingRequirement> requirements)
Creates a new dynamic law of the form caused headFormula after afterFormula requires requirementsDynamicLaw(FolFormula headFormula, FolFormula ifFormula, FolFormula afterFormula)
Creates a new dynamic law of the form: caused headFormula if ifFormula after afterFormulaDynamicLaw(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 requirementsStaticLaw(FolFormula headFormula)
Creates an empty static law of the form caused headFormula if TrueStaticLaw(FolFormula headFormula, java.util.Set<GroundingRequirement> requirements)
Creates an empty static law of the form caused headFormula if True requires requirementsStaticLaw(FolFormula headFormula, FolFormula ifFormula)
Creates an empty static law of the form caused headFormula if ifFormulaStaticLaw(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.syntax
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.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.syntax
Methods in net.sf.tweety.arg.delp.syntax that return FolFormula Modifier and Type Method Description FolFormula
DelpArgument. getConclusion()
returns the conclusion of this argumentFolFormula
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 argumentjava.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 literaljava.util.Set<DelpRule>
DefeasibleLogicProgram. getRulesWithHead(FolFormula l)
Returns all defeasible and strict rules appearing in this program with the given literal as headjava.util.Set<DelpRule>
DelpArgument. getRulesWithHead(FolFormula l)
Returns all defeasible rules of the support of this argument with the given literal as headvoid
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 contextliterals
,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 parametersDelpArgument(java.util.Set<DefeasibleRule> support, FolFormula conclusion)
constructor; initializes this argument with the given parametersDelpArgument(FolFormula conclusion)
constructor; initializes the conclusion of this argument with the given literalDelpFact(FolFormula literal)
Default constructor; initializes this fact with the given literalStrictRule(FolFormula head, java.util.Set<FolFormula> body)
Default constructor; initializes head and body of the strict ruleConstructor 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 parametersStrictRule(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 FolFormula
FolParser. parseFormula(java.io.Reader reader)
FolFormula
TPTPParser. parseFormula(java.io.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)
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
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.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
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 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
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)
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
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 double
AlchemyMlnReasoner. doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
double
SimpleMlnReasoner. doQuery(MarkovLogicNetwork mln, FolFormula query, FolSignature signature)
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. -
Uses of FolFormula in net.sf.tweety.logics.mln.syntax
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
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
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
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()
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 DefaultRuleDefaultRule(FolFormula pre, FolFormula jus, FolFormula conc)
Creates a new DefaultRuleConstructor 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.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.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)
-
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.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.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
NLPProgram. addFacts(FolFormula... facts)
void
NLPRule. addPremise(FolFormula premise)
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)
-