TY - JOUR
T1 - Reasoning about actions with temporal answer sets
AU - Giordano, Laura
AU - Martelli, Alberto
AU - Dupré, Daniele Theseider
PY - 2010
Y1 - 2010
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84883339632&partnerID=8YFLogxK
M3 - Conference article
AN - SCOPUS:84883339632
SN - 1613-0073
VL - 598
JO - CEUR Workshop Proceedings
JF - CEUR Workshop Proceedings
T2 - 25th Italian Conference on Computational Logic, CILC 2010
Y2 - 7 July 2010 through 9 July 2010
ER -