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

Packages that use PlFormula

Package	Description
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.util
net.sf.tweety.logics.pl.writer

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

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

Modifier and Type	Method	Description
PlFormula	SimplePlInterpolantEnumerator.getStrongestInterpolant(Collection<PlFormula> k1, Collection<PlFormula> k2)
PlFormula	SimplePlInterpolantEnumerator.getWeakestInterpolant(Collection<PlFormula> k1, Collection<PlFormula> k2)

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

Modifier and Type	Method	Description
static net.sf.tweety.logics.commons.analysis.InconsistencyMeasure<net.sf.tweety.commons.BeliefSet<PlFormula,?>>	InconsistencyMeasureFactory.getInconsistencyMeasure(InconsistencyMeasureFactory.Measure im)	Creates a new inconsistency measure of the given type with default settings.
Collection<PlFormula>	SimplePlInterpolantEnumerator.getInterpolants(Collection<PlFormula> k1, Collection<PlFormula> k2)
Collection<Set<PlFormula>>	IcebergInconsistencyMeasure.getStarConflicts(Collection<PlFormula> beliefSet)	Computes all *-conflicts of a given belief base.

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)
boolean	SimplePlInterpolantEnumerator.isInterpolant(PlFormula candidate, Collection<PlFormula> k1, Collection<PlFormula> k2)
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
Collection<PlFormula>	SimplePlInterpolantEnumerator.getInterpolants(Collection<PlFormula> k1, Collection<PlFormula> k2)
FuzzyInterpretation	FuzzyInconsistencyMeasure.getOptimalInterpretation(Collection<PlFormula> formulas)	Returns an optimal interpretation as a witness for the inconsistency value.
Collection<Set<PlFormula>>	IcebergInconsistencyMeasure.getStarConflicts(Collection<PlFormula> beliefSet)	Computes all *-conflicts of a given belief base.
PlFormula	SimplePlInterpolantEnumerator.getStrongestInterpolant(Collection<PlFormula> k1, Collection<PlFormula> k2)
PlFormula	SimplePlInterpolantEnumerator.getWeakestInterpolant(Collection<PlFormula> k1, Collection<PlFormula> k2)
Double	ContensionInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
Double	FbInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
Double	FuzzyInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
Double	IcebergInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
Double	MusVarInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
Double	PmInconsistencyMeasure.inconsistencyMeasure(Collection<PlFormula> formulas)
boolean	SimplePlInterpolantEnumerator.isInterpolant(PlFormula candidate, Collection<PlFormula> k1, Collection<PlFormula> k2)

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
protected PlFormula	PlParser.parseDisjunction(List<Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
protected PlFormula	PlParser.parseExclusiveDisjunction(List<Object> l)	Parses a simple formula as a list of String tokens or formulas into a propositional formula.
PlFormula	PlParser.parseFormula(Reader reader)

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

Modifier and Type	Method	Description
static net.sf.tweety.commons.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(Collection<PlFormula> kb)
boolean	ImAttenuation.isApplicable(Collection<PlFormula> kb)
boolean	ImConsistency.isApplicable(Collection<PlFormula> kb)
boolean	ImContradiction.isApplicable(Collection<PlFormula> kb)
boolean	ImDominance.isApplicable(Collection<PlFormula> kb)
boolean	ImEqualConflict.isApplicable(Collection<PlFormula> kb)
boolean	ImExchange.isApplicable(Collection<PlFormula> kb)
boolean	ImFreeFormulaDilution.isApplicable(Collection<PlFormula> kb)
boolean	ImFreeFormulaIndependence.isApplicable(Collection<PlFormula> kb)
boolean	ImIrrelevanceOfSyntax.isApplicable(Collection<PlFormula> kb)
boolean	ImMINormalization.isApplicable(Collection<PlFormula> kb)
boolean	ImMISeparability.isApplicable(Collection<PlFormula> kb)
boolean	ImMonotony.isApplicable(Collection<PlFormula> kb)
boolean	ImNormalization.isApplicable(Collection<PlFormula> kb)
boolean	ImPenalty.isApplicable(Collection<PlFormula> kb)
abstract boolean	ImPostulate.isApplicable(Collection<PlFormula> kb)
boolean	ImSafeFormulaIndependence.isApplicable(Collection<PlFormula> kb)
boolean	ImSuperAdditivity.isApplicable(Collection<PlFormula> kb)
boolean	ImWeakDominance.isApplicable(Collection<PlFormula> kb)
boolean	ImAdjunctionInvariance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAdjunctionInvariance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAttenuation.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImAttenuation.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImConsistency.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImConsistency.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImContradiction.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImContradiction.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImDominance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImDominance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImEqualConflict.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImEqualConflict.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImExchange.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImExchange.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaDilution.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaDilution.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaIndependence.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImFreeFormulaIndependence.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImIrrelevanceOfSyntax.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImIrrelevanceOfSyntax.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMINormalization.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMINormalization.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMISeparability.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMISeparability.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMonotony.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImMonotony.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImNormalization.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImNormalization.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPenalty.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPenalty.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImPostulate.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.commons.postulates.PostulateEvaluatable<PlFormula> ev)
boolean	ImPostulate.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.commons.postulates.PostulateEvaluatable<PlFormula> ev)
abstract boolean	ImPostulate.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
abstract boolean	ImPostulate.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSafeFormulaIndependence.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSafeFormulaIndependence.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSuperAdditivity.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImSuperAdditivity.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImWeakDominance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.BeliefSetInconsistencyMeasure<PlFormula> ev)
boolean	ImWeakDominance.isSatisfied(Collection<PlFormula> kb, net.sf.tweety.logics.commons.analysis.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
Collection<Collection<PlFormula>>	AbstractPlReasoner.getKernels(Collection<PlFormula> formulas, PlFormula formula)

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

Modifier and Type	Method	Description
Collection<Collection<PlFormula>>	AbstractPlReasoner.getKernels(Collection<PlFormula> formulas, PlFormula formula)
boolean	AbstractPlReasoner.isEquivalent(PlFormula p1, PlFormula p2)	Checks whether the two formulas are equivalent
abstract Boolean	AbstractPlReasoner.query(PlBeliefSet beliefbase, PlFormula formula)
boolean	AbstractPlReasoner.query(PlFormula formula, PlFormula formula2)	Checks whether the first formula entails the second.
Boolean	SatReasoner.query(PlBeliefSet beliefbase, PlFormula formula)
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
Collection<Collection<PlFormula>>	AbstractPlReasoner.getKernels(Collection<PlFormula> formulas, PlFormula formula)

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

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

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

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

Modifier and Type	Method	Description
net.sf.tweety.commons.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 net.sf.tweety.commons.util.Pair<String,List<PlFormula>>	SatSolver.convertToDimacs(Collection<PlFormula> formulas)	Converts the given set of formulas to their string representation in Dimacs CNF.
static String	SatSolver.convertToDimacs(Collection<PlFormula> formulas, List<Proposition> props)	Converts the given set of formulas to their string representation in Dimacs CNF.
protected static String	MaxSatSolver.convertToDimacsWcnf(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints, List<Proposition> props)	Converts the given MaxSAT instance (i.e.
protected static String	MaxSatSolver.convertToDimacsWcnf(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints, List<Proposition> props)	Converts the given MaxSAT instance (i.e.
static int	MaxSatSolver.costOf(net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula> interpretation, Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
static int	MaxSatSolver.costOf(net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula> interpretation, Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
static int	MaxSatSolver.costOf(net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula> interpretation, Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)	Returns the cost of the given interpretation, i.e.
protected static net.sf.tweety.commons.util.Pair<File,List<PlFormula>>	SatSolver.createTmpDimacsFile(Collection<PlFormula> formulas)	Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
protected static File	SatSolver.createTmpDimacsFile(Collection<PlFormula> formulas, List<Proposition> props)	Creates a temporary file in Dimacs format with the given proposition2variable mapping.
protected static File	MaxSatSolver.createTmpDimacsWcnfFile(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints, List<Proposition> props)	Converts the given MaxSAT instance (i.e.
protected static File	MaxSatSolver.createTmpDimacsWcnfFile(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints, List<Proposition> props)	Converts the given MaxSAT instance (i.e.
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	LingelingSolver.getWitness(Collection<PlFormula> formulas)
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(Collection<PlFormula> formulas)
abstract net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)	Returns an interpretation with maximal weight on the soft constraints (or null if the hard constraints are not satisfiable)
abstract net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	MaxSatSolver.getWitness(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)	Returns an interpretation with maximal weight on the soft constraints (or null if the hard constraints are not satisfiable)
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	OpenWboSolver.getWitness(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	OpenWboSolver.getWitness(Collection<PlFormula> hardConstraints, Map<PlFormula,Integer> softConstraints)
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	Sat4jSolver.getWitness(Collection<PlFormula> formulas)
abstract net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(Collection<PlFormula> formulas)	If the collection of formulas is consistent this method returns some model of it or, if it is inconsistent, null.
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	SatSolver.getWitness(net.sf.tweety.commons.BeliefSet<PlFormula,?> bs)
net.sf.tweety.commons.Interpretation<PlBeliefSet,PlFormula>	SimpleDpllSolver.getWitness(Collection<PlFormula> formulas)
boolean	SatSolver.isConsistent(Collection<PlFormula> formulas)
boolean	SatSolver.isConsistent(net.sf.tweety.commons.BeliefSet<PlFormula,?> beliefSet)
boolean	LingelingSolver.isSatisfiable(Collection<PlFormula> formulas)
boolean	MaxSatSolver.isSatisfiable(Collection<PlFormula> formulas)
boolean	Sat4jSolver.isSatisfiable(Collection<PlFormula> formulas)
abstract boolean	SatSolver.isSatisfiable(Collection<PlFormula> formulas)	Checks whether the given set of formulas is satisfiable.
boolean	SimpleDpllSolver.isSatisfiable(Collection<PlFormula> formulas)
Collection<Collection<PlFormula>>	MarcoMusEnumerator.minimalInconsistentSubsets(Collection<PlFormula> formulas)
Collection<Collection<PlFormula>>	MimusMusEnumerator.minimalInconsistentSubsets(Collection<PlFormula> formulas)
abstract Collection<Collection<PlFormula>>	PlMusEnumerator.minimalInconsistentSubsets(Collection<PlFormula> formulas)
static void	PlMusEnumerator.setDefaultEnumerator(net.sf.tweety.logics.commons.analysis.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
net.sf.tweety.commons.InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset()
net.sf.tweety.commons.InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset(Collection<? extends net.sf.tweety.commons.Formula> formulas)
net.sf.tweety.commons.InterpretationIterator<PlFormula,PlBeliefSet,PossibleWorld>	PossibleWorldIterator.reset(net.sf.tweety.commons.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(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	ExclusiveDisjunction	This class represents an exclusive disjunction (XOR) in 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 with type parameters of type PlFormula

Modifier and Type	Field	Description
protected net.sf.tweety.logics.commons.syntax.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	ExclusiveDisjunction.clone()
PlFormula	Negation.clone()
abstract PlFormula	PlFormula.clone()
PlFormula	Conjunction.collapseAssociativeFormulas()
PlFormula	Disjunction.collapseAssociativeFormulas()
PlFormula	Equivalence.collapseAssociativeFormulas()
PlFormula	ExclusiveDisjunction.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	ExclusiveDisjunction.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	ExclusiveDisjunction.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	ExclusiveDisjunction.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
List<PlFormula>	PlBeliefSet.getCanonicalOrdering()	Force ordering on belief set based on comparison of hash codes.
List<PlFormula>	AssociativePlFormula.getFormulas()
net.sf.tweety.commons.util.Pair<PlFormula,PlFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
net.sf.tweety.commons.util.Pair<PlFormula,PlFormula>	Equivalence.getFormulas()	Returns the formulas of the equivalence.
net.sf.tweety.commons.util.Pair<PlFormula,PlFormula>	Implication.getFormulas()	Returns the formulas of the implication.
net.sf.tweety.commons.util.Pair<PlFormula,PlFormula>	Implication.getFormulas()	Returns the formulas of the implication.
Set<PlFormula>	AssociativePlFormula.getLiterals()
Set<PlFormula>	Equivalence.getLiterals()
Set<PlFormula>	Implication.getLiterals()
Set<PlFormula>	Negation.getLiterals()
abstract Set<PlFormula>	PlFormula.getLiterals()	Returns all literals, i.e.
Set<PlFormula>	Proposition.getLiterals()
Set<PlFormula>	SpecialFormula.getLiterals()
Collection<PlFormula>	PlFormula.getPrimeImplicants()	Returns the set of prime implicants of this formula.
Iterator<PlFormula>	AssociativePlFormula.iterator()
ListIterator<PlFormula>	AssociativePlFormula.listIterator()
ListIterator<PlFormula>	AssociativePlFormula.listIterator(int index)
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)
boolean	AssociativePlFormula.add(PlFormula... formulas)	Adds the specified elements to the end of this collection (optional operation).
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	ExclusiveDisjunction.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	Equivalence.setFormulas(PlFormula formula1, PlFormula formula2)	Sets the formulas of the equivalence.
void	Implication.setFormulas(PlFormula left, PlFormula right)	Sets the formulas of the implication.
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, Collection<? extends PlFormula> c)
boolean	AssociativePlFormula.addAll(Collection<? extends PlFormula> c)
static PlSignature	PlSignature.getSignature(Collection<? extends PlFormula> formulas)	Returns the set of atoms appearing in the given collection of formulas.
void	Equivalence.setFormulas(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the equivalence.
void	Equivalence.setFormulas(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the equivalence.
void	Implication.setFormulas(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Sets the formulas of the implication.
void	Implication.setFormulas(net.sf.tweety.commons.util.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
ExclusiveDisjunction(PlFormula first, PlFormula second)	Creates a new exclusive disjunction with the two given formulae
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(Collection<? extends PlFormula> formulas)	Creates a new associative formula with the given inner formulas.
Conjunction(Collection<? extends PlFormula> formulas)	Creates a new conjunction with the given inner formulas.
Disjunction(Collection<? extends PlFormula> formulas)	Creates a new disjunction with the given inner formulas.
Equivalence(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Creates a new equivalence with the given pair of formulas
Equivalence(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Creates a new equivalence with the given pair of formulas
ExclusiveDisjunction(Collection<? extends PlFormula> formulas)	Creates a new XOR formula with the given inner formulas.
Implication(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Creates a new implication with the given pair of formulas
Implication(net.sf.tweety.commons.util.Pair<PlFormula,PlFormula> formulas)	Creates a new implication with the given pair of formulas
PlBeliefSet(Collection<? extends PlFormula> formulas)	Creates a new knowledge base with the given set of formulas.

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
PlFormula	CnfSampler.sampleFormula()	Returns a random formula
PlFormula	SyntacticRandomSampler.sampleFormula(net.sf.tweety.math.probability.ProbabilityFunction<Byte> prob)	Samples a single formula.

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)