Generating scenarios for periodic events with binary constraints

Reasoning with repeating events differs from reasoning about single events primarily in the fact that with the former the available information about aspects such as the number and period of the events may be indefinite. Much useful knowledge about repeating events takes the form of relationships between “successive” occurrences of the same event, or “proximate” occurrences of pairs of repeating events. The formulation presented focuses on such knowledge. A backtracking algorithm for solving reasoning problems involving repeating events is presented and its complexity evaluated