Reducing Arbitrary Metric Temporal Formulas into Logic Programs Under Answer Set Semantics
Open Access
- 1 March 2026
- journal article
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (1-2) , 130-146
Abstract
Metric temporal equilibrium logic ( MEL $\textrm {MEL}$ ) extends temporal equilibrium logic ( TEL $\textrm {TEL}$ ) by incorporating quantitative timing constraints, enabling the specification and analysis of deadlines and durations. MEL $\textrm {MEL}$ is particularly suited for domains where time-bound properties are crucial, such as embedded systems, cyber-physical systems, and real-time software. It facilitates the precise expression of timing behaviors, such as the requirement that an event must occur within 5 milliseconds of a trigger, which often elude traditional qualitative temporal logics. In this paper, we present a Tseitin-like translation that maps any metric temporal formula into a logic programming fragment restricted to past operators. This translation provides a formal bridge to leverage existing answer set programming (ASP) solvers for reasoning about metric temporal constraints. By restricting the target fragment to past operators, we enable more effective evaluation and integration with current ASP-based toolchains for multi-shot solving.
Keywords
All Related Versions
This publication has 12 references indexed in Scilit:
- Compiling Metric Temporal Answer Set Programming2024
- Metric Temporal Equilibrium Logic over Timed TracesTheory and Practice of Logic Programming, 2024
- Metric dynamic equilibrium logicJournal of Applied Non-Classical Logics, 2023
- Linear-Time Temporal Answer Set ProgrammingTheory and Practice of Logic Programming, 2021
- telingo = ASP + Time2019
- A Normal Form for Linear Temporal Equilibrium LogicLecture Notes in Computer Science, 2010
- Equilibrium logicAnnals of Mathematics and Artificial Intelligence, 2006
- A new logical characterisation of stable models and answer sets1997
- The declarative past and imperative future1989
- Propositional dynamic logic of regular programsJournal of Computer and System Sciences, 1979