Adaptive Constraint-Based Agents in Artificial Environments

[STRUCTURAL CONSTRAINTS]   [Representation]   [Application Conditions]   [Examples]

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

Here are some structural constraints for the scheduling domain example.

The structural constraint SSubTaskNeighbor that is shown below checks the restriction that a SubTask must be the only beginning of a Task's temporally ordered list of SubTasks (upper left alternative), at the end (upper right alternative), somewhere in the middle (lower left alternative) or the only SubTask (lower right alternative).

Further structural constraints ensure that a SubTask has at most one successor in the Task's list (SSubTaskOrder), that a Task has at least one SubTask and is processed on exactly one Machine (STaskEmbedding) and that the Sum of the SubTasks' Durations equals the Task's Duration (SSubTaskDuration and STaskDuration).

[STRUCTURAL CONSTRAINTS]   [Representation]   [Application Conditions]   [Examples]

For questions, comments or suggestions, please contact us.

Last update:
January 31, 2002 by Alexander Nareyek