Modifier and Type | Method and Description |
---|---|
protected Pair<java.lang.Double,java.util.Set<ExecutableExtension>> |
T2BeliefState.doMove(ArgumentationEnvironment env,
DialogueTrace<Argument,Extension> trace) |
protected Pair<java.lang.Double,java.util.Set<ExecutableExtension>> |
T3BeliefState.doMove(ArgumentationEnvironment env,
DialogueTrace<Argument,Extension> trace) |
protected abstract Pair<java.lang.Double,java.util.Set<ExecutableExtension>> |
BeliefState.doMove(ArgumentationEnvironment env,
DialogueTrace<Argument,Extension> trace)
Gives the set of all best next moves with their expected utility
according to the belief state and the given trace.
|
Pair<java.lang.Double,java.util.Set<ExecutableExtension>> |
T1BeliefState.doMove(ArgumentationEnvironment env,
DialogueTrace<Argument,Extension> trace) |
Modifier and Type | Class and Description |
---|---|
class |
Division
A pair
is a division of AAF G w.r.t. |
Modifier and Type | Method and Description |
---|---|
static Pair<java.lang.Double,java.lang.Double> |
MathTools.averageAndVariance(java.util.Collection<java.lang.Double> values)
Compute the average value and the variance of the given list of
numbers.
|
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 |
---|---|
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.
|
Modifier and Type | Field and Description |
---|---|
private java.util.Map<Pair<T,S>,java.lang.Double> |
ShapleyCulpabilityMeasure.archive
Stores previously computed culpability values.
|
Modifier and Type | Method and Description |
---|---|
private java.util.Set<Pair<java.util.Collection<S>,java.util.Collection<S>>> |
ShapleyCulpabilityMeasure.getSubsets(T kb,
S f)
Computes all pairs (k,k') of knowledge bases k,k'\subseteq kb, such that k = k' \cup {pc}.
|
Constructor and Description |
---|
Role(java.lang.String name,
java.util.Set<Pair<Individual,Individual>> roles) |
Modifier and Type | Field and Description |
---|---|
private Pair<RelationalFormula,RelationalFormula> |
Equivalence.formulas
The pair of formulas that are part of the equivalence.
|
private Pair<RelationalFormula,RelationalFormula> |
Implication.formulas
The pair of formulas that are part of the implication.
|
Modifier and Type | Method and Description |
---|---|
Pair<RelationalFormula,RelationalFormula> |
Equivalence.getFormulas()
Returns the formulas of the equivalence.
|
Pair<RelationalFormula,RelationalFormula> |
Implication.getFormulas()
Returns the formulas of the implication.
|
Modifier and Type | Method and Description |
---|---|
void |
Equivalence.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)
Sets the formulas of the equivalence.
|
void |
Implication.setFormulas(Pair<RelationalFormula,RelationalFormula> formulas)
Sets the formulas of the implication.
|
Constructor and Description |
---|
Equivalence(Pair<RelationalFormula,RelationalFormula> formulas)
Creates a new equivalence with the given pair of formulas
|
Implication(Pair<RelationalFormula,RelationalFormula> formulas)
Creates a new implication with the given pair of formulas
|
Modifier and Type | Field and Description |
---|---|
private java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> |
AccessibilityRelation.tuples
The actual relation
|
Constructor and Description |
---|
AccessibilityRelation(java.util.Set<Pair<Interpretation<FolBeliefSet,FolFormula>,Interpretation<FolBeliefSet,FolFormula>>> tuples)
Constructs a new accessibility relation.
|
Modifier and Type | Method and Description |
---|---|
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample.CommonColdExample(int domain_size) |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample.ElephantZooExample(int domain_size) |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample.iterateExamples(int exNum,
int domain_size) |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample2.Nixon1() |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample2.Nixon2() |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample2.Nixon3() |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample.SimpleExample(int domain_size) |
static Pair<MarkovLogicNetwork,FolSignature> |
MlnExample.SmokersExample(int domain_size) |
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
|
Modifier and Type | Method and Description |
---|---|
protected static Pair<java.lang.String,java.util.List<PropositionalFormula>> |
SatSolver.convertToDimacs(java.util.Collection<PropositionalFormula> formulas)
Converts the given set of formulas to their string representation in
Dimacs CNF.
|
protected static Pair<java.io.File,java.util.List<PropositionalFormula>> |
SatSolver.createTmpDimacsFile(java.util.Collection<PropositionalFormula> formulas)
Creates a temporary file in Dimacs format and also returns a mapping between formulas and clauses.
|
Modifier and Type | Field and Description |
---|---|
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.
|
Modifier and Type | Method and Description |
---|---|
java.util.Set<Pair<Proposition,java.lang.Boolean>> |
NicePossibleWorld.getRepresentationStructure() |
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) |
Modifier and Type | Method and Description |
---|---|
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.
|
Constructor and Description |
---|
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.
|
Modifier and Type | Method and Description |
---|---|
private Pair<java.util.Collection<PropositionalFormula>,java.lang.Integer> |
CanonicalIterator.parseAssociativeFormula(java.util.BitSet s,
int idx,
int numOfTerms,
PropositionalSignature sig)
Parses an associate formula from the given bitset starting at index idx, with the given number
of terms and the given signature
|
private Pair<PropositionalFormula,java.lang.Integer> |
CanonicalIterator.parseFormula(java.util.BitSet s,
int idx,
PropositionalSignature sig)
Reads the next formula of the given bitset, starting at the given index.
|
private Pair<PropositionalFormula,java.lang.Integer> |
CanonicalIterator.parseProposition(java.util.BitSet s,
int idx,
PropositionalSignature sig)
Parses a proposition in bitset s starting from idx.
|
Modifier and Type | Method and Description |
---|---|
static Pair<ReferenceWorld,Probability> |
RpclCondensedProbabilityDistributionParser.ProbabilityAssignment(FolSignature signature) |
Modifier and Type | Method and Description |
---|---|
static Pair<HerbrandInterpretation,Probability> |
RpclProbabilityDistributionParser.ProbabilityAssignment(FolSignature signature) |
Modifier and Type | Field and Description |
---|---|
(package private) java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
Translator.translateMap |
Modifier and Type | Method and Description |
---|---|
protected Pair<java.lang.Integer,java.lang.Class<?>> |
Translator.getTranslateInfo(java.lang.Class<?> cls) |
Modifier and Type | Method and Description |
---|---|
protected abstract java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
Translator.createTranslateMap() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
AspFolTranslator.createTranslateMap() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
AspNlpTranslator.createTranslateMap() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
ClNLPTranslator.createTranslateMap() |
Modifier and Type | Method and Description |
---|---|
protected java.util.Map<java.lang.Class<?>,Pair<java.lang.Integer,java.lang.Class<?>>> |
FOLPropTranslator.createTranslateMap() |
Modifier and Type | Method and Description |
---|---|
protected static java.util.List<Pair<Rule,Rule>> |
PreferenceHandling.getConflictingRules(Program p1,
Program p2)
Helper method: Finds all pairs of conflicting rules in program p1 and p2.
|