Uses of Class
org.tweetyproject.logics.pl.syntax.Proposition

Packages that use Proposition

Package	Description
org.tweetyproject.action.query.syntax
org.tweetyproject.agents.dialogues.structured
org.tweetyproject.arg.dung.causal.syntax
org.tweetyproject.arg.saf.reasoner
org.tweetyproject.arg.saf.syntax
org.tweetyproject.logics.cl.semantics
org.tweetyproject.logics.cl.syntax
org.tweetyproject.logics.pl.analysis
org.tweetyproject.logics.pl.sat
org.tweetyproject.logics.pl.semantics
org.tweetyproject.logics.pl.syntax
org.tweetyproject.logics.pl.util
org.tweetyproject.logics.qbf.semantics
org.tweetyproject.logics.qbf.syntax
org.tweetyproject.logics.qbf.writer
org.tweetyproject.logics.translators.adfconditional
org.tweetyproject.logics.translators.adfrevision
org.tweetyproject.logics.translators.folprop

Uses of Proposition in org.tweetyproject.action.query.syntax

Subclasses of Proposition in org.tweetyproject.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.

Uses of Proposition in org.tweetyproject.agents.dialogues.structured

Method parameters in org.tweetyproject.agents.dialogues.structured with type arguments of type Proposition

Modifier and Type	Method	Description
int	CountingUtilityFunction.rank(Collection<? extends Proposition> propositions)
int	IndicatorUtilityFunction.rank(Collection<? extends Proposition> propositions)
int	MultipleIndicatorUtilityFunction.rank(Collection<? extends Proposition> propositions)
int	SasAgent.rank(Collection<? extends Proposition> propositions)	Ranks the given collection of propositions wrt.
int	UtilityFunction.rank(Collection<? extends Proposition> propositions)	Rank the given collection of propositions.

Constructors in org.tweetyproject.agents.dialogues.structured with parameters of type Proposition

Modifier	Constructor	Description
	CautiousArgumentationAgent(StructuredArgumentationFramework view, UtilityFunction utility, boolean isSingleStep, Proposition focalElement)	Creates a new agent with the given (local) view and utility function.
	CautiousArgumentationAgent(StructuredArgumentationFramework view, UtilityFunction utility, Proposition focalElement)	Creates a new (non-single-step) agent with the given (local) view and utility function.
	IndicatorUtilityFunction(Proposition focalElement)	Creates a new indicator utility function for the given focal element.
	OvercautiousArgumentationAgent(StructuredArgumentationFramework view, UtilityFunction utility, boolean isSingleStep, Proposition focalElement)	Creates a new agent with the given (local) view and utility function.
	OvercautiousArgumentationAgent(StructuredArgumentationFramework view, UtilityFunction utility, Proposition focalElement)	Creates a new (non-single-step) agent with the given (local) view and utility function.

Constructor parameters in org.tweetyproject.agents.dialogues.structured with type arguments of type Proposition

Modifier	Constructor	Description
	CountingUtilityFunction(Collection<? extends Proposition> focalSet)	Creates a new counting utility function for the given focal set.
	MultipleIndicatorUtilityFunction(Collection<? extends Proposition> focalSet)	Creates a new multiple indicator utility function for the given focal set.

Uses of Proposition in org.tweetyproject.arg.dung.causal.syntax

Methods in org.tweetyproject.arg.dung.causal.syntax that return types with arguments of type Proposition

Modifier and Type	Method	Description
HashSet<Proposition>	CausalModel.getBackGroundAtoms()	Retrieves a copy of the set of background atoms currently defined in the causal model.
HashSet<Proposition>	CausalModel.getExplainableAtoms()	Retrieves a copy of the set of explainable atoms currently defined in the causal model.
HashMap<Proposition,Boolean>	InterventionalStatement.getInterventions()	Retrieves the interventions of this causal statement.

Methods in org.tweetyproject.arg.dung.causal.syntax with parameters of type Proposition

Modifier and Type	Method	Description
boolean	CausalModel.addBackgroundAtom(Proposition atom)	Adds a specified atom to the background atoms of this instance.
boolean	CausalModel.addExplainableAtom(Proposition atom, Equivalence structuralEquation)	Adds a specified atom to the explainable atoms of this instance and the specified equivalence as a structural equation for this atom.
void	CausalModel.intervene(Proposition v, boolean x)	This method implements the interventional statement, by replacing all structural equations for the specified explainable atom "v" of this causal model with a formula "v = x".

Constructor parameters in org.tweetyproject.arg.dung.causal.syntax with type arguments of type Proposition

