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

Packages that use Proposition

Package	Description
net.sf.tweety.logics.pl.parser
net.sf.tweety.logics.pl.sat
net.sf.tweety.logics.pl.semantics
net.sf.tweety.logics.pl.syntax

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

Fields in net.sf.tweety.logics.pl.parser declared as Proposition

Modifier and Type	Field	Description
protected Proposition[]	DimacsParser.prop_idx	An array representation of the propositions (for index mapping)

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

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

Modifier and Type	Method	Description
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 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.

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

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

Modifier and Type	Method	Description
Set<Map.Entry<Proposition,Double>>	FuzzyInterpretation.entrySet()
Collection<Proposition>	PriestWorld.getBinarybase()	Returns the binary base of this world, i.e.
Collection<Proposition>	PriestWorld.getConflictbase()	Returns the conflict base of this world, i.e.
Set<net.sf.tweety.commons.util.Pair<Proposition,Boolean>>	NicePossibleWorld.getRepresentationStructure()
Set<Proposition>	FuzzyInterpretation.keySet()

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

Modifier and Type	Method	Description
PriestWorld.TruthValue	PriestWorld.get(Proposition p)	Returns the truth value of the given proposition.
Double	FuzzyInterpretation.put(Proposition arg0, Double arg1)
void	PriestWorld.set(Proposition p, PriestWorld.TruthValue val)	Sets the value of the given proposition.

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

Modifier and Type	Method	Description
int	NicePossibleWorld.compare(net.sf.tweety.commons.util.Pair<Proposition,Boolean> o1, net.sf.tweety.commons.util.Pair<Proposition,Boolean> o2)
static Set<NicePossibleWorld>	NicePossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature)
static Set<PossibleWorld>	PossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature)	Returns the set of all possible worlds for the given propositional signature.
void	FuzzyInterpretation.putAll(Map<? extends Proposition,? extends Double> arg0)
void	NicePossibleWorld.setComparator(Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)	Changes the used comparator to sort the representation structure and resorts the representation.
boolean	NicePossibleWorld.setSignature(Collection<Proposition> signature)	Changes the signature of the world.

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

Constructor	Description
NicePossibleWorld(Collection<Proposition> trueInWorld, Collection<Proposition> signature)	Ctor: Generates the possible world using the given set of true propositions and generated a representation of the possible world using the given signature.
NicePossibleWorld(Collection<Proposition> trueInWorld, Collection<Proposition> signature, Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)	Ctor: Generates the possible world using the given set of true propositions and generated a representation of the possible world using the given signature.
NicePossibleWorld(Collection<Proposition> trueInWorld, Collection<Proposition> signature, Comparator<net.sf.tweety.commons.util.Pair<Proposition,Boolean>> comparator)	Ctor: Generates the possible world using the given set of true propositions and generated a representation of the possible world using the given signature.
PossibleWorld(Collection<? extends Proposition> propositions)	Creates a new possible world with the given set of propositions.

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

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

Modifier and Type	Method	Description
Proposition	Proposition.clone()

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

Modifier and Type	Method	Description
Set<Proposition>	AssociativePlFormula.getAtoms()
Set<Proposition>	Equivalence.getAtoms()
Set<Proposition>	Implication.getAtoms()
Set<Proposition>	Negation.getAtoms()
abstract Set<Proposition>	PlFormula.getAtoms()
Set<Proposition>	Proposition.getAtoms()
Set<Proposition>	SpecialFormula.getAtoms()

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

Modifier and Type	Method	Description
int	Proposition.compareTo(Proposition o)
int	AssociativePlFormula.numberOfOccurrences(Proposition p)
int	Equivalence.numberOfOccurrences(Proposition p)
int	Implication.numberOfOccurrences(Proposition p)
int	Negation.numberOfOccurrences(Proposition p)
abstract int	PlFormula.numberOfOccurrences(Proposition p)	Returns the number of occurrences of the given proposition within this formula
int	Proposition.numberOfOccurrences(Proposition p)
int	SpecialFormula.numberOfOccurrences(Proposition p)
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)

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

Constructor	Description
Proposition(Proposition other)

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

Constructor	Description
PlSignature(Collection<? extends Proposition> propositions)	Creates a new propositional signature with the given set of propositions.