Uses of Class
net.sf.tweety.logics.pl.syntax.Proposition
-
-
-
Uses of Proposition in net.sf.tweety.action.query.syntax
Subclasses of Proposition in net.sf.tweety.action.query.syntax Modifier and Type Class Description classAlwaysQueryThis class represents an always query in the action query language S.classHoldsQueryThis class represents a holds query in the action query language S.classNecessarilyQueryThis class represents a necessarily query in the action query language S.classQueryPropositionAction queries are represented as propositional formulas with three possible types of propositions: holds, always and necessarily propositions. -
Uses of Proposition in net.sf.tweety.agents.dialogues.structured
Fields in net.sf.tweety.agents.dialogues.structured declared as Proposition Modifier and Type Field Description private PropositionIndicatorUtilityFunction. focalElementThe focal element of this function.private PropositionOvercautiousArgumentationAgent. focalElementThe focal element of this agent.Fields in net.sf.tweety.agents.dialogues.structured with type parameters of type Proposition Modifier and Type Field Description private java.util.Set<Proposition>CountingUtilityFunction. focalSetThe focal set of this function.private java.util.Set<Proposition>MultipleIndicatorUtilityFunction. focalSetThe focal set of this function.Method parameters in net.sf.tweety.agents.dialogues.structured with type arguments of type Proposition Modifier and Type Method Description intCountingUtilityFunction. rank(java.util.Collection<? extends Proposition> propositions)intIndicatorUtilityFunction. rank(java.util.Collection<? extends Proposition> propositions)intMultipleIndicatorUtilityFunction. rank(java.util.Collection<? extends Proposition> propositions)intSasAgent. rank(java.util.Collection<? extends Proposition> propositions)Ranks the given collection of propositions wrt.intUtilityFunction. rank(java.util.Collection<? extends Proposition> propositions)Rank the given collection of propositions.Constructors in net.sf.tweety.agents.dialogues.structured with parameters of type Proposition 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 net.sf.tweety.agents.dialogues.structured with type arguments of type Proposition Constructor Description CountingUtilityFunction(java.util.Collection<? extends Proposition> focalSet)Creates a new counting utility function for the given focal set.MultipleIndicatorUtilityFunction(java.util.Collection<? extends Proposition> focalSet)Creates a new multiple indicator utility function for the given focal set. -
Uses of Proposition in net.sf.tweety.arg.adf.reasoner.encodings
Fields in net.sf.tweety.arg.adf.reasoner.encodings with type parameters of type Proposition Modifier and Type Field Description private java.util.Map<Argument,Proposition>SatEncodingContext. falsesprivate Cache<Link,Proposition>SatEncodingContext. linksprivate java.util.Map<Argument,Proposition>SatEncodingContext. truesMethods in net.sf.tweety.arg.adf.reasoner.encodings that return Proposition Modifier and Type Method Description PropositionSatEncodingContext. getFalseRepresentation(Argument argument)PropositionSatEncodingContext. getLinkRepresentation(Link link)PropositionSatEncodingContext. getLinkRepresentation(Argument from, Argument to)PropositionSatEncodingContext. getTrueRepresentation(Argument argument) -
Uses of Proposition in net.sf.tweety.arg.adf.sat
Fields in net.sf.tweety.arg.adf.sat with type parameters of type Proposition Modifier and Type Field Description private java.util.Map<Proposition,java.lang.Integer>NativeLingelingSolver.LingelingSolverState. propositionsToNativeMaps the propositions to their native representation.Methods in net.sf.tweety.arg.adf.sat with parameters of type Proposition Modifier and Type Method Description voidNativeLingelingSolver.LingelingSolverState. assume(Proposition proposition, boolean value)voidSatSolverState. assume(Proposition proposition, boolean value)voidSimpleSatSolverState. assume(Proposition proposition, boolean value)private booleanNativeLingelingSolver.LingelingSolverState. isTrue(Proposition p) -
Uses of Proposition in net.sf.tweety.arg.adf.transform
Fields in net.sf.tweety.arg.adf.transform with type parameters of type Proposition Modifier and Type Field Description private java.util.function.Function<Argument,Proposition>DefinitionalCNFTransform. argumentToPropositionMethods in net.sf.tweety.arg.adf.transform that return Proposition Modifier and Type Method Description PropositionDefinitionalCNFTransform. transformArgument(java.util.function.Consumer<Disjunction> consumer, Argument argument, int polarity)PropositionDefinitionalCNFTransform. transformConjunction(java.util.function.Consumer<Disjunction> consumer, java.util.Collection<Proposition> subconditions, int polarity)PropositionDefinitionalCNFTransform. transformContradiction(java.util.function.Consumer<Disjunction> consumer, int polarity)PropositionDefinitionalCNFTransform. transformDisjunction(java.util.function.Consumer<Disjunction> consumer, java.util.Collection<Proposition> subconditions, int polarity)PropositionDefinitionalCNFTransform. transformEquivalence(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformExclusiveDisjunction(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformImplication(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformNegation(java.util.function.Consumer<Disjunction> consumer, Proposition sub, int polarity)PropositionDefinitionalCNFTransform. transformTautology(java.util.function.Consumer<Disjunction> consumer, int polarity)Methods in net.sf.tweety.arg.adf.transform with parameters of type Proposition Modifier and Type Method Description PropositionDefinitionalCNFTransform. transformEquivalence(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformExclusiveDisjunction(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformImplication(java.util.function.Consumer<Disjunction> consumer, Proposition left, Proposition right, int polarity)PropositionDefinitionalCNFTransform. transformNegation(java.util.function.Consumer<Disjunction> consumer, Proposition sub, int polarity)Method parameters in net.sf.tweety.arg.adf.transform with type arguments of type Proposition Modifier and Type Method Description PropositionDefinitionalCNFTransform. transformConjunction(java.util.function.Consumer<Disjunction> consumer, java.util.Collection<Proposition> subconditions, int polarity)PropositionDefinitionalCNFTransform. transformDisjunction(java.util.function.Consumer<Disjunction> consumer, java.util.Collection<Proposition> subconditions, int polarity)Constructor parameters in net.sf.tweety.arg.adf.transform with type arguments of type Proposition Constructor Description DefinitionalCNFTransform(java.util.function.Function<Argument,Proposition> argumentToProposition)Constructs a non-optimized version of the definitional (resp.DefinitionalCNFTransform(java.util.function.Function<Argument,Proposition> argumentToProposition, boolean optimize)Constructs a possibly optimized version of the definitional (resp. -
Uses of Proposition in net.sf.tweety.arg.dung.reasoner
Method parameters in net.sf.tweety.arg.dung.reasoner with type arguments of type Proposition Modifier and Type Method Description protected abstract PlBeliefSetAbstractSatExtensionReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec)Returns the semantic-specific propositional characterization of the underlying Dung theory, seegetPropositionalCharacterisation.protected PlBeliefSetSatCompleteReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec)protected PlBeliefSetSatStableReasoner. getPropositionalCharacterisationBySemantics(DungTheory aaf, java.util.Map<Argument,Proposition> in, java.util.Map<Argument,Proposition> out, java.util.Map<Argument,Proposition> undec) -
Uses of Proposition in net.sf.tweety.arg.saf.reasoner
Fields in net.sf.tweety.arg.saf.reasoner with type parameters of type Proposition Modifier and Type Field Description private java.util.Set<Proposition>OutputReasoner. outputThe output of this reasoner.Methods in net.sf.tweety.arg.saf.reasoner that return types with arguments of type Proposition Modifier and Type Method Description java.util.Set<Proposition>OutputReasoner. getOutput(StructuredArgumentationFramework saf)Returns the output this reasoner bases upon.Methods in net.sf.tweety.arg.saf.reasoner with parameters of type Proposition Modifier and Type Method Description java.lang.BooleanOutputReasoner. query(StructuredArgumentationFramework beliefbase, Proposition formula) -
Uses of Proposition in net.sf.tweety.arg.saf.syntax
Fields in net.sf.tweety.arg.saf.syntax declared as Proposition Modifier and Type Field Description private PropositionBasicArgument. claimThe claim of this basic argument.Fields in net.sf.tweety.arg.saf.syntax with type parameters of type Proposition Modifier and Type Field Description private java.util.Set<Proposition>BasicArgument. supportThe support of this basic argument.Methods in net.sf.tweety.arg.saf.syntax that return Proposition Modifier and Type Method Description PropositionArgumentStructure. getClaim()Returns the claim of this argument structure, i.e.PropositionBasicArgument. getConclusion()Methods in net.sf.tweety.arg.saf.syntax that return types with arguments of type Proposition Modifier and Type Method Description java.util.Collection<Proposition>StructuredArgumentationFramework. getAllPropositions()java.util.Set<Proposition>BasicArgument. getPremise()Methods in net.sf.tweety.arg.saf.syntax with parameters of type Proposition Modifier and Type Method Description voidBasicArgument. addPremise(Proposition premise)voidBasicArgument. setConclusion(Proposition conclusion)Method parameters in net.sf.tweety.arg.saf.syntax with type arguments of type Proposition Modifier and Type Method Description voidBasicArgument. addPremises(java.util.Collection<? extends Proposition> premises)Constructors in net.sf.tweety.arg.saf.syntax with parameters of type Proposition Constructor Description BasicArgument(Proposition claim)Creates a new basic argument with the given claim and empty support.BasicArgument(Proposition claim, java.util.Set<Proposition> support)Creates a new basic argument with the given claim and the given support.Constructor parameters in net.sf.tweety.arg.saf.syntax with type arguments of type Proposition Constructor Description BasicArgument(Proposition claim, java.util.Set<Proposition> support)Creates a new basic argument with the given claim and the given support. -
Uses of Proposition in net.sf.tweety.logics.cl.semantics
Fields in net.sf.tweety.logics.cl.semantics with type parameters of type Proposition Modifier and Type Field Description private java.util.Comparator<Pair<Proposition,java.lang.Boolean>>ConditionalStructure. worldRepresentationThe object used to sort the literals in the PossibleWorldMethods in net.sf.tweety.logics.cl.semantics that return types with arguments of type Proposition Modifier and Type Method Description java.util.Collection<Proposition>ConditionalStructure. getSignature()Method parameters in net.sf.tweety.logics.cl.semantics with type arguments of type Proposition Modifier and Type Method Description voidConditionalStructure. setWorldRepresentation(java.util.Comparator<Pair<Proposition,java.lang.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.private voidConditionalStructure. updateSignature(java.util.Collection<Proposition> signature)Update the data structure worldData by removing worlds that are not representable by the given signature and adding worlds that are new with the new signature. -
Uses of Proposition in net.sf.tweety.logics.cl.syntax
Methods in net.sf.tweety.logics.cl.syntax that return types with arguments of type Proposition Modifier and Type Method Description java.util.Set<Proposition>Conditional. getAtoms() -
Uses of Proposition in net.sf.tweety.logics.cl.test
Fields in net.sf.tweety.logics.cl.test declared as Proposition Modifier and Type Field Description private static PropositionTestConditionalStructure. aprivate static PropositionTestConditionalStructure. b -
Uses of Proposition in net.sf.tweety.logics.pl.analysis
Methods in net.sf.tweety.logics.pl.analysis that return types with arguments of type Proposition Modifier and Type Method Description private java.util.List<Triple<Proposition,java.lang.Integer,SpecialFormula>>FbInconsistencyMeasure. order(java.util.Set<Triple<Proposition,java.lang.Integer,SpecialFormula>> current)Orders the substitutions in decreasing order.Method parameters in net.sf.tweety.logics.pl.analysis with type arguments of type Proposition 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 methodprivate TermFuzzyInconsistencyMeasure. 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).private booleanFbInconsistencyMeasure. hasDuplicate(java.util.Set<Triple<Proposition,java.lang.Integer,SpecialFormula>> current)Checks whether the selection of substitutions is consistent (no proposition to be replaced by + and - at the same time).private java.util.List<Triple<Proposition,java.lang.Integer,SpecialFormula>>FbInconsistencyMeasure. order(java.util.Set<Triple<Proposition,java.lang.Integer,SpecialFormula>> current)Orders the substitutions in decreasing order. -
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_idxAn 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 protected static java.lang.StringSatSolver. 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.StringMaxSatSolver. 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.io.FileSatSolver. 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.FileMaxSatSolver. 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. -
Uses of Proposition in net.sf.tweety.logics.pl.semantics
Fields in net.sf.tweety.logics.pl.semantics with type parameters of type Proposition Modifier and Type Field Description private SubsetIterator<Proposition>PossibleWorldIterator. itUsed for iterating over subsets of propositions.private java.util.SortedSet<Pair<Proposition,java.lang.Boolean>>NicePossibleWorld. representationThe set saving all the proposition boolean pairs that represent this world assuming the current signature.private java.util.Map<Proposition,java.lang.Double>FuzzyInterpretation. valuesMaps the propositions to their values.private java.util.Map<Proposition,PriestWorld.TruthValue>PriestWorld. valuesThe truth values of the propositions.Methods in net.sf.tweety.logics.pl.semantics that return types with arguments of type Proposition Modifier and Type Method Description java.util.Set<java.util.Map.Entry<Proposition,java.lang.Double>>FuzzyInterpretation. entrySet()java.util.Collection<Proposition>PriestWorld. getBinarybase()Returns the binary base of this world, i.e.java.util.Collection<Proposition>PriestWorld. getConflictbase()Returns the conflict base of this world, i.e.java.util.Set<Pair<Proposition,java.lang.Boolean>>NicePossibleWorld. getRepresentationStructure()java.util.Set<Proposition>FuzzyInterpretation. keySet()Methods in net.sf.tweety.logics.pl.semantics with parameters of type Proposition Modifier and Type Method Description PriestWorld.TruthValuePriestWorld. get(Proposition p)Returns the truth value of the given proposition.java.lang.DoubleFuzzyInterpretation. put(Proposition arg0, java.lang.Double arg1)voidPriestWorld. 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 intNicePossibleWorld. compare(Pair<Proposition,java.lang.Boolean> o1, Pair<Proposition,java.lang.Boolean> o2)static java.util.Set<NicePossibleWorld>NicePossibleWorld. getAllPossibleWorlds(java.util.Collection<Proposition> signature)static java.util.Set<PossibleWorld>PossibleWorld. getAllPossibleWorlds(java.util.Collection<Proposition> signature)Returns the set of all possible worlds for the given propositional signature.voidFuzzyInterpretation. putAll(java.util.Map<? extends Proposition,? extends java.lang.Double> arg0)voidNicePossibleWorld. setComparator(java.util.Comparator<Pair<Proposition,java.lang.Boolean>> comparator)Changes the used comparator to sort the representation structure and resorts the representation.booleanNicePossibleWorld. setSignature(java.util.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(java.util.Collection<Proposition> trueInWorld, java.util.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(java.util.Collection<Proposition> trueInWorld, java.util.Collection<Proposition> signature, java.util.Comparator<Pair<Proposition,java.lang.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(java.util.Collection<Proposition> trueInWorld, java.util.Collection<Proposition> signature, java.util.Comparator<Pair<Proposition,java.lang.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(java.util.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 PropositionProposition. clone()Methods in net.sf.tweety.logics.pl.syntax that return types with arguments of type Proposition Modifier and Type Method Description java.util.Set<Proposition>AssociativePlFormula. getAtoms()java.util.Set<Proposition>Equivalence. getAtoms()java.util.Set<Proposition>Implication. getAtoms()java.util.Set<Proposition>Negation. getAtoms()abstract java.util.Set<Proposition>PlFormula. getAtoms()java.util.Set<Proposition>Proposition. getAtoms()java.util.Set<Proposition>SpecialFormula. getAtoms()Methods in net.sf.tweety.logics.pl.syntax with parameters of type Proposition Modifier and Type Method Description intProposition. compareTo(Proposition o)intAssociativePlFormula. numberOfOccurrences(Proposition p)intEquivalence. numberOfOccurrences(Proposition p)intImplication. numberOfOccurrences(Proposition p)intNegation. numberOfOccurrences(Proposition p)abstract intPlFormula. numberOfOccurrences(Proposition p)Returns the number of occurrences of the given proposition within this formulaintProposition. numberOfOccurrences(Proposition p)intSpecialFormula. numberOfOccurrences(Proposition p)PlFormulaConjunction. replace(Proposition p, PlFormula f, int i)PlFormulaDisjunction. replace(Proposition p, PlFormula f, int i)PlFormulaEquivalence. replace(Proposition p, PlFormula f, int i)PlFormulaImplication. replace(Proposition p, PlFormula f, int i)PlFormulaNegation. replace(Proposition p, PlFormula f, int i)abstract PlFormulaPlFormula. replace(Proposition p, PlFormula f, int i)Replaces the ith instance of the proposition p by f.PlFormulaProposition. replace(Proposition p, PlFormula f, int i)PlFormulaSpecialFormula. 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(java.util.Collection<? extends Proposition> propositions)Creates a new propositional signature with the given set of propositions. -
Uses of Proposition in net.sf.tweety.logics.pl.test
Fields in net.sf.tweety.logics.pl.test with type parameters of type Proposition Modifier and Type Field Description private static java.util.Set<Proposition>TestNicePossibleWorld. signatureprivate static java.util.Set<Proposition>TestNicePossibleWorld. worldProps -
Uses of Proposition in net.sf.tweety.logics.pl.util
Fields in net.sf.tweety.logics.pl.util with type parameters of type Proposition Modifier and Type Field Description private ProbabilityFunction<Proposition>SyntacticRandomSampler. probPropThe probability function used to sample propositionsprivate SetTools<Proposition>RandomSatSampler. setToolsFor randomisationMethod parameters in net.sf.tweety.logics.pl.util with type arguments of type Proposition Modifier and Type Method Description private static java.lang.StringCanonicalIterator. formula2String(PlFormula f, java.util.Map<Proposition,java.lang.Integer> prop)Encodes the given formula as a bitstring. -
Uses of Proposition in net.sf.tweety.logics.qbf.parser
Fields in net.sf.tweety.logics.qbf.parser declared as Proposition Modifier and Type Field Description private PropositionQCirParser. outputThe name of the output gate variable of the problem. -
Uses of Proposition in net.sf.tweety.logics.qbf.semantics
Methods in net.sf.tweety.logics.qbf.semantics with parameters of type Proposition 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.Method parameters in net.sf.tweety.logics.qbf.semantics with type arguments of type Proposition Modifier and Type Method Description static java.util.Set<QbPossibleWorld>QbPossibleWorld. getAllPossibleWorlds(java.util.Collection<Proposition> signature)Returns the set of all possible worlds for the given propositional signature.Constructor parameters in net.sf.tweety.logics.qbf.semantics with type arguments of type Proposition Constructor Description QbPossibleWorld(java.util.Collection<? extends Proposition> propositions)Creates a new possible world with the given set of propositions. -
Uses of Proposition in net.sf.tweety.logics.qbf.syntax
Fields in net.sf.tweety.logics.qbf.syntax with type parameters of type Proposition Modifier and Type Field Description private java.util.Set<Proposition>ExistsQuantifiedFormula. quantifier_variablesThe quantified variables.private java.util.Set<Proposition>ForallQuantifiedFormula. quantifier_variablesThe quantifier variables.Methods in net.sf.tweety.logics.qbf.syntax that return types with arguments of type Proposition Modifier and Type Method Description java.util.Set<Proposition>ExistsQuantifiedFormula. getAtoms()java.util.Set<Proposition>ForallQuantifiedFormula. getAtoms()java.util.Set<Proposition>ExistsQuantifiedFormula. getQuantifierVariables()java.util.Set<Proposition>ForallQuantifiedFormula. getQuantifierVariables()Methods in net.sf.tweety.logics.qbf.syntax with parameters of type Proposition Modifier and Type Method Description intExistsQuantifiedFormula. numberOfOccurrences(Proposition p)intForallQuantifiedFormula. numberOfOccurrences(Proposition p)PlFormulaExistsQuantifiedFormula. replace(Proposition p, PlFormula f, int i)PlFormulaForallQuantifiedFormula. replace(Proposition p, PlFormula f, int i)Constructors in net.sf.tweety.logics.qbf.syntax with parameters of type Proposition 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 net.sf.tweety.logics.qbf.syntax with type arguments of type Proposition Constructor Description ExistsQuantifiedFormula(PlFormula f, java.util.Set<Proposition> variables)Create a new existential boolean quantification.ForallQuantifiedFormula(PlFormula f, java.util.Set<Proposition> variables)Create a new universal boolean quantification. -
Uses of Proposition in net.sf.tweety.logics.qbf.writer
Method parameters in net.sf.tweety.logics.qbf.writer with type arguments of type Proposition Modifier and Type Method Description java.lang.StringQdimacsWriter. printVariables(java.util.Set<Proposition> vars, java.util.Map<Proposition,java.lang.Integer> mappings)java.lang.StringQdimacsWriter. printVariables(java.util.Set<Proposition> vars, java.util.Map<Proposition,java.lang.Integer> mappings) -
Uses of Proposition in net.sf.tweety.logics.translators.folprop
Methods in net.sf.tweety.logics.translators.folprop that return Proposition Modifier and Type Method Description PropositionFOLPropTranslator. toPropositional(FolAtom atom)Translates the given FOL-Atom into a PropositionMethods in net.sf.tweety.logics.translators.folprop with parameters of type Proposition Modifier and Type Method Description FolAtomFOLPropTranslator. toFOL(Proposition proposition)Translates the given proposition into a FOL-Atom
-