[ Please note: The project has been discontinued as of May 31, 2005 and is superseded by the projects of the ii Labs. There won't be further updates to these pages. ]

(Related publication: [PUBLink])

To apply the SCSP handling methods described in Section [Structural Constraint Satisfaction Problems], some restrictions must be fulfilled.

• Nonextensible constraints are not allowed to appear in graphs of other constraints, as the addition and deletion productions of constraints partly incorporate their graphs.

The specification of the planning SCSP does not include any nonextensible constraints.

• Constraint-usage cycles are not allowed for the p_base graphs of extensible constraints, e.g., that p_baseA includes a B constraint and p_baseB includes the A constraint.

The figure below shows the integrations of extensible constraints' base graphs. It confirms that there are no cycles for the planning problem's specification.

• If the p_max graph of an extensible constraint is non-empty, no sequence of productions that is applied to the constraint's p_base graph can produce a graph that includes the p_max graph without previously producing the p_max graph.

The only constraint with a p_max graph is the Sensor Constraint. The only way to extend the p_{baseSensorConstraint} graph is by using the p_{extensionSensorConstraint} graph, which immediately produces the p_{maxSensorConstraint} graph.

For questions, comments or suggestions, please contact us.

Last update:
May 20, 2001 by Alexander Nareyek