Towards Constraint Temporal Answer Set Programming
Abstract
Reasoning about dynamic systems with a fine-grained temporal and numeric resolution presents significant challenges for logic-based approaches like Answer Set Programming (ASP). To address this, we introduce and elaborate upon a novel temporal and constraint-based extension of the logic of Here-and-There and its nonmonotonic equilibrium extension, representing, to the best of our knowledge, the first approach to nonmonotonic temporal reasoning with constraints specifically tailored for ASP. This expressive system is achieved by a synergistic combination of two foundational ASP extensions: the linear-time logic of Here-and-There, providing robust nonmonotonic temporal reasoning capabilities, and the logic of Here-and-There with constraints, enabling the direct integration and manipulation of numeric constraints, among others. This work establishes the foundational logical framework for tackling complex dynamic systems with high resolution within the ASP paradigm.
Cite
@article{arxiv.2507.13958,
title = {Towards Constraint Temporal Answer Set Programming},
author = {Pedro Cabalar and Martín Diéguez and François Olivier and Torsten Schaub and Igor Stéphan},
journal= {arXiv preprint arXiv:2507.13958},
year = {2026}
}