Reasoning about Actions with Temporal Answer Sets

TL;DR

This paper introduces a novel temporal logic programming language combining ASP and DLTL to reason about complex actions and infinite computations, enabling more expressive domain modeling and verification.

Contribution

It defines a new temporal answer set semantics, integrates DLTL into ASP, and applies bounded model checking for DLTL constraint verification.

Findings

Defined Temporal Answer Set for domain descriptions

Translated domain descriptions into standard ASP

Applied bounded model checking for DLTL constraints

Abstract

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.