Event scheduling using allen's algebra

Most real life planning requires reasoning with action as well as time. For efficient and effective reasoning, one must have a proper representation scheme to represent activities and temporal knowledge. Planning in real life requires reasoning while planning is in progress. A planning system's efficiency is essentially determined by its capacity to search intelligently and backtrack based on information obtained during plan generation. In this paper a simple backtracking algorithm has been developed using Allen's constraint propagation scheme to find a feasible event schedule in a temporally constrained domain.