Uses of Class
net.sf.tweety.logics.pl.syntax.PlFormula

Packages that use PlFormula

Package	Description
net.sf.tweety.action.query.analysis
net.sf.tweety.action.query.parser
net.sf.tweety.action.query.syntax
net.sf.tweety.agents.dialogues
net.sf.tweety.agents.dialogues.oppmodels
net.sf.tweety.arg.adf.reasoner.encodings
net.sf.tweety.arg.adf.sat
net.sf.tweety.arg.adf.semantics
net.sf.tweety.arg.adf.transform
net.sf.tweety.arg.adf.util
net.sf.tweety.arg.aspic.ruleformulagenerator
net.sf.tweety.arg.aspic.util
net.sf.tweety.arg.deductive.reasoner
net.sf.tweety.arg.deductive.semantics
net.sf.tweety.arg.deductive.syntax
net.sf.tweety.beliefdynamics.mas
net.sf.tweety.beliefdynamics.operators
net.sf.tweety.beliefdynamics.selectiverevision.argumentative
net.sf.tweety.logics.cl.reasoner
net.sf.tweety.logics.cl.semantics
net.sf.tweety.logics.cl.syntax
net.sf.tweety.logics.pcl.reasoner
net.sf.tweety.logics.pcl.semantics
net.sf.tweety.logics.pcl.syntax
net.sf.tweety.logics.pl.analysis
net.sf.tweety.logics.pl.parser
net.sf.tweety.logics.pl.postulates
net.sf.tweety.logics.pl.reasoner
net.sf.tweety.logics.pl.sat
net.sf.tweety.logics.pl.semantics
net.sf.tweety.logics.pl.syntax
net.sf.tweety.logics.pl.test
net.sf.tweety.logics.pl.util
net.sf.tweety.logics.pl.writer
net.sf.tweety.logics.qbf.parser
net.sf.tweety.logics.qbf.reasoner
net.sf.tweety.logics.qbf.semantics
net.sf.tweety.logics.qbf.syntax
net.sf.tweety.logics.translators.folprop
net.sf.tweety.web.services

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

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

Modifier and Type	Method	Description
private java.util.Set<PlFormula>	SActionQuerySatisfactionTester.getQueryParts(PlFormula formula)	Calculates the set of all subformulas of an action query down to propositions (holds, always, necessarily)

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

Modifier and Type	Method	Description
private java.lang.String	SActionQuerySatisfactionTester.getQueryPartRules(PlFormula queryPart)	Calculates the translation of an action query to rules of a normal logic program according to the translation sheme presented in [1].
private java.util.Set<PlFormula>	SActionQuerySatisfactionTester.getQueryParts(PlFormula formula)	Calculates the set of all subformulas of an action query down to propositions (holds, always, necessarily)

Uses of PlFormula in net.sf.tweety.action.query.parser

Methods in net.sf.tweety.action.query.parser that return PlFormula