Modifier	Constructor	Description
	CausalModel(Set<Proposition> backGroundAtoms, Set<Proposition> explainableAtoms, Set<Equivalence> structuralEquations)	Creates a causal model
	CounterfactualStatement(HashSet<PlFormula> conclusions, HashMap<Proposition,Boolean> interventions, HashSet<PlFormula> premises)	Creates a new counterfactual causal statement.
	InterventionalStatement(HashSet<PlFormula> conclusions, HashMap<Proposition,Boolean> interventions, HashSet<PlFormula> premises)	Creates a new interventional causal statement.

Uses of Proposition in org.tweetyproject.arg.saf.reasoner

Methods in org.tweetyproject.arg.saf.reasoner that return types with arguments of type Proposition

Modifier and Type	Method	Description
Set<Proposition>	OutputReasoner.getOutput(StructuredArgumentationFramework saf)	Returns the output this reasoner bases upon.

Methods in org.tweetyproject.arg.saf.reasoner with parameters of type Proposition

Modifier and Type	Method	Description
Boolean	OutputReasoner.query(StructuredArgumentationFramework beliefbase, Proposition formula)

Uses of Proposition in org.tweetyproject.arg.saf.syntax

Methods in org.tweetyproject.arg.saf.syntax that return Proposition

Modifier and Type	Method	Description
Proposition	ArgumentStructure.getClaim()	Returns the claim of this argument structure, i.e.
Proposition	BasicArgument.getConclusion()

Methods in org.tweetyproject.arg.saf.syntax that return types with arguments of type Proposition

Modifier and Type	Method	Description
Collection<Proposition>	StructuredArgumentationFramework.getAllPropositions()	Retrieves all propositions from the collection of formulas in this object.
Set<Proposition>	BasicArgument.getPremise()

Methods in org.tweetyproject.arg.saf.syntax with parameters of type Proposition

Modifier and Type	Method	Description
void	BasicArgument.addPremise(Proposition premise)
void	BasicArgument.setConclusion(Proposition conclusion)

Method parameters in org.tweetyproject.arg.saf.syntax with type arguments of type Proposition

Modifier and Type	Method	Description
void	BasicArgument.addPremises(Collection<? extends Proposition> premises)

Constructors in org.tweetyproject.arg.saf.syntax with parameters of type Proposition

Modifier	Constructor	Description
	BasicArgument(Proposition claim)	Creates a new basic argument with the given claim and empty support.
	BasicArgument(Proposition claim, Set<Proposition> support)	Creates a new basic argument with the given claim and the given support.

Constructor parameters in org.tweetyproject.arg.saf.syntax with type arguments of type Proposition

Modifier	Constructor	Description
	BasicArgument(Proposition claim, Set<Proposition> support)	Creates a new basic argument with the given claim and the given support.

Uses of Proposition in org.tweetyproject.logics.cl.semantics

Methods in org.tweetyproject.logics.cl.semantics that return types with arguments of type Proposition

Modifier and Type	Method	Description
Collection<Proposition>	ConditionalStructure.getSignature()	Return An unmodifiable Collection containing all propositions that altogether form the signature of the ConditionalStructure

Method parameters in org.tweetyproject.logics.cl.semantics with type arguments of type Proposition

Modifier and Type	Method	Description
void	ConditionalStructure.setWorldRepresentation(Comparator<Pair<Proposition,Boolean>> comparator)	Changes the internal representations of the worlds, normally the propositions of a world are ordered alphabetically but this behavior can be changed using this method.

Uses of Proposition in org.tweetyproject.logics.cl.syntax

Methods in org.tweetyproject.logics.cl.syntax that return types with arguments of type Proposition

Modifier and Type	Method	Description
Set<Proposition>	Conditional.getAtoms()

Uses of Proposition in org.tweetyproject.logics.pl.analysis

Fields in org.tweetyproject.logics.pl.analysis with type parameters of type Proposition

Modifier and Type	Field	Description
MinimalModelProvider<Proposition,PlBeliefSet,PlFormula>	SimplePrimeImplicantEnumerator.minModelProvider	minimal model provider
ModelProvider<?,PlBeliefSet,InterpretationSet<Proposition,PlBeliefSet,PlFormula>>	SimpleMinimalModelProvider.modelProvider	model provider

Methods in org.tweetyproject.logics.pl.analysis that return types with arguments of type Proposition

Modifier and Type	Method	Description
Set<InterpretationSet<Proposition,PlBeliefSet,PlFormula>>	SimpleMinimalModelProvider.getMinModels(PlBeliefSet f)

Constructor parameters in org.tweetyproject.logics.pl.analysis with type arguments of type Proposition

Modifier	Constructor	Description
	SimpleMinimalModelProvider(ModelProvider<?,PlBeliefSet,InterpretationSet<Proposition,PlBeliefSet,PlFormula>> modelProvider)	standard constructor with model provider
	SimplePrimeImplicantEnumerator(MinimalModelProvider<Proposition,PlBeliefSet,PlFormula> minModelProvider)	Constructor

