A DCOP problem that is defined using JaCoP variables and constraints. More...

Inheritance diagram for frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >:

[legend]

Public Member Functions
	JaCoPproblem (boolean maximize)
	Constructor.
	JaCoPproblem (boolean maximize, boolean publicAgents, boolean publicVars, boolean privateConstraints, boolean extendedRandNeighborhoods)
	Constructor.
Collection< IntVarCloneable >	getJaCoPvars ()
void	addVariable (IntVarCloneable var, String owner)
	Adds a JaCoP variable.
void	addConstraint (Constraint constraint)
	Adds a JaCoP Constraint.
void	addSoftConstraint (Constraint constraint, IntVarCloneable objVar)
	Adds a JaCoP Constraint.
void	addDecompConstraint (DecomposedConstraintCloneableInterface constraint)
	Adds a JaCoP DecomposedConstraint.
void	addSoftDecompConstraint (DecomposedConstraintCloneableInterface constraint, IntVarCloneable objVar)
	Adds a JaCoP soft DecomposedConstraint.
void	reset (ProblemInterface< AddableInteger, V > newProblem)
void	setDomClass (Class< AddableInteger > domClass)
Class< AddableInteger >	getDomClass ()
boolean	multipleTypes ()
void	incrNCCCs (long incr)
long	getNCCCs ()
void	setNCCCs (long ncccs)
Set< String >	getExtVars ()
boolean	addVariable (String name, String owner, String domain)
boolean	addVariable (String name, String owner, AddableInteger[] domain)
void	rescale (V multiply, V add)
void	setDomain (String var, AddableInteger[] dom)
boolean	setOwner (String cons, String owner)
Map< String, Set< String > >	getAnonymNeighborhoods ()
Map< String, Set< String > >	getAnonymNeighborhoods (String agent)
List<? extends UtilitySolutionSpace< AddableInteger, V > >	getProbabilitySpaces ()
List<? extends UtilitySolutionSpace< AddableInteger, V > >	getProbabilitySpaces (String var)
void	setProbSpace (String var, Map< AddableInteger, Double > prob)
boolean	removeSpace (String name)
boolean	addSolutionSpace (UtilitySolutionSpace< AddableInteger, V > space)
UtilitySolutionSpace< AddableInteger, V >	getUtility (Map< String, AddableInteger > assignments, boolean withAnonymVars)
UtilitySolutionSpace< AddableInteger, V >	getExpectedUtility (Map< String, AddableInteger > assignments)
UtilitySolutionSpace< AddableInteger, V >	getParamUtility (Map< String[], BasicUtilitySolutionSpace< AddableInteger, ArrayList< AddableInteger > > > assignments)
JaCoPproblem< V >	getSubProblem (String agent)
void	setUtilClass (Class< V > utilClass)
void	ground (String varName, AddableInteger val)
Map< String, ? extends UtilitySolutionSpace< AddableInteger, V > >	getProbabilitySpacePerRandVar ()
JaCoPproblem< V >	clone ()
Public Member Functions inherited from frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
String	toString ()
String	getAgent ()
Set< String >	getVariables (final String owner)
V[]	getDomain (String var)
int	getDomainSize (String var)
Map< String, Set< String > >	getNeighborhoods ()
Map< String, Integer >	getNeighborhoodSizes ()
Map< String, Integer >	getNeighborhoodSizes (String agent)
int	getNbrNeighbors (String var)
int	getNbrNeighbors (String var, boolean withAnonymVars)
HashSet< String >	getNeighborVars (String var)
HashSet< String >	getNeighborVars (String var, boolean withAnonymVars)
int	getNumberOfCoordinationConstraints ()
Map< String, Set< String > >	getAgentNeighborhoods ()
Map< String, Set< String > >	getAgentNeighborhoods (String agent)
Map< String, Set< String > >	getVarScopes ()
void	setAgent (String name)
	Sets the name of the agent owning this subproblem.
