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

Packages that use PropositionalFormula

Package	Description
net.sf.tweety.logics.pl
net.sf.tweety.logics.pl.analysis
net.sf.tweety.logics.pl.parser
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 PropositionalFormula in net.sf.tweety.logics.pl

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

Modifier and Type	Method and Description
boolean	ClassicalEntailment.entails(Collection<PropositionalFormula> formulas, PropositionalFormula formula)

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

Modifier and Type	Method and Description
boolean	ClassicalEntailment.entails(Collection<PropositionalFormula> formulas, PropositionalFormula formula)
net.sf.tweety.commons.Interpretation	ClassicalEntailment.getWitness(Collection<PropositionalFormula> formulas)
boolean	ClassicalEntailment.isConsistent(Collection<PropositionalFormula> formulas)

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

Constructor and Description
ClassicalInference(net.sf.tweety.commons.BeliefBase beliefBase, net.sf.tweety.commons.EntailmentRelation<PropositionalFormula> entailment)
PlBeliefSet(Collection<? extends PropositionalFormula> formulas) Creates a new knowledge base with the given set of formulas.

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

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

Modifier and Type	Method and Description
static net.sf.tweety.logics.commons.analysis.InconsistencyMeasure<net.sf.tweety.commons.BeliefSet<PropositionalFormula>>	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 PropositionalFormula

Modifier and Type	Method and Description
double	PossibleWorldDistance.distance(PropositionalFormula f, PossibleWorld b)
protected double	HsInconsistencyMeasurementProcess.update(PropositionalFormula formula)
protected double	ContensionInconsistencyMeasurementProcess.update(PropositionalFormula formula)

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

Modifier and Type	Method and Description
FuzzyInterpretation	FuzzyInconsistencyMeasure.getOptimalInterpretation(Collection<PropositionalFormula> formulas) Returns an optimal interpretation as a witness for the inconsistency value.
Double	FbInconsistencyMeasure.inconsistencyMeasure(Collection<PropositionalFormula> formulas)
Double	MusVarInconsistencyMeasure.inconsistencyMeasure(Collection<PropositionalFormula> formulas)
Double	PmInconsistencyMeasure.inconsistencyMeasure(Collection<PropositionalFormula> formulas)
Double	ContensionInconsistencyMeasure.inconsistencyMeasure(Collection<PropositionalFormula> formulas)
Double	FuzzyInconsistencyMeasure.inconsistencyMeasure(Collection<PropositionalFormula> formulas)

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

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

Modifier and Type	Method and Description
PropositionalFormula	PlParser.parseFormula(Reader reader)

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

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

Modifier and Type	Method and Description
protected static net.sf.tweety.commons.util.Pair<String,List<PropositionalFormula>>	SatSolver.convertToDimacs(Collection<PropositionalFormula> formulas) Converts the given set of formulas to their string representation in Dimacs CNF.
protected static net.sf.tweety.commons.util.Pair<File,List<PropositionalFormula>>	SatSolver.createTmpDimacsFile(Collection<PropositionalFormula> 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<PropositionalFormula>	PlMusEnumerator.getDefaultEnumerator() Returns the default MUS enumerator. If a default MUS enumerator has been configured this enumerator is returned by this method.
abstract Collection<Collection<PropositionalFormula>>	PlMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)
Collection<Collection<PropositionalFormula>>	MarcoMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)
Collection<Collection<PropositionalFormula>>	MimusMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)

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

Modifier and Type	Method and Description
net.sf.tweety.commons.Interpretation	SatSolver.getWitness(PropositionalFormula formula)
boolean	SatSolver.isConsistent(PropositionalFormula formula)

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

Modifier and Type	Method and Description
protected static net.sf.tweety.commons.util.Pair<String,List<PropositionalFormula>>	SatSolver.convertToDimacs(Collection<PropositionalFormula> formulas) Converts the given set of formulas to their string representation in Dimacs CNF.
protected static String	SatSolver.convertToDimacs(Collection<PropositionalFormula> formulas, List<Proposition> props) Converts the given set of formulas to their string representation in Dimacs CNF.
protected static net.sf.tweety.commons.util.Pair<File,List<PropositionalFormula>>	SatSolver.createTmpDimacsFile(Collection<PropositionalFormula> formulas) Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
protected static File	SatSolver.createTmpDimacsFile(Collection<PropositionalFormula> formulas, List<Proposition> props) Creates a temporary file in Dimacs format with the given proposition2variable mapping.
net.sf.tweety.commons.Interpretation	SatSolver.getWitness(net.sf.tweety.commons.BeliefSet<PropositionalFormula> bs)
net.sf.tweety.commons.Interpretation	Sat4jSolver.getWitness(Collection<PropositionalFormula> formulas)
net.sf.tweety.commons.Interpretation	LingelingSolver.getWitness(Collection<PropositionalFormula> formulas)
abstract net.sf.tweety.commons.Interpretation	SatSolver.getWitness(Collection<PropositionalFormula> formulas) If the collection of formulas is consistent this method returns some model of it or, if it is inconsistent, null.
boolean	SatSolver.isConsistent(net.sf.tweety.commons.BeliefSet<PropositionalFormula> beliefSet)
boolean	SatSolver.isConsistent(Collection<PropositionalFormula> formulas)
boolean	Sat4jSolver.isSatisfiable(Collection<PropositionalFormula> formulas)
boolean	LingelingSolver.isSatisfiable(Collection<PropositionalFormula> formulas)
abstract boolean	SatSolver.isSatisfiable(Collection<PropositionalFormula> formulas) Checks whether the given set of formulas is satisfiable.
abstract Collection<Collection<PropositionalFormula>>	PlMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)
Collection<Collection<PropositionalFormula>>	MarcoMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)
Collection<Collection<PropositionalFormula>>	MimusMusEnumerator.minimalInconsistentSubsets(Collection<PropositionalFormula> formulas)
static void	PlMusEnumerator.setDefaultEnumerator(net.sf.tweety.logics.commons.analysis.AbstractMusEnumerator<PropositionalFormula> enumerator) Sets the default MUS enumerator.

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

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

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

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

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