Uses of Proposition in org.tweetyproject.logics.pl.sat

Methods in org.tweetyproject.logics.pl.sat that return types with arguments of type Proposition

Modifier and Type	Method	Description
InterpretationSet<Proposition,PlBeliefSet,PlFormula>	SimpleModelEnumerator.getModel(PlBeliefSet bbase)
Set<InterpretationSet<Proposition,PlBeliefSet,PlFormula>>	SimpleModelEnumerator.getModels(Collection<PlFormula> formulas)	Return all models satifying the formulas
Collection<InterpretationSet<Proposition,PlBeliefSet,PlFormula>>	SimpleModelEnumerator.getModels(PlBeliefSet bbase)

Method parameters in org.tweetyproject.logics.pl.sat with type arguments of type Proposition

Modifier and Type	Method	Description
static List<String>	DimacsSatSolver.convertToDimacs(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, List<String> additional_clauses)	Convert to dimacs
Interpretation<PlBeliefSet,PlFormula>	CmdLineSatSolver.getWitness(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, Map<Integer,Proposition> prop_inverted_index, List<String> additional_clauses)
abstract Interpretation<PlBeliefSet,PlFormula>	DimacsSatSolver.getWitness(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, Map<Integer,Proposition> prop_inverted_index, List<String> additional_clauses)	If the collection of formulas is consistent this method returns some model of it or, if it is inconsistent, null.
Interpretation<PlBeliefSet,PlFormula>	Sat4jSolver.getWitness(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, Map<Integer,Proposition> prop_inverted_index, List<String> additional_clauses)
boolean	CmdLineSatSolver.isSatisfiable(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, List<String> additional_clauses)
abstract boolean	DimacsMaxSatSolver.isSatisfiable(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index)	Return "true" if the set is consistent.
abstract boolean	DimacsSatSolver.isSatisfiable(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, List<String> additional_clauses)	Checks whether the given set of formulas is satisfiable.
boolean	OpenWboSolver.isSatisfiable(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index)
boolean	Sat4jSolver.isSatisfiable(Collection<PlFormula> formulas, Map<Proposition,Integer> prop_index, List<String> additional_clauses)

Uses of Proposition in org.tweetyproject.logics.pl.semantics

Methods in org.tweetyproject.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<Pair<Proposition,Boolean>>	NicePossibleWorld.getRepresentationStructure()	Return The representation structure as a set of (proposition, boolean)
Set<Proposition>	FuzzyInterpretation.keySet()

Methods in org.tweetyproject.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 org.tweetyproject.logics.pl.semantics with type arguments of type Proposition

Modifier and Type	Method	Description
int	NicePossibleWorld.compare(Pair<Proposition,Boolean> o1, Pair<Proposition,Boolean> o2)
static Set<NicePossibleWorld>	NicePossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature)	Return all possible nice worlds
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<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 org.tweetyproject.logics.pl.semantics with type arguments of type Proposition

Modifier	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<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<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 org.tweetyproject.logics.pl.syntax

Methods in org.tweetyproject.logics.pl.syntax that return Proposition

Modifier and Type	Method	Description
Proposition	Proposition.clone()

Methods in org.tweetyproject.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 org.tweetyproject.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 org.tweetyproject.logics.pl.syntax with parameters of type Proposition

Modifier	Constructor	Description
	Proposition(Proposition other)	constructor

Constructor parameters in org.tweetyproject.logics.pl.syntax with type arguments of type Proposition

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

Uses of Proposition in org.tweetyproject.logics.pl.util

Method parameters in org.tweetyproject.logics.pl.util with type arguments of type Proposition

