Modifier and Type | Method and Description |
---|---|
java.util.Collection<Statement> |
NeutralPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
FoundedPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
CoherentPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
JustifiablePASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
RationalPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
InvolutaryPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
SemiFoundedPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
OptimisticPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
SemiOptimisticPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
abstract java.util.Collection<Statement> |
AbstractPASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars) |
java.util.Collection<Statement> |
PASemantics.getSatisfactionStatements(DungTheory theory,
java.util.Map<java.util.Collection<Argument>,FloatVariable> worlds2vars)
Returns the mathematical statement corresponding to the satisfaction
of the given theory wrt.
|
Modifier and Type | Method and Description |
---|---|
private Statement |
CReasoner.getAcceptanceConstraint(Conditional cond,
java.util.Map<PossibleWorld,IntegerVariable> ranks)
For the given conditional (B|A) and the given ranks of possible worlds, this
method constructs the inequation k(AB) < k(A-B) where k(AB) is the minimum of
the ranks of the interpretations that satisfy AB.
|
private Statement |
CReasoner.getRankConstraint(PossibleWorld w,
IntegerVariable ranki,
java.util.Map<Conditional,IntegerVariable> kappa_pos,
java.util.Map<Conditional,IntegerVariable> kappa_neg)
For the given interpretation "i" and the given kappas, this method
computes the constraint
k("i")=\sum_{"i" verifies ri} ki+ + \sum_{"i" falsifies ri} kj- |
Modifier and Type | Class and Description |
---|---|
class |
Equation
This class represent an equation of two terms.
|
class |
Inequation
This class models an inequation of two terms.
|
Modifier and Type | Method and Description |
---|---|
Statement |
Statement.replaceAllTerms(java.util.Map<? extends Term,? extends Term> substitutes)
Replaces terms according to the given map.
|
abstract Statement |
Statement.replaceTerm(Term toSubstitute,
Term substitution)
Replaces each occurrence of "toSubstitute" by "substitution" and
return the new statement.
|
Statement |
Inequation.replaceTerm(Term toSubstitute,
Term substitution) |
Statement |
Equation.replaceTerm(Term toSubstitute,
Term substitution) |
abstract Statement |
Statement.toLinearForm()
Brings both terms into linear form.
|
Statement |
Inequation.toLinearForm() |
Statement |
Equation.toLinearForm() |
abstract Statement |
Statement.toNormalizedForm()
Normalizes this constraint, i.e.
|
Statement |
Inequation.toNormalizedForm() |
Statement |
Equation.toNormalizedForm() |
Constructor and Description |
---|
ConstraintSatisfactionProblem(java.util.Collection<? extends Statement> statements)
Creates a new csp with the given statements
|
Modifier and Type | Field and Description |
---|---|
private java.util.Map<Statement,java.lang.Double> |
LagrangeSolver.startingPointsLMult
possible starting points for Lagrange multiplicators.
|
Modifier and Type | Method and Description |
---|---|
void |
LagrangeSolver.setStartingPointsLMult(java.util.Map<Statement,java.lang.Double> startingPointsLMult) |