Font Size: 

Planning has been at the forefront of research in the areas of Artificial Intelligence and cognitive science. High-level action description languages (e.g., language A) have been used to specify, verify and diagnose plans. Timed Planning is planning under real-time constraints. To specify timed planning problems, an extension of the action description language A with real-time stop-watches, called A_T has been used. In this paper, we show how timed planning domains (described in A_T can be easily and elegantly encoded as answer set programs extended with constraints over reals.