Set< String >	getAgents ()
Class< U >	getUtilClass ()
U	getMinInfUtility ()
U	getPlusInfUtility ()
int	getNbrVars ()
int	getNbrVars (String agent)
int	getNbrIntVars ()
Map< String, String >	getOwners ()
String	getOwner (String var)
boolean	isRandom (String var)
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces ()
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (boolean withAnonymVars)
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, boolean withAnonymVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, Set< String > forbiddenVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, final boolean withAnonymVars, Set< String > forbiddenVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (Set< String > vars, boolean withAnonymVars, Set< String > forbiddenVars)
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments)
Set< String >	getVariables ()
Set< String >	getMyVars ()
Set< String >	getAnonymVars ()
Set< String >	getRandVars ()
Set< String >	getAllVars ()
U	getZeroUtility ()
boolean	maximize ()
void	setMaximize (final boolean maximize)
void	setUtilClass (Class< U > utilClass)
boolean	addAgent (String agent)
Map< String, Set< String > >	getNeighborhoods (String agent)
Map< String, Set< String > >	getNeighborhoods (String agent, boolean withAnonymVars, boolean onlyAnonymVars)
UtilitySolutionSpace< V, U >	addUnarySpace (String name, String var, V[] dom, U[] utils)
Public Member Functions inherited from frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
boolean	addVariable (String name, String owner, V[] domain)
	Adds a new variable.
void	rescale (U multiply, U add)
	Rescales the problem.
void	setDomain (String var, V[] dom)
	Sets the domain of a variable.
void	setProbSpace (String var, Map< V, Double > prob)
	Adds to the problem a probability space for the input random variable.
boolean	addSolutionSpace (UtilitySolutionSpace< V, U > space)
	Adds a solution space to the problem.
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments, final boolean withAnonymVars)
	Computes the total utility of the input assignment to variables.
UtilitySolutionSpace< V, U >	getExpectedUtility (Map< String, V > assignments)
	Computes the expectation over the random variables of the utility for the input assignments.
UtilitySolutionSpace< V, U >	getParamUtility (Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments)
	Computes the total utility of the input assignment to variables, conditioned on the values of parameters.
void	ground (String var, V val)
	Adds a constraint that enforces that var = val.
Public Member Functions inherited from frodo2.solutionSpaces.ProblemInterface< V, U >
void	reset (ProblemInterface< V, U > newProblem)
	Resets this problem to be the same as the input one.
void	setDomClass (Class< V > domClass)
	Sets the class to be used for variable values.
Class< V >	getDomClass ()
void	setUtilClass (Class< U > utilClass)
	Sets the class to be used for utility values.
Class< U >	getUtilClass ()
U	getZeroUtility ()
U	getPlusInfUtility ()
U	getMinInfUtility ()
String	getAgent ()
Set< String >	getAgents ()
ProblemInterface< V, U >	getSubProblem (String agent)
	Builds the subproblem description for a given agent by extracting it from the overall problem description.
boolean	multipleTypes ()
void	incrNCCCs (long incr)
	Increments the number of constraint checks.
long	getNCCCs ()
void	setNCCCs (long ncccs)
	Sets the NCCC count.

Protected Attributes
final boolean	publicVars
	Whether each variable is known to each agent.
final boolean	privateConstraints
	If `true`, any constraint with a specific owner is only known by that owner.
Protected Attributes inherited from frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
boolean	maximize
	Whether this is a maximization or a minimization problem.
Map< String, String >	owners
	For each variable, the name of its owner agent.
Set< String >	randVars
	The random variables.
HashSet< String >	agents = new HashSet<String> ()
	The set of agents.
List< UtilitySolutionSpace< V, U > >	spaces
	The list of solution spaces.
Map< String, V[]>	domains
	The domain of each variable.
Class< U >	utilClass = (Class<U>) AddableInteger.class
	The class used for utility values.
String	agentName
	The name of the agent owning this subproblem.
final boolean	publicAgents
	Whether each agent knows the identities of all agents.
final boolean	extendedRandNeighborhoods
	If `true`, neighborhood relationships between decision variables are extended through random variables.
final boolean	mpc
	Whether to behave in MPC mode.
HashMap< String, Set< String > >	varScopes = new HashMap<String, Set<String>> ()
	For each shared variable, the names of the agents in its scope.

Private Member Functions
void	addSoftConstraint (Constraint constraint, IntVarCloneable objVar, final boolean excludeObjVar)
	Adds a JaCoP Constraint.
AddableInteger[]	buildDomain (Var jacopVar)
	Constructs an AddableInteger[] domain for an input JaCoP variable.
boolean	hasConstraint (String name)
	Checks whether this problem contains a space with the input name.

Private Attributes
HashMap< String, IntVarCloneable >	vars = new HashMap<String, IntVarCloneable> ()
	The JaCoP variables, indexed by name.
V	zeroValuation
	The zero valuation.

Static Private Attributes
static final long	serialVersionUID = 8959353326324207706L
	Used for serialization.

Additional Inherited Members
Protected Member Functions inherited from frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >
	AbstractProblem ()
	Constructor.
	AbstractProblem (boolean maximize, boolean publicAgents, boolean mpc, boolean extendedRandNeighborhoods)
	Constructor.
