Year: 2026
Type: article
Abstract: The development of temporal extensions of Answer Set Programming (ASP) has led to the emergence of non-monotonic linear-time ( TEL TEL $\textrm {TEL}$ ), dynamic ( DEL DEL $\textrm {DEL}$ ), and metric ( MEL MEL $\textrm {MEL}$ ) temporal equilibrium logics. However, the inherent rigidity of highly optimized ASP systems often hinders the rapid exploration and implementation of alternative logical designs. In this work, we propose a flexible meta-programming framework that operationalizes the semantics of varied temporal logics through a unified, declarative framework. Our approach extends standard ASP meta-programming by augmenting clingo ’s theory grammar with formal type specifications and nesting capabilities. To ensure semantic correctness, we introduce a transformation pipeline that protects nested modalities from stable-model-based simplifications during grounding. We demonstrate the extensibility of our framework by implementing meta-encodings for TEL TEL $\textrm {TEL}$ , MEL MEL $\textrm {MEL}$ , and DEL DEL $\textrm {DEL}$ . We provide a comprehensive account of TEL TEL $\textrm {TEL}$ and highlight the key features for managing the interval constraints of MEL MEL $\textrm {MEL}$ and the Fischer–Ladner closure in
Institution: University of Potsdam
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: hybrid
Estimated APC paid: $3,550
Award: G8959074978
OpenAlex ID: W7171844516