Modifier and Type | Class and 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.
|
Modifier and Type | Field and Description |
---|---|
private Proposition |
IndicatorUtilityFunction.focalElement
The focal element of this function.
|
private Proposition |
OvercautiousArgumentationAgent.focalElement
The focal element of this agent.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Set<Proposition> |
MultipleIndicatorUtilityFunction.focalSet
The focal set of this function.
|
private java.util.Set<Proposition> |
CountingUtilityFunction.focalSet
The focal set of this function.
|
Modifier and Type | Method and Description |
---|---|
int |
IndicatorUtilityFunction.rank(java.util.Collection<? extends Proposition> propositions) |
int |
MultipleIndicatorUtilityFunction.rank(java.util.Collection<? extends Proposition> propositions) |
int |
SasAgent.rank(java.util.Collection<? extends Proposition> propositions)
Ranks the given collection of propositions wrt.
|
int |
UtilityFunction.rank(java.util.Collection<? extends Proposition> propositions)
Rank the given collection of propositions.
|
int |
CountingUtilityFunction.rank(java.util.Collection<? extends Proposition> propositions) |
Constructor and 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 and 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.
|
Modifier and Type | Method and Description |
---|---|
protected PlBeliefSet |
SatCompleteReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected PlBeliefSet |
SatCompleteReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected PlBeliefSet |
SatCompleteReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected PlBeliefSet |
SatStableReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected PlBeliefSet |
SatStableReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected PlBeliefSet |
SatStableReasoner.getPropositionalCharacterisationBySemantics(DungTheory aaf,
java.util.Map<Argument,Proposition> in,
java.util.Map<Argument,Proposition> out,
java.util.Map<Argument,Proposition> undec) |
protected abstract PlBeliefSet |
AbstractSatExtensionReasoner.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, see
getPropositionalCharacterisation . |
protected abstract PlBeliefSet |
AbstractSatExtensionReasoner.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, see
getPropositionalCharacterisation . |
protected abstract PlBeliefSet |
AbstractSatExtensionReasoner.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, see
getPropositionalCharacterisation . |
Modifier and Type | Field and Description |
---|---|
private java.util.Set<Proposition> |
OutputReasoner.output
The output of this reasoner.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Proposition> |
OutputReasoner.getOutput(StructuredArgumentationFramework saf)
Returns the output this reasoner bases upon.
|
Modifier and Type | Method and Description |
---|---|
java.lang.Boolean |
OutputReasoner.query(StructuredArgumentationFramework beliefbase,
Proposition formula) |
Modifier and Type | Field and Description |
---|---|
private Proposition |
BasicArgument.claim
The claim of this basic argument.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Set<Proposition> |
BasicArgument.support
The support of this basic argument.
|
Modifier and Type | Method and Description |
---|---|
Proposition |
ArgumentStructure.getClaim()
Returns the claim of this argument structure, i.e.
|
Proposition |
BasicArgument.getConclusion() |
Modifier and Type | Method and Description |
---|---|
java.util.Set<Proposition> |
BasicArgument.getPremise() |
Modifier and Type | Method and Description |
---|---|
void |
BasicArgument.addPremise(Proposition premise) |
void |
BasicArgument.setConclusion(Proposition conclusion) |
Modifier and Type | Method and Description |
---|---|
void |
BasicArgument.addPremises(java.util.Collection<? extends Proposition> premises) |
Constructor and 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 and Description |
---|
BasicArgument(Proposition claim,
java.util.Set<Proposition> support)
Creates a new basic argument with the given claim
and the given support.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Comparator<Pair<Proposition,java.lang.Boolean>> |
ConditionalStructure.worldRepresentation
The object used to sort the literals in the PossibleWorld
|
Modifier and Type | Method and Description |
---|---|
java.util.Collection<Proposition> |
ConditionalStructure.getSignature() |
Modifier and Type | Method and Description |
---|---|
void |
ConditionalStructure.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 void |
ConditionalStructure.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.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Proposition> |
Conditional.getAtoms() |
Modifier and Type | Field and Description |
---|---|
private static Proposition |
TestConditionalStructure.a |
private static Proposition |
TestConditionalStructure.b |
Modifier and Type | Method and 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.
|
Modifier and Type | Method and Description |
---|---|
private Pair<java.util.Map<Variable,Term>,java.lang.Double> |
FuzzyInconsistencyMeasure.constructAndSolveProblem(java.util.Collection<PropositionalFormula> formulas,
java.util.Map<Proposition,Variable> assignments)
Utility method
|
private Term |
FuzzyInconsistencyMeasure.getTerm(PropositionalFormula 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 boolean |
FbInconsistencyMeasure.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.
|
Modifier and Type | Field and Description |
---|---|
private Proposition[] |
DimacsParser.prop_idx
An array representation of the propositions (for index mapping)
|
Modifier and Type | Method and Description |
---|---|
protected static java.lang.String |
SatSolver.convertToDimacs(java.util.Collection<PropositionalFormula> formulas,
java.util.List<Proposition> props)
Converts the given set of formulas to their string representation in
Dimacs CNF.
|
protected static java.io.File |
SatSolver.createTmpDimacsFile(java.util.Collection<PropositionalFormula> formulas,
java.util.List<Proposition> props)
Creates a temporary file in Dimacs format with the given proposition2variable mapping.
|
Modifier and Type | Field and Description |
---|---|
private SubsetIterator<Proposition> |
PossibleWorldIterator.it
Used for iterating over subsets of propositions.
|
private java.util.SortedSet<Pair<Proposition,java.lang.Boolean>> |
NicePossibleWorld.representation
The set saving all the proposition boolean pairs that represent this
world assuming the current signature.
|
private java.util.Map<Proposition,PriestWorld.TruthValue> |
PriestWorld.values
The truth values of the propositions.
|
private java.util.Map<Proposition,java.lang.Double> |
FuzzyInterpretation.values
Maps the propositions to their values.
|
Modifier and Type | Method and 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() |
Modifier and Type | Method and Description |
---|---|
PriestWorld.TruthValue |
PriestWorld.get(Proposition p)
Returns the truth value of the given proposition.
|
java.lang.Double |
FuzzyInterpretation.put(Proposition arg0,
java.lang.Double arg1) |
void |
PriestWorld.set(Proposition p,
PriestWorld.TruthValue val)
Sets the value of the given proposition.
|
Modifier and Type | Method and Description |
---|---|
int |
NicePossibleWorld.compare(Pair<Proposition,java.lang.Boolean> o1,
Pair<Proposition,java.lang.Boolean> o2) |
int |
NicePossibleWorld.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.
|
void |
FuzzyInterpretation.putAll(java.util.Map<? extends Proposition,? extends java.lang.Double> arg0) |
void |
NicePossibleWorld.setComparator(java.util.Comparator<Pair<Proposition,java.lang.Boolean>> comparator)
Changes the used comparator to sort the representation structure and resorts
the representation.
|
boolean |
NicePossibleWorld.setSignature(java.util.Collection<Proposition> signature)
Changes the signature of the world.
|
Constructor and 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)
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.
|
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.
|
Modifier and Type | Method and Description |
---|---|
Proposition |
Proposition.clone() |
Modifier and Type | Method and Description |
---|---|
java.util.Set<Proposition> |
SpecialFormula.getAtoms() |
java.util.Set<Proposition> |
Proposition.getAtoms() |
java.util.Set<Proposition> |
AssociativePropositionalFormula.getAtoms() |
abstract java.util.Set<Proposition> |
PropositionalFormula.getAtoms() |
java.util.Set<Proposition> |
Negation.getAtoms() |
Modifier and Type | Method and Description |
---|---|
int |
Proposition.compareTo(Proposition o) |
int |
SpecialFormula.numberOfOccurrences(Proposition p) |
int |
Proposition.numberOfOccurrences(Proposition p) |
int |
AssociativePropositionalFormula.numberOfOccurrences(Proposition p) |
abstract int |
PropositionalFormula.numberOfOccurrences(Proposition p)
Returns the number of occurrences of the given proposition
within this formula
|
int |
Negation.numberOfOccurrences(Proposition p) |
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) |
Constructor and Description |
---|
Proposition(Proposition other) |
Constructor and Description |
---|
PropositionalSignature(java.util.Collection<? extends Proposition> propositions)
Creates a new propositional signature with the given set
of propositions.
|
Modifier and Type | Field and Description |
---|---|
private static java.util.Set<Proposition> |
TestNicePossibleWorld.signature |
private static java.util.Set<Proposition> |
TestNicePossibleWorld.worldProps |
Modifier and Type | Field and Description |
---|---|
private ProbabilityFunction<Proposition> |
SyntacticRandomSampler.probProp
The probability function used to sample propositions
|
private SetTools<Proposition> |
RandomSatSampler.setTools
For randomisation
|
Modifier and Type | Method and Description |
---|---|
private static java.lang.String |
CanonicalIterator.formula2String(PropositionalFormula f,
java.util.Map<Proposition,java.lang.Integer> prop)
Encodes the given formula as a bitstring.
|
Modifier and Type | Method and Description |
---|---|
Proposition |
FOLPropTranslator.toPropositional(FOLAtom atom)
Translates the given FOL-Atom into a Proposition
|
Modifier and Type | Method and Description |
---|---|
FOLAtom |
FOLPropTranslator.toFOL(Proposition proposition)
Translates the given proposition into a FOL-Atom
|