Set< String >	getScope (String var)
	Returns the agent scope of the input anonymous variable.
U	getInfeasibleUtil ()
void	setVarScope (String var, Set< String > scope)
	Sets the agent scope of a shared variable.

Detailed Description

A DCOP problem that is defined using JaCoP variables and constraints.

Author: Thomas Leaute

Parameters

<V>	the type used for valuations

Constructor & Destructor Documentation

◆ JaCoPproblem() [1/2]

frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem ( boolean maximize )

Constructor.

Parameters

maximize whether this is a maximization problem (true) or a minimization problem (false)

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.maximize.

Referenced by clone(), and getSubProblem().

◆ JaCoPproblem() [2/2]

frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem	(	boolean	maximize,
		boolean	publicAgents,
		boolean	publicVars,
		boolean	privateConstraints,
		boolean	extendedRandNeighborhoods )

Constructor.

Parameters

maximize	Whether this is a maximization problem (true) or a minimization problem (false)
publicAgents	Whether each agent knows the identities of all agents
publicVars	Whether each variable is known to each agent
privateConstraints	If `true`, any constraint with a specific owner is only known by that owner
extendedRandNeighborhoods	Whether neighborhood relationships between decision variables are extended through random variables

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.extendedRandNeighborhoods, frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.maximize, privateConstraints, frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.publicAgents, and publicVars.

Member Function Documentation

◆ addConstraint()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addConstraint ( Constraint constraint )

Adds a JaCoP Constraint.

Parameters

constraint the constraint

References addSoftConstraint().

Here is the call graph for this function:

◆ addDecompConstraint()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addDecompConstraint ( DecomposedConstraintCloneableInterface constraint )

Adds a JaCoP DecomposedConstraint.

Parameters

constraint the constraint

References addSoftDecompConstraint().