Modifier and Type	Method	Description
private PlFormula	ActionQueryParser.parseAtomic(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	ActionQueryParser.parseConjunction(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	ActionQueryParser.parseDisjunction(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	ActionQueryParser.parseNegation(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.

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

Subclasses of PlFormula in net.sf.tweety.action.query.syntax

Modifier and Type	Class	Description
class	AlwaysQuery	This class represents an always query in the action query language S.
class	HoldsQuery	This class represents a holds query in the action query language S.
class	NecessarilyQuery	This class represents a necessarily query in the action query language S.
class	QueryProposition	Action queries are represented as propositional formulas with three possible types of propositions: holds, always and necessarily propositions.

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

Modifier and Type	Field	Description
protected PlFormula	SActionQuery.formula

Methods in net.sf.tweety.action.query.syntax that return PlFormula

Modifier and Type	Method	Description
PlFormula	SActionQuery.getFormula()	Returns the formula represented by this action query.
private static PlFormula	SActionQuery.substitutePropositions(java.util.Map<Variable,Constant> map, PlFormula formula)	Utility function that walks through all parts of a propositional formula with query propositions substituting all variables with constants according to the given map.

Methods in net.sf.tweety.action.query.syntax with parameters of type PlFormula

Modifier and Type	Method	Description
private static PlFormula	SActionQuery.substitutePropositions(java.util.Map<Variable,Constant> map, PlFormula formula)	Utility function that walks through all parts of a propositional formula with query propositions substituting all variables with constants according to the given map.

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

Constructor	Description
SActionQuery(PlFormula formula)	Creates a new action query with the given propositional formula and no grounding requirements.
SActionQuery(PlFormula formula, java.util.Set<GroundingRequirement> requirements)	Creates a new action query with the given propositional formula and grounding requirements.

Uses of PlFormula in net.sf.tweety.agents.dialogues

Constructor parameters in net.sf.tweety.agents.dialogues with type arguments of type PlFormula

Constructor	Description
ExecutableFormulaSet(java.util.Collection<? extends PlFormula> formulas)	Creates a new set for the given formulas.

Uses of PlFormula in net.sf.tweety.agents.dialogues.oppmodels

Fields in net.sf.tweety.agents.dialogues.oppmodels with type parameters of type PlFormula

Modifier and Type	Field	Description
private DialogueTrace<PlFormula,java.util.Collection<PlFormula>>	DeductiveEnvironment.trace	The current dialogue trace.
private DialogueTrace<PlFormula,java.util.Collection<PlFormula>>	DeductiveEnvironment.trace	The current dialogue trace.

Methods in net.sf.tweety.agents.dialogues.oppmodels that return types with arguments of type PlFormula

Modifier and Type	Method	Description
DialogueTrace<PlFormula,java.util.Collection<PlFormula>>	DeductiveEnvironment.getDialogueTrace()	Returns the current dialogue trace.
DialogueTrace<PlFormula,java.util.Collection<PlFormula>>	DeductiveEnvironment.getDialogueTrace()	Returns the current dialogue trace.

Uses of PlFormula in net.sf.tweety.arg.adf.reasoner.encodings

Method parameters in net.sf.tweety.arg.adf.reasoner.encodings with type arguments of type PlFormula

Modifier and Type	Method	Description
Interpretation	SatEncodingContext.interpretationFromWitness(Interpretation<PlBeliefSet,PlFormula> witness)	Constructs an ADF interpretation from the given SAT witness.

Uses of PlFormula in net.sf.tweety.arg.adf.sat

Fields in net.sf.tweety.arg.adf.sat with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.Collection<PlFormula>	SimpleSatSolverState.state

Methods in net.sf.tweety.arg.adf.sat that return types with arguments of type PlFormula

Modifier and Type	Method	Description
Interpretation<PlBeliefSet,PlFormula>	NativeLingelingSolver.getWitness(java.util.Collection<PlFormula> formulas)
Interpretation<PlBeliefSet,PlFormula>	SimpleIncrementalSatSolver.getWitness(java.util.Collection<PlFormula> formulas)
Interpretation<PlBeliefSet,PlFormula>	NativeLingelingSolver.LingelingSolverState.witness()
Interpretation<PlBeliefSet,PlFormula>	SatSolverState.witness()
Interpretation<PlBeliefSet,PlFormula>	SimpleSatSolverState.witness()

Method parameters in net.sf.tweety.arg.adf.sat with type arguments of type PlFormula

Modifier and Type	Method	Description
Interpretation<PlBeliefSet,PlFormula>	NativeLingelingSolver.getWitness(java.util.Collection<PlFormula> formulas)
Interpretation<PlBeliefSet,PlFormula>	SimpleIncrementalSatSolver.getWitness(java.util.Collection<PlFormula> formulas)
boolean	NativeLingelingSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)
boolean	SimpleIncrementalSatSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)

Uses of PlFormula in net.sf.tweety.arg.adf.semantics

Methods in net.sf.tweety.arg.adf.semantics with parameters of type PlFormula

Modifier and Type	Method	Description
private boolean	SatLinkStrategy.isAttacking(PlFormula from, PlFormula toAcc, java.util.Collection<PlFormula> clauses)
private boolean	SatLinkStrategy.isSupporting(PlFormula from, PlFormula toAcc, java.util.Collection<PlFormula> clauses)

Method parameters in net.sf.tweety.arg.adf.semantics with type arguments of type PlFormula

Modifier and Type	Method	Description
private boolean	SatLinkStrategy.isAttacking(PlFormula from, PlFormula toAcc, java.util.Collection<PlFormula> clauses)
private boolean	SatLinkStrategy.isSupporting(PlFormula from, PlFormula toAcc, java.util.Collection<PlFormula> clauses)

Uses of PlFormula in net.sf.tweety.arg.adf.transform

Fields in net.sf.tweety.arg.adf.transform with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.function.Function<Argument,PlFormula>	PlFormulaTransform.argumentToPlFormula

Methods in net.sf.tweety.arg.adf.transform that return PlFormula

Modifier and Type	Method	Description
PlFormula	PlFormulaTransform.transformArgument(Argument argument)
PlFormula	PlFormulaTransform.transformConjunction(java.util.Collection<PlFormula> subconditions)
PlFormula	PlFormulaTransform.transformContradiction()
PlFormula	PlFormulaTransform.transformDisjunction(java.util.Collection<PlFormula> subconditions)
PlFormula	PlFormulaTransform.transformEquivalence(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformExclusiveDisjunction(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformImplication(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformNegation(PlFormula sub)
PlFormula	PlFormulaTransform.transformTautology()

Methods in net.sf.tweety.arg.adf.transform with parameters of type PlFormula

Modifier and Type	Method	Description
PlFormula	PlFormulaTransform.transformEquivalence(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformExclusiveDisjunction(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformImplication(PlFormula left, PlFormula right)
PlFormula	PlFormulaTransform.transformNegation(PlFormula sub)

Method parameters in net.sf.tweety.arg.adf.transform with type arguments of type PlFormula

Modifier and Type	Method	Description
PlFormula	PlFormulaTransform.transformConjunction(java.util.Collection<PlFormula> subconditions)
PlFormula	PlFormulaTransform.transformDisjunction(java.util.Collection<PlFormula> subconditions)

Constructor parameters in net.sf.tweety.arg.adf.transform with type arguments of type PlFormula

Constructor	Description
PlFormulaTransform(java.util.function.Function<Argument,PlFormula> argumentToPlFormula)

Uses of PlFormula in net.sf.tweety.arg.adf.util

Methods in net.sf.tweety.arg.adf.util that return types with arguments of type PlFormula

Modifier and Type	Method	Description
static java.util.stream.Collector<PlFormula,?,Conjunction>	PlCollectors.toConjunction()
static java.util.stream.Collector<java.util.Collection<? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctions()
static java.util.stream.Collector<Pair<? extends PlFormula,? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctivePairs()
static java.util.stream.Collector<Pair<? extends PlFormula,? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctivePairs()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctiveTriples()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctiveTriples()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Conjunction>	PlCollectors.toConjunctionOfDisjunctiveTriples()
static java.util.stream.Collector<PlFormula,?,Disjunction>	PlCollectors.toDisjunction()
static java.util.stream.Collector<java.util.Collection<? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctions()
static java.util.stream.Collector<Pair<? extends PlFormula,? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctivePairs()
static java.util.stream.Collector<Pair<? extends PlFormula,? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctivePairs()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctiveTriples()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctiveTriples()
static java.util.stream.Collector<Triple<? extends PlFormula,? extends PlFormula,? extends PlFormula>,?,Disjunction>	PlCollectors.toDisjunctionOfConjunctiveTriples()

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

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

Modifier and Type	Method	Description
PlFormula	PlFormulaGenerator.getRuleFormula(DefeasibleInferenceRule<PlFormula> r)

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

Modifier and Type	Method	Description
PlFormula	PlFormulaGenerator.getRuleFormula(DefeasibleInferenceRule<PlFormula> r)

Uses of PlFormula in net.sf.tweety.arg.aspic.util

Methods in net.sf.tweety.arg.aspic.util that return types with arguments of type PlFormula

Modifier and Type	Method	Description
static AspicArgumentationTheory<PlFormula>	RandomAspicArgumentationTheoryGenerator.next(int numPropositions, int numFormulas, int maxBodyLiterals, double probStrict)	Generates a random ASPIC argumentation theory with numPropositions and numFormulas formulas (inference rules).

Uses of PlFormula in net.sf.tweety.arg.deductive.reasoner

Methods in net.sf.tweety.arg.deductive.reasoner with parameters of type PlFormula

Modifier and Type	Method	Description
java.lang.Double	AbstractDeductiveArgumentationReasoner.query(DeductiveKnowledgeBase kb, PlFormula f)

Method parameters in net.sf.tweety.arg.deductive.reasoner with type arguments of type PlFormula

Modifier and Type	Method	Description
private ArgumentTree	SimpleDeductiveReasoner.getArgumentTree(DeductiveKnowledgeBase kb, DeductiveArgumentNode argNode, java.util.Set<PlFormula> support)	Computes the argument tree of the given argument.

Uses of PlFormula in net.sf.tweety.arg.deductive.semantics

Fields in net.sf.tweety.arg.deductive.semantics declared as PlFormula

Modifier and Type	Field	Description
private PlFormula	DeductiveArgument.claim	The claim of this argument.

Fields in net.sf.tweety.arg.deductive.semantics with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.Collection<? extends PlFormula>	DeductiveArgument.support	The support of this argument.

Methods in net.sf.tweety.arg.deductive.semantics that return PlFormula

Modifier and Type	Method	Description
PlFormula	DeductiveArgument.getClaim()	Returns the claim of this argument.

Methods in net.sf.tweety.arg.deductive.semantics that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<? extends PlFormula>	DeductiveArgument.getSupport()	Returns the support of this argument.

Constructors in net.sf.tweety.arg.deductive.semantics with parameters of type PlFormula

Constructor	Description
DeductiveArgument(java.util.Collection<? extends PlFormula> support, PlFormula claim)	Creates a new deductive argument with the given support and claim.
DeductiveArgumentNode(java.util.Collection<? extends PlFormula> support, PlFormula claim)	Creates a new deductive argument node with the given support and claim (a unique ID is generated)

Constructor parameters in net.sf.tweety.arg.deductive.semantics with type arguments of type PlFormula

Constructor	Description
CompilationNode(java.util.Collection<? extends PlFormula> formulas)	Creates a new compilation node with the given set of formulas.
DeductiveArgument(java.util.Collection<? extends PlFormula> support, PlFormula claim)	Creates a new deductive argument with the given support and claim.
DeductiveArgumentNode(java.util.Collection<? extends PlFormula> support, PlFormula claim)	Creates a new deductive argument node with the given support and claim (a unique ID is generated)

Uses of PlFormula in net.sf.tweety.arg.deductive.syntax

Fields in net.sf.tweety.arg.deductive.syntax declared as PlFormula

Modifier and Type	Field	Description
private PlFormula	SimplePlLogicArgument.claim
private PlFormula	SimplePlRule.claim

Fields in net.sf.tweety.arg.deductive.syntax with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.Set<PlFormula>	SimplePlRule.support

Methods in net.sf.tweety.arg.deductive.syntax that return PlFormula

Modifier and Type	Method	Description
PlFormula	SimplePlLogicArgument.getClaim()
PlFormula	SimplePlRule.getConclusion()

Methods in net.sf.tweety.arg.deductive.syntax that return types with arguments of type PlFormula

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

Methods in net.sf.tweety.arg.deductive.syntax with parameters of type PlFormula

Modifier and Type	Method	Description
void	SimplePlRule.addPremise(PlFormula arg0)
java.util.Set<DeductiveArgument>	DeductiveKnowledgeBase.getDeductiveArguments(PlFormula claim)	Computes all deductive arguments for the given claim.
void	SimplePlRule.setConclusion(PlFormula arg0)

Method parameters in net.sf.tweety.arg.deductive.syntax with type arguments of type PlFormula

Modifier and Type	Method	Description
void	SimplePlRule.addPremises(java.util.Collection<? extends PlFormula> arg0)

Constructors in net.sf.tweety.arg.deductive.syntax with parameters of type PlFormula

Constructor	Description
SimplePlLogicArgument(java.util.Collection<SimplePlRule> _support, PlFormula _claim)
SimplePlRule(PlFormula _claim)
SimplePlRule(PlFormula _claim, java.util.Set<PlFormula> _support)

Constructor parameters in net.sf.tweety.arg.deductive.syntax with type arguments of type PlFormula

Constructor	Description
DeductiveKnowledgeBase(java.util.Collection<? extends PlFormula> formulas)	Creates a new knowledge base with the given set of formulas.
SimplePlRule(PlFormula _claim, java.util.Set<PlFormula> _support)

Uses of PlFormula in net.sf.tweety.beliefdynamics.mas

Fields in net.sf.tweety.beliefdynamics.mas with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.Collection<InformationObject<PlFormula>>	AbstractCredibilityComparer.formulas	The information objects that hold the information which agents uttered the formulas.

Methods in net.sf.tweety.beliefdynamics.mas with parameters of type PlFormula

Modifier and Type	Method	Description
protected boolean	AbstractCredibilityComparer.isAtLeastAsPreferredAs(PlFormula f, java.util.Collection<? extends PlFormula> formulas)	Checks whether f is at least as preferred as some formula in "formulas"
protected boolean	AbstractCredibilityComparer.isAtLeastAsPreferredAs(PlFormula f, PlFormula f2)	Checks whether f is at least as preferred as f2

Method parameters in net.sf.tweety.beliefdynamics.mas with type arguments of type PlFormula

Modifier and Type	Method	Description
protected boolean	AbstractCredibilityComparer.isAtLeastAsPreferredAs(java.util.Collection<? extends PlFormula> col1, java.util.Collection<? extends PlFormula> col2)	Checks whether col1 is at least as preferred as col2 wrt.
protected boolean	AbstractCredibilityComparer.isAtLeastAsPreferredAs(PlFormula f, java.util.Collection<? extends PlFormula> formulas)	Checks whether f is at least as preferred as some formula in "formulas"

Constructor parameters in net.sf.tweety.beliefdynamics.mas with type arguments of type PlFormula

Constructor	Description
AbstractCredibilityComparer(java.util.Collection<InformationObject<PlFormula>> formulas, Order<Agent> credOrder)	Creates a new credibility comparer that is guided by the giving information which agents uttered the formulas and the credibility order.
CredibilityCategorizer(java.util.Collection<InformationObject<PlFormula>> formulas, Order<Agent> credOrder)	Creates a new credibility categorizer that is guided by the giving information which agents uttered the formulas and the credibility order.

Uses of PlFormula in net.sf.tweety.beliefdynamics.operators

Methods in net.sf.tweety.beliefdynamics.operators that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<PlFormula>	ArgumentativeRevisionOperator.revise(java.util.Collection<PlFormula> base, java.util.Collection<PlFormula> formulas)
java.util.Collection<InformationObject<PlFormula>>	CrMasArgumentativeRevisionOperator.revise(java.util.Collection<InformationObject<PlFormula>> base, java.util.Collection<InformationObject<PlFormula>> formulas)
java.util.Collection<InformationObject<PlFormula>>	CrMasSimpleRevisionOperator.revise(java.util.Collection<InformationObject<PlFormula>> base, java.util.Collection<InformationObject<PlFormula>> formulas)

Methods in net.sf.tweety.beliefdynamics.operators with parameters of type PlFormula

Modifier and Type	Method	Description
boolean	CrMasSimpleRevisionOperator.CredibilityComparer.isFormerAtLeastAsPreferredAsLatter(PlFormula f, java.util.Collection<PlFormula> formulas)

Method parameters in net.sf.tweety.beliefdynamics.operators with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	CrMasSimpleRevisionOperator.CredibilityComparer.isFormerAtLeastAsPreferredAsLatter(PlFormula f, java.util.Collection<PlFormula> formulas)
java.util.Collection<PlFormula>	ArgumentativeRevisionOperator.revise(java.util.Collection<PlFormula> base, java.util.Collection<PlFormula> formulas)
java.util.Collection<InformationObject<PlFormula>>	CrMasArgumentativeRevisionOperator.revise(java.util.Collection<InformationObject<PlFormula>> base, java.util.Collection<InformationObject<PlFormula>> formulas)
java.util.Collection<InformationObject<PlFormula>>	CrMasSimpleRevisionOperator.revise(java.util.Collection<InformationObject<PlFormula>> base, java.util.Collection<InformationObject<PlFormula>> formulas)

Constructor parameters in net.sf.tweety.beliefdynamics.operators with type arguments of type PlFormula

Constructor	Description
CredibilityComparer(java.util.Collection<InformationObject<PlFormula>> formulas, Order<Agent> credOrder)

Uses of PlFormula in net.sf.tweety.beliefdynamics.selectiverevision.argumentative

Methods in net.sf.tweety.beliefdynamics.selectiverevision.argumentative that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<PlFormula>	ArgumentativeTransformationFunction.transform(java.util.Collection<PlFormula> formulas)

Method parameters in net.sf.tweety.beliefdynamics.selectiverevision.argumentative with type arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<PlFormula>	ArgumentativeTransformationFunction.transform(java.util.Collection<PlFormula> formulas)

Uses of PlFormula in net.sf.tweety.logics.cl.reasoner

Methods in net.sf.tweety.logics.cl.reasoner with parameters of type PlFormula

Modifier and Type	Method	Description
java.lang.Boolean	AbstractConditionalLogicReasoner.query(ClBeliefSet beliefbase, PlFormula formula)

Method parameters in net.sf.tweety.logics.cl.reasoner with type arguments of type PlFormula

Modifier and Type	Method	Description
private void	SimpleCReasoner.filter(java.util.ArrayList<PlFormula> list, ClBeliefSet beliefset)

Uses of PlFormula in net.sf.tweety.logics.cl.semantics

Methods in net.sf.tweety.logics.cl.semantics with parameters of type PlFormula

Modifier and Type	Method	Description
java.lang.Integer	RankingFunction.rank(PlFormula formula)	Gets the rank of the given formula.

Method parameters in net.sf.tweety.logics.cl.semantics with type arguments of type PlFormula

Modifier and Type	Method	Description
void	RankingFunction.forceStrictness(java.util.Set<PlFormula> formulas)	Sets the rank of every interpretation i that does not satisfy the given set of formulas to RankingFunction.INFINITY.

Uses of PlFormula in net.sf.tweety.logics.cl.syntax

Fields in net.sf.tweety.logics.cl.syntax declared as PlFormula

Modifier and Type	Field	Description
private PlFormula	Conditional.conclusion	The conclusion of this conditional.
private PlFormula	Conditional.premise	The premise of this conditional.

Methods in net.sf.tweety.logics.cl.syntax that return PlFormula

Modifier and Type	Method	Description
PlFormula	Conditional.getConclusion()

Methods in net.sf.tweety.logics.cl.syntax that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<PlFormula>	Conditional.getPremise()

Methods in net.sf.tweety.logics.cl.syntax with parameters of type PlFormula

Modifier and Type	Method	Description
void	Conditional.addPremise(PlFormula premise)
void	Conditional.setConclusion(PlFormula conclusion)

Method parameters in net.sf.tweety.logics.cl.syntax with type arguments of type PlFormula

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

Constructors in net.sf.tweety.logics.cl.syntax with parameters of type PlFormula

Constructor	Description
Conditional(PlFormula conclusion)	Creates a new conditional with a tautological premise and given conclusion.
Conditional(PlFormula premise, PlFormula conclusion)	Creates a new conditional with the given premise and conclusion.

Uses of PlFormula in net.sf.tweety.logics.pcl.reasoner

Methods in net.sf.tweety.logics.pcl.reasoner with parameters of type PlFormula

Modifier and Type	Method	Description
abstract java.lang.Double	AbstractPclReasoner.query(PclBeliefSet beliefbase, PlFormula formula)
java.lang.Double	DefaultMeReasoner.query(PclBeliefSet beliefbase, PlFormula formula)
java.lang.Double	GeneralizedMeReasoner.query(PclBeliefSet beliefbase, PlFormula formula)

Uses of PlFormula in net.sf.tweety.logics.pcl.semantics

Classes in net.sf.tweety.logics.pcl.semantics with type parameters of type PlFormula

Modifier and Type	Class	Description
class	ProbabilityDistribution<T extends Interpretation<PlBeliefSet,PlFormula>>	This class represents a probability distribution on some logical language

Methods in net.sf.tweety.logics.pcl.semantics with type parameters of type PlFormula

Modifier and Type	Method	Description
static <S extends Interpretation<PlBeliefSet,PlFormula>> ProbabilityDistribution<S>	ProbabilityDistribution.convexCombination(double[] factors, ProbabilityDistribution<S>[] creators)	Computes the convex combination of the given probability distributions P1,...,PN with parameters factors, i.e.
static <S extends Interpretation<PlBeliefSet,PlFormula>> ProbabilityDistribution<S>	ProbabilityDistribution.getUniformDistribution(java.util.Set<S> interpretations, Signature sig)	Returns the uniform distribution on the given interpretations.

Methods in net.sf.tweety.logics.pcl.semantics with parameters of type PlFormula

Modifier and Type	Method	Description
Probability	ProbabilityDistribution.probability(PlFormula f)	Returns the probability of the given formula

Method parameters in net.sf.tweety.logics.pcl.semantics with type arguments of type PlFormula

Modifier and Type	Method	Description
Probability	ProbabilityDistribution.probability(Interpretation<PlBeliefSet,PlFormula> w)	Gets the probability of the given Herbrand interpretation (this is just an alias for get(Object o).

Uses of PlFormula in net.sf.tweety.logics.pcl.syntax

Constructors in net.sf.tweety.logics.pcl.syntax with parameters of type PlFormula

Constructor	Description
ProbabilisticConditional(PlFormula premise, PlFormula conclusion, Probability probability)	Creates a new probabilistic conditional with the given premise, conclusion, and probability.
ProbabilisticConditional(PlFormula conclusion, Probability probability)	Creates a new probabilistic conditional with a tautological premise and given conclusion and probability.

Uses of PlFormula in net.sf.tweety.logics.pl.analysis

Fields in net.sf.tweety.logics.pl.analysis with type parameters of type PlFormula

Modifier and Type	Field	Description
private ConsistencyWitnessProvider<PlBeliefSet,PlFormula>	ContensionInconsistencyMeasurementProcess.witnessProvider	The witness provider used.
private ConsistencyWitnessProvider<PlBeliefSet,PlFormula>	HsInconsistencyMeasurementProcess.witnessProvider	The witness provider used.

Methods in net.sf.tweety.logics.pl.analysis that return types with arguments of type PlFormula

Modifier and Type	Method	Description
static InconsistencyMeasure<BeliefSet<PlFormula,?>>	InconsistencyMeasureFactory.getInconsistencyMeasure(InconsistencyMeasureFactory.Measure im)	Creates a new inconsistency measure of the given type with default settings.

Methods in net.sf.tweety.logics.pl.analysis with parameters of type PlFormula

Modifier and Type	Method	Description
double	PossibleWorldDistance.distance(PlFormula f, PossibleWorld b)
private int	PmInconsistencyMeasure.getNumOfMinmalProofs(PlFormula f, java.util.Collection<PlFormula> formulas)	Returns the number of minimal proofs of f in formulas.
private Term	FuzzyInconsistencyMeasure.getTerm(PlFormula formula, java.util.Map<Proposition,Variable> assignments)	Returns a mathematical term representation of the given formula by replacing proposition by their given mathematical variables and replacing conjunction, disjunction, and negation by their fuzzy counterparts (taking the given t-norm and t-conorm into account).
protected double	ContensionInconsistencyMeasurementProcess.update(PlFormula formula)
protected double	HsInconsistencyMeasurementProcess.update(PlFormula formula)

Method parameters in net.sf.tweety.logics.pl.analysis with type arguments of type PlFormula

Modifier and Type	Method	Description
private Pair<java.util.Map<Variable,Term>,java.lang.Double>	FuzzyInconsistencyMeasure.constructAndSolveProblem(java.util.Collection<PlFormula> formulas, java.util.Map<Proposition,Variable> assignments)	Utility method
private int	PmInconsistencyMeasure.getNumOfMinmalProofs(PlFormula f, java.util.Collection<PlFormula> formulas)	Returns the number of minimal proofs of f in formulas.
FuzzyInterpretation	FuzzyInconsistencyMeasure.getOptimalInterpretation(java.util.Collection<PlFormula> formulas)	Returns an optimal interpretation as a witness for the inconsistency value.
java.lang.Double	ContensionInconsistencyMeasure.inconsistencyMeasure(java.util.Collection<PlFormula> formulas)
java.lang.Double	FbInconsistencyMeasure.inconsistencyMeasure(java.util.Collection<PlFormula> formulas)
java.lang.Double	FuzzyInconsistencyMeasure.inconsistencyMeasure(java.util.Collection<PlFormula> formulas)
java.lang.Double	MusVarInconsistencyMeasure.inconsistencyMeasure(java.util.Collection<PlFormula> formulas)
java.lang.Double	PmInconsistencyMeasure.inconsistencyMeasure(java.util.Collection<PlFormula> formulas)

Uses of PlFormula in net.sf.tweety.logics.pl.parser

Methods in net.sf.tweety.logics.pl.parser that return PlFormula

Modifier and Type	Method	Description
private PlFormula	PlParser.parseAtomic(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	PlParser.parseConjunction(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
protected PlFormula	PlParser.parseDisjunction(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	PlParser.parseEquivalence(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
PlFormula	PlParser.parseFormula(java.io.Reader reader)
private PlFormula	PlParser.parseImplication(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
private PlFormula	PlParser.parseNegation(java.util.List<java.lang.Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.

Methods in net.sf.tweety.logics.pl.parser that return types with arguments of type PlFormula

Modifier and Type	Method	Description
static Parser<PlBeliefSet,PlFormula>	PlParserFactory.getParserForFormat(PlParserFactory.Format f)	Retrieves an appropriate parser for the given format.

Uses of PlFormula in net.sf.tweety.logics.pl.postulates

Method parameters in net.sf.tweety.logics.pl.postulates with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	ImAdjunctionInvariance.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImAttenuation.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImConsistency.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImContradiction.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImDominance.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImEqualConflict.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImExchange.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImFreeFormulaDilution.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImFreeFormulaIndependence.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImIrrelevanceOfSyntax.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImMINormalization.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImMonotony.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImNormalization.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImPenalty.isApplicable(java.util.Collection<PlFormula> kb)
abstract boolean	ImPostulate.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImSafeFormulaIndependence.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImSuperAdditivity.isApplicable(java.util.Collection<PlFormula> kb)
boolean	ImAdjunctionInvariance.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAdjunctionInvariance.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAttenuation.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAttenuation.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImConsistency.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImConsistency.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImContradiction.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImContradiction.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImDominance.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImDominance.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImEqualConflict.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImEqualConflict.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImExchange.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImExchange.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaDilution.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaDilution.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaIndependence.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaIndependence.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImIrrelevanceOfSyntax.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImIrrelevanceOfSyntax.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMINormalization.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMINormalization.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMonotony.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMonotony.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImNormalization.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImNormalization.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPenalty.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPenalty.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPostulate.isSatisfied(java.util.Collection<PlFormula> kb, PostulateEvaluatable<PlFormula> ev)
boolean	ImPostulate.isSatisfied(java.util.Collection<PlFormula> kb, PostulateEvaluatable<PlFormula> ev)
abstract boolean	ImPostulate.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
abstract boolean	ImPostulate.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSafeFormulaIndependence.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSafeFormulaIndependence.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSuperAdditivity.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSuperAdditivity.isSatisfied(java.util.Collection<PlFormula> kb, BeliefSetInconsistencyMeasure<PlFormula> ev)

Uses of PlFormula in net.sf.tweety.logics.pl.reasoner

Methods in net.sf.tweety.logics.pl.reasoner that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<java.util.Collection<PlFormula>>	AbstractPlReasoner.getKernels(java.util.Collection<PlFormula> formulas, PlFormula formula)

Methods in net.sf.tweety.logics.pl.reasoner with parameters of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<java.util.Collection<PlFormula>>	AbstractPlReasoner.getKernels(java.util.Collection<PlFormula> formulas, PlFormula formula)
boolean	AbstractPlReasoner.isEquivalent(PlFormula p1, PlFormula p2)	Checks whether the two formulas are equivalent
abstract java.lang.Boolean	AbstractPlReasoner.query(PlBeliefSet beliefbase, PlFormula formula)
boolean	AbstractPlReasoner.query(PlFormula formula, PlFormula formula2)	Checks whether the first formula entails the second.
java.lang.Boolean	SatReasoner.query(PlBeliefSet beliefbase, PlFormula formula)
java.lang.Boolean	SimplePlReasoner.query(PlBeliefSet beliefbase, PlFormula formula)

Method parameters in net.sf.tweety.logics.pl.reasoner with type arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Collection<java.util.Collection<PlFormula>>	AbstractPlReasoner.getKernels(java.util.Collection<PlFormula> formulas, PlFormula formula)

Uses of PlFormula in net.sf.tweety.logics.pl.sat

Fields in net.sf.tweety.logics.pl.sat with type parameters of type PlFormula

Modifier and Type	Field	Description
private static AbstractMusEnumerator<PlFormula>	PlMusEnumerator.defaultEnumerator	The default MUS enumerator.

Methods in net.sf.tweety.logics.pl.sat that return types with arguments of type PlFormula

Modifier and Type	Method	Description
static Pair<java.lang.String,java.util.List<PlFormula>>	SatSolver.convertToDimacs(java.util.Collection<PlFormula> formulas)	Converts the given set of formulas to their string representation in Dimacs CNF.
protected static Pair<java.io.File,java.util.List<PlFormula>>	SatSolver.createTmpDimacsFile(java.util.Collection<PlFormula> formulas)	Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
static AbstractMusEnumerator<PlFormula>	PlMusEnumerator.getDefaultEnumerator()	Returns the default MUS enumerator. If a default MUS enumerator has been configured this enumerator is returned by this method.
Interpretation<PlBeliefSet,PlFormula>	LingelingSolver.getWitness(java.util.Collection<PlFormula> formulas)
Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(java.util.Collection<PlFormula> formulas)
abstract Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns an interpretation with maximal weight on the soft constraints (or null if the hard constraints are not satisfiable)
Interpretation<PlBeliefSet,PlFormula>	OpenWboSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)
Interpretation<PlBeliefSet,PlFormula>	Sat4jSolver.getWitness(java.util.Collection<PlFormula> formulas)
abstract Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(java.util.Collection<PlFormula> formulas)	If the collection of formulas is consistent this method returns some model of it or, if it is inconsistent, null.
Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(BeliefSet<PlFormula,?> bs)
Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(PlFormula formula)
Interpretation<PlBeliefSet,PlFormula>	SimpleDpllSolver.getWitness(java.util.Collection<PlFormula> formulas)
java.util.Collection<java.util.Collection<PlFormula>>	MarcoMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)
java.util.Collection<java.util.Collection<PlFormula>>	MimusMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)
abstract java.util.Collection<java.util.Collection<PlFormula>>	PlMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)

Methods in net.sf.tweety.logics.pl.sat with parameters of type PlFormula

Modifier and Type	Method	Description
Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(PlFormula formula)
boolean	SatSolver.isConsistent(PlFormula formula)

Method parameters in net.sf.tweety.logics.pl.sat with type arguments of type PlFormula

Modifier and Type	Method	Description
static Pair<java.lang.String,java.util.List<PlFormula>>	SatSolver.convertToDimacs(java.util.Collection<PlFormula> formulas)	Converts the given set of formulas to their string representation in Dimacs CNF.
protected static java.lang.String	SatSolver.convertToDimacs(java.util.Collection<PlFormula> formulas, java.util.List<Proposition> props)	Converts the given set of formulas to their string representation in Dimacs CNF.
protected static java.lang.String	MaxSatSolver.convertToDimacsWcnf(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints, java.util.List<Proposition> props)	Converts the given MaxSAT instance (i.e.
protected static java.lang.String	MaxSatSolver.convertToDimacsWcnf(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints, java.util.List<Proposition> props)	Converts the given MaxSAT instance (i.e.
static int	MaxSatSolver.costOf(Interpretation<PlBeliefSet,PlFormula> interpretation, java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
static int	MaxSatSolver.costOf(Interpretation<PlBeliefSet,PlFormula> interpretation, java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
static int	MaxSatSolver.costOf(Interpretation<PlBeliefSet,PlFormula> interpretation, java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
protected static Pair<java.io.File,java.util.List<PlFormula>>	SatSolver.createTmpDimacsFile(java.util.Collection<PlFormula> formulas)	Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
protected static java.io.File	SatSolver.createTmpDimacsFile(java.util.Collection<PlFormula> formulas, java.util.List<Proposition> props)	Creates a temporary file in Dimacs format with the given proposition2variable mapping.
protected static java.io.File	MaxSatSolver.createTmpDimacsWcnfFile(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints, java.util.List<Proposition> props)	Converts the given MaxSAT instance (i.e.
protected static java.io.File	MaxSatSolver.createTmpDimacsWcnfFile(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints, java.util.List<Proposition> props)	Converts the given MaxSAT instance (i.e.
Interpretation<PlBeliefSet,PlFormula>	LingelingSolver.getWitness(java.util.Collection<PlFormula> formulas)
Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(java.util.Collection<PlFormula> formulas)
abstract Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns an interpretation with maximal weight on the soft constraints (or null if the hard constraints are not satisfiable)
abstract Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)	Returns an interpretation with maximal weight on the soft constraints (or null if the hard constraints are not satisfiable)
Interpretation<PlBeliefSet,PlFormula>	OpenWboSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)
Interpretation<PlBeliefSet,PlFormula>	OpenWboSolver.getWitness(java.util.Collection<PlFormula> hardConstraints, java.util.Map<PlFormula,java.lang.Integer> softConstraints)
Interpretation<PlBeliefSet,PlFormula>	Sat4jSolver.getWitness(java.util.Collection<PlFormula> formulas)
abstract Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(java.util.Collection<PlFormula> formulas)	If the collection of formulas is consistent this method returns some model of it or, if it is inconsistent, null.
Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(BeliefSet<PlFormula,?> bs)
Interpretation<PlBeliefSet,PlFormula>	SimpleDpllSolver.getWitness(java.util.Collection<PlFormula> formulas)
boolean	SatSolver.isConsistent(java.util.Collection<PlFormula> formulas)
boolean	SatSolver.isConsistent(BeliefSet<PlFormula,?> beliefSet)
boolean	LingelingSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)
boolean	MaxSatSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)
boolean	Sat4jSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)
abstract boolean	SatSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)	Checks whether the given set of formulas is satisfiable.
boolean	SimpleDpllSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)
java.util.Collection<java.util.Collection<PlFormula>>	MarcoMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)
java.util.Collection<java.util.Collection<PlFormula>>	MimusMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)
abstract java.util.Collection<java.util.Collection<PlFormula>>	PlMusEnumerator.minimalInconsistentSubsets(java.util.Collection<PlFormula> formulas)
static void	PlMusEnumerator.setDefaultEnumerator(AbstractMusEnumerator<PlFormula> enumerator)	Sets the default MUS enumerator.

Uses of PlFormula in net.sf.tweety.logics.pl.semantics

Methods in net.sf.tweety.logics.pl.semantics that return PlFormula

Modifier and Type	Method	Description
PlFormula	PossibleWorld.getCompleteConjunction(PlSignature sig)	Returns the complete conjunction representing this possible world wrt.

Methods in net.sf.tweety.logics.pl.semantics that return types with arguments of type PlFormula

Modifier and Type	Method	Description
InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset()
InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset(java.util.Collection<? extends Formula> formulas)
InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset(Signature sig)

Methods in net.sf.tweety.logics.pl.semantics with parameters of type PlFormula

Modifier and Type	Method	Description
boolean	FuzzyInterpretation.satisfies(PlFormula formula)
boolean	NicePossibleWorld.satisfies(PlFormula formula)
boolean	PossibleWorld.satisfies(PlFormula formula)
boolean	PriestWorld.satisfies(PlFormula formula)
PriestWorld.TruthValue	PriestWorld.satisfies3VL(PlFormula formula)	Determines the 3-valued truth value of the given formula.

Method parameters in net.sf.tweety.logics.pl.semantics with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	PossibleWorld.satisfies(java.util.Collection<PlFormula> formulas)

Uses of PlFormula in net.sf.tweety.logics.pl.syntax

Subclasses of PlFormula in net.sf.tweety.logics.pl.syntax

Modifier and Type	Class	Description
class	AssociativePlFormula	This class captures the common functionalities of formulas with an associative operation like conjunction, disjunction, etc.
class	Conjunction	This class represents a conjunction in propositional logic.
class	Contradiction	A contradictory formula.
class	Disjunction	This class represents a disjunction in propositional logic.
class	Equivalence	This class models equivalence of propositional logic.
class	Implication	This class models the implication of propositional logic.
class	Negation	This class models classical negation of propositional logic.
class	Proposition	This class represents a simple proposition in propositional 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.pl.syntax declared as PlFormula

Modifier and Type	Field	Description
private PlFormula	Negation.formula	The formula within this negation.

Fields in net.sf.tweety.logics.pl.syntax with type parameters of type PlFormula

Modifier and Type	Field	Description
private Pair<PlFormula,PlFormula>	Equivalence.formulas	The pair of formulas that are part of the equivalence.
private Pair<PlFormula,PlFormula>	Equivalence.formulas	The pair of formulas that are part of the equivalence.
private Pair<PlFormula,PlFormula>	Implication.formulas	The pair of formulas that are part of the implication.
private Pair<PlFormula,PlFormula>	Implication.formulas	The pair of formulas that are part of the implication.
protected AssociativeFormulaSupport<PlFormula>	AssociativePlFormula.support	The inner formulas of this formula

Methods in net.sf.tweety.logics.pl.syntax that return PlFormula

Modifier and Type	Method	Description
PlFormula	Disjunction.clone()
PlFormula	Negation.clone()
abstract PlFormula	PlFormula.clone()
PlFormula	Conjunction.collapseAssociativeFormulas()
PlFormula	Disjunction.collapseAssociativeFormulas()
PlFormula	Equivalence.collapseAssociativeFormulas()
PlFormula	Implication.collapseAssociativeFormulas()
PlFormula	Negation.collapseAssociativeFormulas()
abstract PlFormula	PlFormula.collapseAssociativeFormulas()	This method collapses all associative operations appearing in this term, e.g.
PlFormula	Proposition.collapseAssociativeFormulas()
PlFormula	SpecialFormula.collapseAssociativeFormulas()
PlFormula	AssociativePlFormula.get(int index)
PlFormula	Negation.getFormula()	Returns the formula within this negation.
PlFormula	AssociativePlFormula.remove(int index)
PlFormula	Conjunction.replace(Proposition p, PlFormula f, int i)
PlFormula	Disjunction.replace(Proposition p, PlFormula f, int i)
PlFormula	Equivalence.replace(Proposition p, PlFormula f, int i)
PlFormula	Implication.replace(Proposition p, PlFormula f, int i)
PlFormula	Negation.replace(Proposition p, PlFormula f, int i)
abstract PlFormula	PlFormula.replace(Proposition p, PlFormula f, int i)	Replaces the ith instance of the proposition p by f.
PlFormula	Proposition.replace(Proposition p, PlFormula f, int i)
PlFormula	SpecialFormula.replace(Proposition p, PlFormula f, int i)
PlFormula	AssociativePlFormula.set(int index, PlFormula element)
PlFormula	PlFormula.toBlakeCanonicalForm()	This method returns this formula in Blake canonical form.
PlFormula	PlFormula.toDnf()	This method returns this formula in disjunctive normal form (DNF).
PlFormula	Conjunction.toNnf()
PlFormula	Disjunction.toNnf()
PlFormula	Equivalence.toNnf()
PlFormula	Implication.toNnf()
PlFormula	Negation.toNnf()
abstract PlFormula	PlFormula.toNnf()	This method returns this formula in negation normal form (NNF).
PlFormula	Proposition.toNnf()
PlFormula	SpecialFormula.toNnf()
PlFormula	Conjunction.trim()
PlFormula	Disjunction.trim()
PlFormula	Equivalence.trim()
PlFormula	Implication.trim()
PlFormula	Negation.trim()
abstract PlFormula	PlFormula.trim()	Removes duplicates (identical formulas) from conjunctions and disjunctions and removes duplicate negations.
PlFormula	Proposition.trim()
PlFormula	SpecialFormula.trim()

Methods in net.sf.tweety.logics.pl.syntax that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.List<PlFormula>	PlBeliefSet.getCanonicalOrdering()	Force ordering on belief set based on comparison of hash codes.
java.util.List<PlFormula>	AssociativePlFormula.getFormulas()
Pair<PlFormula,PlFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
Pair<PlFormula,PlFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
Pair<PlFormula,PlFormula>	Implication.getFormulas()	Returns the formulas of the implication.
Pair<PlFormula,PlFormula>	Implication.getFormulas()	Returns the formulas of the implication.
java.util.Set<PlFormula>	AssociativePlFormula.getLiterals()
java.util.Set<PlFormula>	Equivalence.getLiterals()
java.util.Set<PlFormula>	Implication.getLiterals()
java.util.Set<PlFormula>	Negation.getLiterals()
abstract java.util.Set<PlFormula>	PlFormula.getLiterals()	Returns all literals, i.e.
java.util.Set<PlFormula>	Proposition.getLiterals()
java.util.Set<PlFormula>	SpecialFormula.getLiterals()
java.util.Collection<PlFormula>	PlFormula.getPrimeImplicants()	Returns the set of prime implicants of this formula.
java.util.Iterator<PlFormula>	AssociativePlFormula.iterator()
java.util.ListIterator<PlFormula>	AssociativePlFormula.listIterator()
java.util.ListIterator<PlFormula>	AssociativePlFormula.listIterator(int index)
java.util.List<PlFormula>	AssociativePlFormula.subList(int fromIndex, int toIndex)

Methods in net.sf.tweety.logics.pl.syntax with parameters of type PlFormula

Modifier and Type	Method	Description
void	AssociativePlFormula.add(int index, PlFormula element)
boolean	AssociativePlFormula.add(PlFormula f)
int	PlBeliefSet.PlFormulaHashCodeComparator.compare(PlFormula p1, PlFormula p2)
boolean	Negation.hasLowerBindingPriority(PlFormula other)
PlFormula	Conjunction.replace(Proposition p, PlFormula f, int i)
PlFormula	Disjunction.replace(Proposition p, PlFormula f, int i)
PlFormula	Equivalence.replace(Proposition p, PlFormula f, int i)
PlFormula	Implication.replace(Proposition p, PlFormula f, int i)
PlFormula	Negation.replace(Proposition p, PlFormula f, int i)
abstract PlFormula	PlFormula.replace(Proposition p, PlFormula f, int i)	Replaces the ith instance of the proposition p by f.
PlFormula	Proposition.replace(Proposition p, PlFormula f, int i)
PlFormula	SpecialFormula.replace(Proposition p, PlFormula f, int i)
boolean	PlFormula.resolvableWith(PlFormula other)	Checks whether this formula (which must be a conjunction of literals) is resolvable with the given formulas (which is also a conjunction of literals, i.e.
Conjunction	PlFormula.resolveWith(PlFormula other)	Resolves this formula with the given one (both have to be conjunctive clauses) and returns some resolvent.
PlFormula	AssociativePlFormula.set(int index, PlFormula element)
void	Implication.setFirstFormula(PlFormula left)	Sets the left side formula of the implication left => right.
void	Implication.setSecondFormula(PlFormula right)	Sets the right side formula of the implication left => right

Method parameters in net.sf.tweety.logics.pl.syntax with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	AssociativePlFormula.addAll(int index, java.util.Collection<? extends PlFormula> c)
boolean	AssociativePlFormula.addAll(java.util.Collection<? extends PlFormula> c)
static PlSignature	PlSignature.getSignature(java.util.Collection<? extends PlFormula> formulas)	Returns the set of atoms appearing in the given collection of formulas.
void	Equivalence.setFormulas(Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the equivalence.
void	Equivalence.setFormulas(Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the equivalence.
void	Implication.setFormulas(Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the implication.
void	Implication.setFormulas(Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the implication.

Constructors in net.sf.tweety.logics.pl.syntax with parameters of type PlFormula

Constructor	Description
AssociativePlFormula(PlFormula first, PlFormula second)	Creates a new associative formula with the two given formulae
Conjunction(PlFormula first, PlFormula second)	Creates a new conjunction with the two given formulae
Disjunction(PlFormula first, PlFormula second)	Creates a new disjunction with the two given formulae
Equivalence(PlFormula a, PlFormula b)	Creates a new equivalence with the given two formulas
Implication(PlFormula a, PlFormula b)	Creates a new implication a=>b with the two given formulas
Negation(PlFormula formula)	Creates a new negation with the given formula.

Constructor parameters in net.sf.tweety.logics.pl.syntax with type arguments of type PlFormula

Constructor	Description
AssociativePlFormula(java.util.Collection<? extends PlFormula> formulas)	Creates a new associative formula with the given inner formulas.
Conjunction(java.util.Collection<? extends PlFormula> formulas)	Creates a new conjunction with the given inner formulas.
Disjunction(java.util.Collection<? extends PlFormula> formulas)	Creates a new disjunction with the given inner formulas.
Equivalence(Pair<PlFormula,PlFormula> formulas)	Creates a new equivalence with the given pair of formulas
Equivalence(Pair<PlFormula,PlFormula> formulas)	Creates a new equivalence with the given pair of formulas
Implication(Pair<PlFormula,PlFormula> formulas)	Creates a new implication with the given pair of formulas
Implication(Pair<PlFormula,PlFormula> formulas)	Creates a new implication with the given pair of formulas
PlBeliefSet(java.util.Collection<? extends PlFormula> formulas)	Creates a new knowledge base with the given set of formulas.

Uses of PlFormula in net.sf.tweety.logics.pl.test

Fields in net.sf.tweety.logics.pl.test with type parameters of type PlFormula

Modifier and Type	Field	Description
private CspInconsistencyMeasure<PlFormula>	CspInconsistencyMeasureTest.m

Uses of PlFormula in net.sf.tweety.logics.pl.util

Methods in net.sf.tweety.logics.pl.util that return PlFormula

Modifier and Type	Method	Description
private PlFormula	RandomSampler.randomFormula()	Returns a random formula.
PlFormula	CnfSampler.sampleFormula()	Returns a random formula
PlFormula	SyntacticRandomSampler.sampleFormula(ProbabilityFunction<java.lang.Byte> prob)	Samples a single formula.

Methods in net.sf.tweety.logics.pl.util that return types with arguments of type PlFormula

Modifier and Type	Method	Description
private java.util.List<PlFormula>	HsSampler.getCanonicalFormulas(int num, PlSignature sig)	For a signature {a1,...,an} creates num different canonical and mutually exclusive formulas of the form a1a2a3, a1a2-a3, a1-a2a3, etc.
private Pair<java.util.Collection<PlFormula>,java.lang.Integer>	CanonicalIterator.parseAssociativeFormula(java.util.BitSet s, int idx, int numOfTerms, PlSignature sig)	Parses an associate formula from the given bitset starting at index idx, with the given number of terms and the given signature
private Pair<PlFormula,java.lang.Integer>	CanonicalIterator.parseFormula(java.util.BitSet s, int idx, PlSignature sig)	Reads the next formula of the given bitset, starting at the given index.
private Pair<PlFormula,java.lang.Integer>	CanonicalIterator.parseProposition(java.util.BitSet s, int idx, PlSignature sig)	Parses a proposition in bitset s starting from idx.

Methods in net.sf.tweety.logics.pl.util with parameters of type PlFormula

Modifier and Type	Method	Description
private static java.lang.String	CanonicalIterator.formula2String(PlFormula f, java.util.Map<Proposition,java.lang.Integer> prop)	Encodes the given formula as a bitstring.

Uses of PlFormula in net.sf.tweety.logics.pl.writer

Constructors in net.sf.tweety.logics.pl.writer with parameters of type PlFormula

Constructor	Description
PlWriter(PlFormula plFormula)

Uses of PlFormula in net.sf.tweety.logics.qbf.parser

Fields in net.sf.tweety.logics.qbf.parser with type parameters of type PlFormula

Modifier and Type	Field	Description
private java.util.Map<java.lang.String,PlFormula>	QCirParser.gate_variables	Keeps track of the formulas that are assigned to specific gate variables.

Methods in net.sf.tweety.logics.qbf.parser that return PlFormula

Modifier and Type	Method	Description
PlFormula	QCirParser.getOutputVariable()
private PlFormula	QCirParser.parseAssociativeFormula(java.lang.String prefix, java.lang.String innerFormula)	Parses an associative formula, i.e.
private PlFormula	QbfParser.parseEquivalence(java.util.List<java.lang.Object> l)
PlFormula	QbfParser.parseFormula(java.io.Reader reader)
PlFormula	QCirParser.parseFormula(java.io.Reader reader)
private PlFormula	QCirParser.parseGateFormula(java.lang.String formula)	This method parses a gate formula, meaning a conjunction, disjunction, quantification, xor-construct or if-then-else-construct.
private PlFormula	QCirParser.parseIfThenElse(java.lang.String innerFormula)	Parses an if-then-else construct.
private PlFormula	QbfParser.parseImplication(java.util.List<java.lang.Object> l)
private PlFormula	QCirParser.parseLiteral(java.lang.String literal, boolean parseGateVariables)	Parses variables and their negations.
private PlFormula	QbfParser.parseQuantification(java.util.List<java.lang.Object> l)	Parses a quantification
private PlFormula	QCirParser.parseQuantification(java.lang.String prefix, java.lang.String innerFormula)	Parses a quantified formula.
private PlFormula	QCirParser.parseXor(java.lang.String innerFormula)	Parses an xor construct.

Uses of PlFormula in net.sf.tweety.logics.qbf.reasoner

Methods in net.sf.tweety.logics.qbf.reasoner with parameters of type PlFormula

Modifier and Type	Method	Description
boolean	QbfSolver.isConsistent(PlFormula formula)
java.lang.Boolean	NaiveQbfReasoner.query(PlBeliefSet beliefbase, PlFormula formula)

Method parameters in net.sf.tweety.logics.qbf.reasoner with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	QbfSolver.isConsistent(java.util.Collection<PlFormula> formulas)
boolean	QbfSolver.isConsistent(BeliefSet<PlFormula,?> beliefSet)
boolean	CadetSolver.isSatisfiable(java.util.Collection<PlFormula> kb)
boolean	CaqeSolver.isSatisfiable(java.util.Collection<PlFormula> kb)
boolean	GhostQSolver.isSatisfiable(java.util.Collection<PlFormula> kb)
abstract boolean	QbfSolver.isSatisfiable(java.util.Collection<PlFormula> formulas)	Checks whether the given set of formulas is satisfiable.
boolean	QuteSolver.isSatisfiable(java.util.Collection<PlFormula> kb)

Uses of PlFormula in net.sf.tweety.logics.qbf.semantics

Methods in net.sf.tweety.logics.qbf.semantics that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Set<PlFormula>	QbPossibleWorld.substitute(PlFormula f, Proposition v)	Substitutes all occurrences of the proposition v with the possible truth values and returns a set of the possible substitutions.

Methods in net.sf.tweety.logics.qbf.semantics with parameters of type PlFormula

Modifier and Type	Method	Description
boolean	QbPossibleWorld.satisfies(PlFormula formula)	Checks whether this interpretation satisfies the given formula.
java.util.Set<PlFormula>	QbPossibleWorld.substitute(PlFormula f, Proposition v)	Substitutes all occurrences of the proposition v with the possible truth values and returns a set of the possible substitutions.

Method parameters in net.sf.tweety.logics.qbf.semantics with type arguments of type PlFormula

Modifier and Type	Method	Description
boolean	QbPossibleWorld.satisfies(java.util.Collection<PlFormula> formulas)	Checks whether this interpretation satisfies the given formula.

Uses of PlFormula in net.sf.tweety.logics.qbf.syntax

Subclasses of PlFormula in net.sf.tweety.logics.qbf.syntax

Modifier and Type	Class	Description
class	ExistsQuantifiedFormula	This class represents existential quantification for boolean formulas.
class	ForallQuantifiedFormula	This class represents universal quantification for boolean formulas.

Fields in net.sf.tweety.logics.qbf.syntax declared as PlFormula

Modifier and Type	Field	Description
private PlFormula	ExistsQuantifiedFormula.innerFormula	The quantified formula.
private PlFormula	ForallQuantifiedFormula.innerFormula	The quantified formula.

Methods in net.sf.tweety.logics.qbf.syntax that return PlFormula

Modifier and Type	Method	Description
PlFormula	ExistsQuantifiedFormula.clone()
PlFormula	ForallQuantifiedFormula.clone()
PlFormula	ExistsQuantifiedFormula.collapseAssociativeFormulas()
PlFormula	ForallQuantifiedFormula.collapseAssociativeFormulas()
PlFormula	ExistsQuantifiedFormula.getFormula()
PlFormula	ForallQuantifiedFormula.getFormula()
PlFormula	ExistsQuantifiedFormula.replace(Proposition p, PlFormula f, int i)
PlFormula	ForallQuantifiedFormula.replace(Proposition p, PlFormula f, int i)
PlFormula	ExistsQuantifiedFormula.toNnf()
PlFormula	ForallQuantifiedFormula.toNnf()
PlFormula	ExistsQuantifiedFormula.trim()
PlFormula	ForallQuantifiedFormula.trim()

Methods in net.sf.tweety.logics.qbf.syntax that return types with arguments of type PlFormula

Modifier and Type	Method	Description
java.util.Set<PlFormula>	ExistsQuantifiedFormula.getLiterals()
java.util.Set<PlFormula>	ForallQuantifiedFormula.getLiterals()

Methods in net.sf.tweety.logics.qbf.syntax with parameters of type PlFormula

Modifier and Type	Method	Description
PlFormula	ExistsQuantifiedFormula.replace(Proposition p, PlFormula f, int i)
PlFormula	ForallQuantifiedFormula.replace(Proposition p, PlFormula f, int i)

Constructors in net.sf.tweety.logics.qbf.syntax with parameters of type PlFormula

Constructor	Description
ExistsQuantifiedFormula(PlFormula f, java.util.Set<Proposition> variables)	Create a new existential boolean quantification.
ExistsQuantifiedFormula(PlFormula f, Proposition variable)	Create a new existential boolean quantification.
ForallQuantifiedFormula(PlFormula f, java.util.Set<Proposition> variables)	Create a new universal boolean quantification.
ForallQuantifiedFormula(PlFormula f, Proposition variable)	Create a new universal boolean quantification.

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

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

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

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

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

Uses of PlFormula in net.sf.tweety.web.services

Fields in net.sf.tweety.web.services with type parameters of type PlFormula

Modifier and Type	Field	Description
(package private) BeliefSet<PlFormula,PlSignature>	InconsistencyMeasurementService.MeasurementCallee.beliefSet
(package private) InconsistencyMeasure<BeliefSet<PlFormula,?>>	InconsistencyMeasurementService.MeasurementCallee.measure
static AbstractMusEnumerator<PlFormula>	InconsistencyMeasurementService.musEnumerator	The MUS enumerator configured for this service.

Constructor parameters in net.sf.tweety.web.services with type arguments of type PlFormula

Constructor	Description
MeasurementCallee(InconsistencyMeasure<BeliefSet<PlFormula,?>> measure, BeliefSet<PlFormula,PlSignature> beliefSet)
MeasurementCallee(InconsistencyMeasure<BeliefSet<PlFormula,?>> measure, BeliefSet<PlFormula,PlSignature> beliefSet)