Modifier and Type	Method	Description
static PlBeliefSet	CardinalityConstraintEncoder.getBinomialEncoding(Collection<Proposition> atoms, int atMost)	Returns a naive SAT encoding of the given cardinality constraint.
static Conjunction	CardinalityConstraintEncoder.getNaiveAtMostOneEncoding(Collection<Proposition> atoms)	Returns a naive at-most-1 encoding for the given set of atoms.
static PlBeliefSet	CardinalityConstraintEncoder.getSequentialCounterEncoding(Collection<Proposition> atoms, int atMost, String name)	Returns a SAT encoding of the given cardinality constraint based on the method of [Sinz.

Constructor parameters in org.tweetyproject.logics.pl.util with type arguments of type Proposition

Modifier	Constructor	Description
	CardinalityConstraintEncoder(Collection<Proposition> atoms, int atMost)	Create a new at-most-n cardinality constraint with the given set of atoms and the given n.

Uses of Proposition in org.tweetyproject.logics.qbf.semantics

Methods in org.tweetyproject.logics.qbf.semantics with parameters of type Proposition

Modifier and Type	Method	Description
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 org.tweetyproject.logics.qbf.semantics with type arguments of type Proposition

Modifier and Type	Method	Description
static Set<QbPossibleWorld>	QbPossibleWorld.getAllPossibleWorlds(Collection<Proposition> signature)	Returns the set of all possible worlds for the given propositional signature.

Constructor parameters in org.tweetyproject.logics.qbf.semantics with type arguments of type Proposition

Modifier	Constructor	Description
	QbPossibleWorld(Collection<? extends Proposition> propositions)	Creates a new possible world with the given set of propositions.

Uses of Proposition in org.tweetyproject.logics.qbf.syntax

Methods in org.tweetyproject.logics.qbf.syntax that return types with arguments of type Proposition

Modifier and Type	Method	Description
Set<Proposition>	ExistsQuantifiedFormula.getAtoms()
Set<Proposition>	ForallQuantifiedFormula.getAtoms()
Set<Proposition>	ExistsQuantifiedFormula.getQuantifierVariables()	Return the quantifier variables (propositions)
Set<Proposition>	ForallQuantifiedFormula.getQuantifierVariables()	Return the quantified variables (propositions)

Methods in org.tweetyproject.logics.qbf.syntax with parameters of type Proposition

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

Constructors in org.tweetyproject.logics.qbf.syntax with parameters of type Proposition

Modifier	Constructor	Description
	ExistsQuantifiedFormula(PlFormula f, Proposition variable)	Create a new existential boolean quantification.
	ForallQuantifiedFormula(PlFormula f, Proposition variable)	Create a new universal boolean quantification.

Constructor parameters in org.tweetyproject.logics.qbf.syntax with type arguments of type Proposition

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

Uses of Proposition in org.tweetyproject.logics.qbf.writer

Method parameters in org.tweetyproject.logics.qbf.writer with type arguments of type Proposition

Modifier and Type	Method	Description
String	QdimacsWriter.printVariables(Set<Proposition> vars, Map<Proposition,Integer> mappings)	Prints the variable mappings for a given set of propositions.
String	QdimacsWriter.printVariables(Set<Proposition> vars, Map<Proposition,Integer> mappings)	Prints the variable mappings for a given set of propositions.

Uses of Proposition in org.tweetyproject.logics.translators.adfconditional

Methods in org.tweetyproject.logics.translators.adfconditional with parameters of type Proposition

Modifier and Type	Method	Description
FourValuedWorld.TruthValue	FourValuedWorld.get(Proposition p)	Returns the truth value of the given proposition.
ThreeValuedWorld.TruthValue	ThreeValuedWorld.get(Proposition p)	Returns the truth value of the given proposition.
void	FourValuedWorld.set(Proposition p, FourValuedWorld.TruthValue val)	Sets the value of the given proposition.
void	ThreeValuedWorld.set(Proposition p, ThreeValuedWorld.TruthValue val)	Sets the value of the given proposition.

Uses of Proposition in org.tweetyproject.logics.translators.adfrevision

Methods in org.tweetyproject.logics.translators.adfrevision that return types with arguments of type Proposition

Modifier and Type	Method	Description
Set<Proposition>	Indecision.getAtoms()
Set<Proposition>	WeakNegation.getAtoms()
Collection<Proposition>	PriestWorldAdapted.getBinarybase()	Returns the binary base of this world, i.e.
Collection<Proposition>	PriestWorldAdapted.getConflictbase()	Returns the conflict base of this world, i.e.

Methods in org.tweetyproject.logics.translators.adfrevision with parameters of type Proposition

Modifier and Type	Method	Description
PriestWorldAdapted.TruthValue	PriestWorldAdapted.get(Proposition p)	Returns the truth value of the given proposition.
int	Indecision.numberOfOccurrences(Proposition p)
int	WeakNegation.numberOfOccurrences(Proposition p)
PlFormula	Indecision.replace(Proposition p, PlFormula f, int i)
PlFormula	WeakNegation.replace(Proposition p, PlFormula f, int i)
void	PriestWorldAdapted.set(Proposition p, PriestWorldAdapted.TruthValue val)	Sets the value of the given proposition.

Uses of Proposition in org.tweetyproject.logics.translators.folprop

Methods in org.tweetyproject.logics.translators.folprop that return Proposition

Modifier and Type	Method	Description
Proposition	FOLPropTranslator.toPropositional(FolAtom atom)	Translates the given FOL-Atom into a Proposition

Methods in org.tweetyproject.logics.translators.folprop with parameters of type Proposition

Modifier and Type	Method	Description
FolAtom	FOLPropTranslator.toFOL(Proposition proposition)	Translates the given proposition into a FOL-Atom