τε2asp: implementing τε via answer set programming

This paper studies computational issues related to the problem of reasoning about action and change in timed domains by translating it into answer set programming paradigm. Based on this idea, we implement a new action and change reasoning solver - τe2asp with a polynomial translation without increasing its complexity for checking satisfiability and entailment in $\mathcal{TE}$ and report some experimental results.