Referenced by frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_Arithmetic(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_IntVarArray_IntervalDomain_int_int_int(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_IntVarArray_IntVar_Decomposed(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_IntVarArray_IntVarArray_IntVarArray_IntVarArray_Decomposed(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_IntVarArrayArray(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_Stretch().

Here is the call graph for this function:

◆ addSoftConstraint() [1/2]

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addSoftConstraint	(	Constraint	constraint,
		IntVarCloneable	objVar )

Adds a JaCoP Constraint.

Parameters

constraint	the constraint
objVar	the objective variable to be minimized or maximized

References addSoftConstraint().

Referenced by addConstraint(), addSoftConstraint(), addSolutionSpace(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_Knapsack(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_NetworkFlow().

Here is the call graph for this function:

◆ addSoftConstraint() [2/2]

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addSoftConstraint	(	Constraint	constraint,
		IntVarCloneable	objVar,
		final boolean	excludeObjVar )

private

Adds a JaCoP Constraint.

Parameters

constraint	the constraint
objVar	the objective variable to be minimized or maximized
excludeObjVar	whether to exclude the objective variable from the variables in scope of the output JaCoPutilSpace

References buildDomain().

Here is the call graph for this function:

◆ addSoftDecompConstraint()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addSoftDecompConstraint	(	DecomposedConstraintCloneableInterface	constraint,
		IntVarCloneable	objVar )

Adds a JaCoP soft DecomposedConstraint.

Parameters

constraint	the constraint
objVar	the objective variable to be minimized or maximized (may be null)

References addSoftDecompConstraint(), and buildDomain().

Referenced by addDecompConstraint(), addSoftDecompConstraint(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_SoftAlldifferent(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.test_SoftGCC().

Here is the call graph for this function:

◆ addSolutionSpace()

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addSolutionSpace ( UtilitySolutionSpace< AddableInteger, V > space )

See also: DCOPProblemInterface#addSolutionSpace(UtilitySolutionSpace)

References addConstraint(), addSoftConstraint(), frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.SparseIterator< V, U >.getCurrentUtility(), hasConstraint(), frodo2.solutionSpaces.SolutionSpace< V extends Addable< V > >.SparseIterator< V >.nextSolution(), frodo2.solutionSpaces.hypercube.Hypercube< V extends Addable< V >, U extends Addable >.NullHypercube< V extends Addable< V >, U extends Addable >.NULL, and frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.sparseIter().

Referenced by clone(), frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.parse(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

Here is the call graph for this function:

◆ addVariable() [1/3]

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable	(	IntVarCloneable	var,
		String	owner )

Adds a JaCoP variable.

Parameters

var	the variable
owner	the owning agent (null if the variable is public)

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.agents, frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.domains, and frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.owners.

Referenced by clone(), getSubProblem(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.newIntVar(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.newIntVarArray(), frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.parse(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

◆ addVariable() [2/3]

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable	(	String	name,
		String	owner,
		AddableInteger[]	domain )

See also: DCOPProblemInterface.addVariable(java.lang.String, java.lang.String, Addable[])

Todo: Auto-generated method stub

◆ addVariable() [3/3]

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable	(	String	name,
		String	owner,
		String	domain )

See also: DCOPProblemInterface.addVariable(java.lang.String, java.lang.String, java.lang.String)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ buildDomain()

AddableInteger[] frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.buildDomain ( Var jacopVar )

private

Constructs an AddableInteger[] domain for an input JaCoP variable.

Parameters

jacopVar the JaCoP variable

Returns: an AddableInteger[] domain

Referenced by addSoftConstraint(), and addSoftDecompConstraint().

◆ clone()

JaCoPproblem< V > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone ( )

Here is the call graph for this function:

◆ getAnonymNeighborhoods() [1/2]

Map< String, Set< String > > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getAnonymNeighborhoods ( )

See also: DCOPProblemInterface.getAnonymNeighborhoods()

Todo: Auto-generated method stub

Reimplemented from frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getAnonymNeighborhoods() [2/2]

Map< String, Set< String > > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getAnonymNeighborhoods ( String agent )

See also: DCOPProblemInterface.getAnonymNeighborhoods(java.lang.String)

Todo: Auto-generated method stub

Reimplemented from frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.

◆ getDomClass()

Class< AddableInteger > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getDomClass ( )

See also: ProblemInterface.getDomClass()

◆ getExpectedUtility()

UtilitySolutionSpace< AddableInteger, V > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getExpectedUtility ( Map< String, AddableInteger > assignments )

See also: DCOPProblemInterface.getExpectedUtility(java.util.Map)

Todo: Auto-generated method stub

◆ getExtVars()

Set< String > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getExtVars ( )

See also: DCOPProblemInterface.getExtVars()

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getJaCoPvars()

Collection< IntVarCloneable > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getJaCoPvars ( )

Returns: the JaCoP variables

Referenced by frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

◆ getNCCCs()

long frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getNCCCs ( )

See also: ProblemInterface.getNCCCs()

Note: Not supported by JaCoP, always returns -1

◆ getParamUtility()

UtilitySolutionSpace< AddableInteger, V > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getParamUtility ( Map< String[], BasicUtilitySolutionSpace< AddableInteger, ArrayList< AddableInteger > > > assignments )

See also: DCOPProblemInterface.getParamUtility(java.util.Map)

Todo: Auto-generated method stub

◆ getProbabilitySpacePerRandVar()

Map< String, ? extends UtilitySolutionSpace< AddableInteger, V > > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getProbabilitySpacePerRandVar ( )

See also: DCOPProblemInterface.getProbabilitySpacePerRandVar()

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getProbabilitySpaces() [1/2]

List<? extends UtilitySolutionSpace< AddableInteger, V > > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getProbabilitySpaces ( )

See also: DCOPProblemInterface.getProbabilitySpaces()

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getProbabilitySpaces() [2/2]

List<? extends UtilitySolutionSpace< AddableInteger, V > > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getProbabilitySpaces ( String var )

See also: DCOPProblemInterface.getProbabilitySpaces(java.lang.String)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getSubProblem()

JaCoPproblem< V > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem ( String agent )

See also: DCOPProblemInterface.getSubProblem(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Here is the call graph for this function:

◆ getUtility()

UtilitySolutionSpace< AddableInteger, V > frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getUtility	(	Map< String, AddableInteger >	assignments,
		boolean	withAnonymVars )

See also: DCOPProblemInterface.getUtility(java.util.Map, boolean)

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getInfeasibleUtil(), frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getSolutionSpaces(), frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getZeroUtility(), frodo2.solutionSpaces.UtilitySolutionSpace< V extends Addable< V >, U extends Addable >.slice(), frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.spaces, and vars.

Referenced by frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.testProblemFromRepository(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPtests< V extends Addable< V > >.testRandomExtensionalProblem().

Here is the call graph for this function:

◆ ground()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.ground	(	String	varName,
		AddableInteger	val )

See also: DCOPProblemInterface.ground(java.lang.String, Addable)

References addConstraint(), and frodo2.solutionSpaces.AddableInteger.intValue().

Here is the call graph for this function:

◆ hasConstraint()

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.hasConstraint ( String name )

private

Checks whether this problem contains a space with the input name.

Parameters

name	the name of the space

Returns: whether this problem contains a space with the input name; returns false if the input name is null

Referenced by addSolutionSpace().

◆ incrNCCCs()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.incrNCCCs ( long incr )

See also: ProblemInterface.incrNCCCs(long)

Warning: It doesn't make sense to count constraint checks in JaCoP, so this method doesn't do anything.

◆ multipleTypes()

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.multipleTypes ( )

See also: ProblemInterface.multipleTypes()

Todo: Auto-generated method stub

◆ removeSpace()

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.removeSpace ( String name )

See also: DCOPProblemInterface.removeSpace(java.lang.String)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ rescale()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.rescale	(	V	multiply,
		V	add )

See also: DCOPProblemInterface#rescale(Addable, Addable)

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.spaces.

◆ reset()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.reset ( ProblemInterface< AddableInteger, V > newProblem )

See also: ProblemInterface#reset(ProblemInterface)

Todo: Auto-generated method stub

◆ setDomain()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setDomain	(	String	var,
		AddableInteger[]	dom )

See also: DCOPProblemInterface.setDomain(java.lang.String, Addable[])

Todo: Auto-generated method stub

◆ setDomClass()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setDomClass ( Class< AddableInteger > domClass )

See also: ProblemInterface.setDomClass(java.lang.Class)

Todo: Auto-generated method stub

◆ setNCCCs()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setNCCCs ( long ncccs )

See also: ProblemInterface.setNCCCs(long)

Warning: Does nothing

◆ setOwner()

boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setOwner	(	String	cons,
		String	owner )

See also: DCOPProblemInterface.setOwner(java.lang.String, java.lang.String)

Todo: Auto-generated method stub

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ setProbSpace()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setProbSpace	(	String	var,
		Map< AddableInteger, Double >	prob )

See also: DCOPProblemInterface.setProbSpace(java.lang.String, java.util.Map)

Todo: Auto-generated method stub

◆ setUtilClass()

void frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setUtilClass ( Class< V > utilClass )

See also: AbstractProblem.setUtilClass(java.lang.Class)

References frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.utilClass.

Referenced by clone(), getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.parse(), frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.setUp(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

Member Data Documentation

◆ privateConstraints

final boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.privateConstraints

protected

If true, any constraint with a specific owner is only known by that owner.

Else, constraint knowledge is shared by all involved.

Referenced by JaCoPproblem().

◆ publicVars

final boolean frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.publicVars

protected

Whether each variable is known to each agent.

Referenced by JaCoPproblem().

◆ serialVersionUID

final long frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.serialVersionUID = 8959353326324207706L

staticprivate

Used for serialization.

◆ vars

HashMap<String, IntVarCloneable> frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.vars = new HashMap<String, IntVarCloneable> ()

private

The JaCoP variables, indexed by name.

Referenced by getUtility().

◆ zeroValuation

V frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.zeroValuation

private

The zero valuation.

The documentation for this class was generated from the following file:

src/frodo2/solutionSpaces/JaCoP/JaCoPproblem.java

Public Member Functions

Protected Attributes

Private Member Functions

Private Attributes

Static Private Attributes

Additional Inherited Members

Detailed Description

Constructor & Destructor Documentation

◆ JaCoPproblem() [1/2]

◆ JaCoPproblem() [2/2]

Member Function Documentation

◆ addConstraint()

◆ addDecompConstraint()

◆ addSoftConstraint() [1/2]

◆ addSoftConstraint() [2/2]

◆ addSoftDecompConstraint()

◆ addSolutionSpace()

◆ addVariable() [1/3]

◆ addVariable() [2/3]

◆ addVariable() [3/3]

◆ buildDomain()

◆ clone()

◆ getAnonymNeighborhoods() [1/2]

◆ getAnonymNeighborhoods() [2/2]

◆ getDomClass()

◆ getExpectedUtility()

◆ getExtVars()

◆ getJaCoPvars()

◆ getNCCCs()

◆ getParamUtility()

◆ getProbabilitySpacePerRandVar()

◆ getProbabilitySpaces() [1/2]

◆ getProbabilitySpaces() [2/2]

◆ getSubProblem()

◆ getUtility()

◆ ground()

◆ hasConstraint()

◆ incrNCCCs()

◆ multipleTypes()

◆ removeSpace()

◆ rescale()

◆ reset()

◆ setDomain()

◆ setDomClass()

◆ setNCCCs()

◆ setOwner()

◆ setProbSpace()

◆ setUtilClass()

Member Data Documentation

◆ privateConstraints

◆ publicVars

◆ serialVersionUID

◆ vars

◆ zeroValuation