Modifier and Type	Class and Description
class	AssociativePropositionalFormula 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	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 PropositionalFormula

Modifier and Type	Field and Description
protected net.sf.tweety.logics.commons.syntax.AssociativeFormulaSupport<PropositionalFormula>	AssociativePropositionalFormula.support The inner formulas of this formula

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

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

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

Modifier and Type	Method and Description
List<PropositionalFormula>	AssociativePropositionalFormula.getFormulas()
Set<PropositionalFormula>	SpecialFormula.getLiterals()
Set<PropositionalFormula>	Proposition.getLiterals()
Set<PropositionalFormula>	AssociativePropositionalFormula.getLiterals()
abstract Set<PropositionalFormula>	PropositionalFormula.getLiterals() Returns all literals, i.e.
Set<PropositionalFormula>	Negation.getLiterals()
Collection<PropositionalFormula>	PropositionalFormula.getPrimeImplicants() Returns the set of prime implicants of this formula.
Iterator<PropositionalFormula>	AssociativePropositionalFormula.iterator()
ListIterator<PropositionalFormula>	AssociativePropositionalFormula.listIterator()
ListIterator<PropositionalFormula>	AssociativePropositionalFormula.listIterator(int index)
List<PropositionalFormula>	AssociativePropositionalFormula.subList(int fromIndex, int toIndex)

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

Modifier and Type	Method and Description
void	AssociativePropositionalFormula.add(int index, PropositionalFormula element)
boolean	AssociativePropositionalFormula.add(PropositionalFormula f)
boolean	Negation.hasLowerBindingPriority(PropositionalFormula other)
PropositionalFormula	Conjunction.replace(Proposition p, PropositionalFormula f, int i)
PropositionalFormula	SpecialFormula.replace(Proposition p, PropositionalFormula f, int i)
PropositionalFormula	Proposition.replace(Proposition p, PropositionalFormula f, int i)
PropositionalFormula	Disjunction.replace(Proposition p, PropositionalFormula f, int i)
abstract PropositionalFormula	PropositionalFormula.replace(Proposition p, PropositionalFormula f, int i) Replaces the ith instance of the proposition p by f.
PropositionalFormula	Negation.replace(Proposition p, PropositionalFormula f, int i)
boolean	PropositionalFormula.resolvableWith(PropositionalFormula 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	PropositionalFormula.resolveWith(PropositionalFormula other) Resolves this formula with the given one (both have to be conjunctive clauses) and returns some resolvent.
PropositionalFormula	AssociativePropositionalFormula.set(int index, PropositionalFormula element)

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

Modifier and Type	Method and Description
boolean	AssociativePropositionalFormula.addAll(Collection<? extends PropositionalFormula> c)
boolean	AssociativePropositionalFormula.addAll(int index, Collection<? extends PropositionalFormula> c)

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

Constructor and Description
AssociativePropositionalFormula(PropositionalFormula first, PropositionalFormula second) Creates a new associative formula with the two given formulae
Conjunction(PropositionalFormula first, PropositionalFormula second) Creates a new conjunction with the two given formulae
Disjunction(PropositionalFormula first, PropositionalFormula second) Creates a new disjunction with the two given formulae
Negation(PropositionalFormula formula) Creates a new negation with the given formula.

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

Constructor and Description
AssociativePropositionalFormula(Collection<? extends PropositionalFormula> formulas) Creates a new associative formula with the given inner formulas.
Conjunction(Collection<? extends PropositionalFormula> formulas) Creates a new conjunction with the given inner formulas.
Disjunction(Collection<? extends PropositionalFormula> formulas) Creates a new disjunction with the given inner formulas.

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

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

Modifier and Type	Method and Description
PropositionalFormula	CnfSampler.randomFormula() Samples a random formula (a disjunction of literals).
PropositionalFormula	SyntacticRandomPlBeliefSetSampler.sampleFormula(net.sf.tweety.math.probability.ProbabilityFunction<Byte> prob) Samples a single formula.

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

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

Constructor and Description
PlWriter(PropositionalFormula plFormula)