Towards Metric Temporal Answer Set Programming

TL;DR

This paper develops a theoretical foundation for a metric temporal extension of Answer Set Programming, integrating temporal constructs within the logic of Here-and-There and Equilibrium Logic, enabling uniform comparison and implementation.

Contribution

It introduces a metric temporal extension of ASP based on Here-and-There and Equilibrium Logic, with a bounded time domain for uniform comparison and implementation.

Findings

Unified framework for temporal ASP variants

Compatibility with existing temporal logic extensions

Foundation for future implementations

Abstract

We elaborate upon the theoretical foundations of a metric temporal extension of Answer Set Programming. In analogy to previous extensions of ASP with constructs from Linear Temporal and Dynamic Logic, we accomplish this in the setting of the logic of Here-and-There and its non-monotonic extension, called Equilibrium Logic. More precisely, we develop our logic on the same semantic underpinnings as its predecessors and thus use a simple time domain of bounded time steps. This allows us to compare all variants in a uniform framework and ultimately combine them in a common implementation.