Computer Science – Artificial Intelligence
Scientific paper
2011-10-17
Computer Science
Artificial Intelligence
To appear in Theory and Practice of Logic Programming
Scientific paper
In this paper we combine Answer Set Programming (ASP) with Dynamic Linear Time Temporal Logic (DLTL) to define a temporal logic programming language for reasoning about complex actions and infinite computations. DLTL extends propositional temporal logic of linear time with regular programs of propositional dynamic logic, which are used for indexing temporal modalities. The action language allows general DLTL formulas to be included in domain descriptions to constrain the space of possible extensions. We introduce a notion of Temporal Answer Set for domain descriptions, based on the usual notion of Answer Set. Also, we provide a translation of domain descriptions into standard ASP and we use Bounded Model Checking techniques for the verification of DLTL constraints.
Dupre' Daniele Theseider
Giordano Laura
Martelli Alberto
No associations
LandOfFree
Reasoning about Actions with Temporal Answer Sets does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Reasoning about Actions with Temporal Answer Sets, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reasoning about Actions with Temporal Answer Sets will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-317875