Reasoning about actions with temporal answer sets

In this paper we define a Temporal Action Theory through a combination of Answer Set Programming and Dynamic Linear Time Temporal Logic (DLTL). DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. In our language, general temporal constraints can be included in domain descriptions. We define the notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Bounded Model Checking techniques are used for the verification of DLTL formulas. The approach can deal with systems with infinite runs.