Adaptive Constraint-Based Agents in Artificial Environments

[COMBINATION]   [Structural Constraints]   [Constraint Types]   [Search Control]   [Optimization]

[ 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. ]

Application of Structural Constraints

(Related publications: [PUBLink] [PUBLink])

If the graph is changed by a production, the graph's consistency must be verified again. It would be very costly to test each time for all matches of possible structural constraints. Instead of this, instances of structural constraint types are memorized. These instances stay matched to a certain part of the constraint graph. Then, the graph must only be reverified with respect to the changes.

Whenever new elements are added by a production, there must be new structural constraint instances for all possible constraints' docking-part matches that include the new elements. Since there might be negative application conditions in the docking parts of existing structural constraints, those with an unsatisfied negative application condition due to the new elements must be excluded.

Whenever elements are deleted by a production, all structural constraint instances that matched these elements with their docking part must be deleted. If the deleted elements were part of a PAC in the docking part, the constraint instances must only be deleted if other elements to satisfy the PAC are not available. The deletion of elements may also mean that NACs of potentially applicable constraints' docking parts are no longer applicable. Structural constraint instances must be added in these cases.

[COMBINATION]   [Structural Constraints]   [Constraint Types]   [Search Control]   [Optimization]

For questions, comments or suggestions, please contact us.

Last update:
May 20, 2001 by Alexander Nareyek