Martín Diéguez
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Martín Diéguez has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- David Fernández-Duque
University of Barcelona
15 shared publications - Torsten Schaub
Universität Potsdam
10 shared publications - Pedro Cabalar
University of A Coruña
9 shared publications - Brett McLean
Ghent University
6 shared publications - Juan Pablo Aguilera
Institute of Discrete Mathematics and Geometry Vienna University of Technology Vienna Austria
4 shared publications - Philippe Balbiani
Toulouse Institute of Computer Science Research CNRS INPT-UT3 Toulouse France
4 shared publications
Latest Publications
- Open Access
- 10 October 2026
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
Constructive S4 modal logics with the finite birelational frame property
The logics \(\mathsf {CS4} \) and \(\mathsf {IS4} \) are the two leading intuitionistic variants of the modal logic \(\mathsf {S4} \) . Whether the finite model property holds for each of these logics have been long-standing open problems. In this paper, we resolve the first of these problems, proving that \(\mathsf {CS4} \) has the finite frame property. Additionally, we investigate the following three logics closely related to \(\mathsf {IS4} \) . The logic \(\mathsf {GS4} \) is obtained by adding the Gödel–Dummett axiom to \(\mathsf {IS4} \) ; it is both a superintuitionistic and a fuzzy logic and has previously been given a real-valued semantics. We provide an alternative birelational semantics and prove strong completeness with respect to this semantics. The extension \(\mathsf {GS4}^c \) of \(\mathsf {GS4} \) corresponds to requiring a crisp accessibility relation on the real-valued semantics. We give \(\mathsf {GS4}^c \) a birelational semantics corresponding to an extra confluence condition on the \(\mathsf {GS4} \) birelational semantics and prove strong completeness. Neither of these two logics have the finite model property with respect to their real-valued semantics, but we prove that they have the finite frame property with respect to their birelational semantics. Establishing the finite birelational frame property immediately establishes decidability, which was previously open for these two logics. Our proofs yield coNEXPTIME upper bounds for \(\mathsf {CS4} \) , \(\mathsf {GS4} \) , and \(\mathsf {GS4}^c \) . The logic \(\mathsf {S4I} \) is obtained from \(\mathsf {IS4} \) by reversing the roles of the modal and intuitionistic relations in the birelational semantics. We also prove the finite frame property, and thereby decidability, for \(\mathsf {S4I} \) , although our proof does not yield an elementary complexity bound. In summary, we prove that \(\mathsf {CS4} \) , \(\mathsf {GS4} \) , \(\mathsf {GS4}^c \) , and \(\mathsf {S4I} \) all have the finite birelational frame property, with the first three having a coNEXPTIME validity problem.- 10 October 2026
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
Open AccessConstructive S4 modal logics with the finite birelational frame property
The logics \(\mathsf {CS4} \) and \(\mathsf {IS4} \) are the two leading intuitionistic variants of the modal logic \(\mathsf {S4} \) . Whether the finite model property holds for each of these logics have been long-standing open problems. In this paper, we resolve the first of these problems, proving that \(\mathsf {CS4} \) has the finite frame property. Additionally, we investigate the following three logics closely related to \(\mathsf {IS4} \) . The logic \(\mathsf {GS4} \) is obtained by adding the Gödel–Dummett axiom to \(\mathsf {IS4} \) ; it is both a superintuitionistic and a fuzzy logic and has previously been given a real-valued semantics. We provide an alternative birelational semantics and prove strong completeness with respect to this semantics. The extension \(\mathsf {GS4}^c \) of \(\mathsf {GS4} \) corresponds to requiring a crisp accessibility relation on the real-valued semantics. We give \(\mathsf {GS4}^c \) a birelational semantics corresponding to an extra confluence condition on the \(\mathsf {GS4} \) birelational semantics and prove strong completeness. Neither of these two logics have the finite model property with respect to their real-valued semantics, but we prove that they have the finite frame property with respect to their birelational semantics. Establishing the finite birelational frame property immediately establishes decidability, which was previously open for these two logics. Our proofs yield coNEXPTIME upper bounds for \(\mathsf {CS4} \) , \(\mathsf {GS4} \) , and \(\mathsf {GS4}^c \) . The logic \(\mathsf {S4I} \) is obtained from \(\mathsf {IS4} \) by reversing the roles of the modal and intuitionistic relations in the birelational semantics. We also prove the finite frame property, and thereby decidability, for \(\mathsf {S4I} \) , although our proof does not yield an elementary complexity bound. In summary, we prove that \(\mathsf {CS4} \) , \(\mathsf {GS4} \) , \(\mathsf {GS4}^c \) , and \(\mathsf {S4I} \) all have the finite birelational frame property, with the first three having a coNEXPTIME validity problem. - Open Access
- 1 May 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (3-4) , 553-618
Implementing Metric Temporal Answer Set Programming
We develop a computational approach to Metric Answer Set Programming (ASP) to express quantitative temporal constrains, such as durations and deadlines. We investigate two specific fragments: plain metric logic programs, restricted to local temporal constraints, and general metric logic programs, which allow for arbitrary metric formulas. A central challenge in this context is maintaining scalability when dealing with fine-grained timing constraints, which can significantly exacerbate grounding bottleneck of ASP. To address this issue, we propose translations of both fragments into standard ASP and ASP extended with difference constraints, a simplified form of linear constraints, and prove their correctness and completeness. Our implementation, realized via meta-encodings, effectively decouples metric ASP from the granularity of time, resulting in a solution that is independent of time precision.
- 1 May 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (3-4) , 553-618
Open AccessImplementing Metric Temporal Answer Set Programming
We develop a computational approach to Metric Answer Set Programming (ASP) to express quantitative temporal constrains, such as durations and deadlines. We investigate two specific fragments: plain metric logic programs, restricted to local temporal constraints, and general metric logic programs, which allow for arbitrary metric formulas. A central challenge in this context is maintaining scalability when dealing with fine-grained timing constraints, which can significantly exacerbate grounding bottleneck of ASP. To address this issue, we propose translations of both fragments into standard ASP and ASP extended with difference constraints, a simplified form of linear constraints, and prove their correctness and completeness. Our implementation, realized via meta-encodings, effectively decouples metric ASP from the granularity of time, resulting in a solution that is independent of time precision.
- Open Access
- 1 May 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (3-4) , 458-486
Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming
The relationship between intuitionistic or intermediate logics and logic programming has been extensively studied, prominently featuring Pearce’s equilibrium logic and Osorio’s safe beliefs. Equilibrium logic admits a fixpoint characterization based on the logic of here-and-there, akin to theory completion in default and autoepistemic logics. Safe beliefs are similarly defined via a fixpoint operator, albeit under the semantics of intuitionistic or other intermediate logics. In this paper, we investigate the logical foundations of Temporal Answer Set Programming through the lens of Temporal Equilibrium Logic, a formalism combining equilibrium logic with linear-time temporal operators. We lift the seminal approaches of Pearce and Osorio to the temporal setting, establishing a formal correspondence between temporal intuitionistic logic and temporal logic programming. Our results deepen the theoretical underpinnings of Temporal Answer Set Programming and provide new avenues for research in temporal reasoning.
- 1 May 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (3-4) , 458-486
Open AccessApplications of Intuitionistic Temporal Logic to Temporal Answer Set Programming
The relationship between intuitionistic or intermediate logics and logic programming has been extensively studied, prominently featuring Pearce’s equilibrium logic and Osorio’s safe beliefs. Equilibrium logic admits a fixpoint characterization based on the logic of here-and-there, akin to theory completion in default and autoepistemic logics. Safe beliefs are similarly defined via a fixpoint operator, albeit under the semantics of intuitionistic or other intermediate logics. In this paper, we investigate the logical foundations of Temporal Answer Set Programming through the lens of Temporal Equilibrium Logic, a formalism combining equilibrium logic with linear-time temporal operators. We lift the seminal approaches of Pearce and Osorio to the temporal setting, establishing a formal correspondence between temporal intuitionistic logic and temporal logic programming. Our results deepen the theoretical underpinnings of Temporal Answer Set Programming and provide new avenues for research in temporal reasoning.
- Open Access
- 1 March 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (1-2) , 130-146
Reducing Arbitrary Metric Temporal Formulas into Logic Programs Under Answer Set Semantics
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.- 1 March 2026
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 26 (1-2) , 130-146
Open AccessReducing Arbitrary Metric Temporal Formulas into Logic Programs Under Answer Set Semantics
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. - Open Access
Common Knowledge Always, Forever
There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-reference. We introduce a polytopological PDL capable of expressing common knowledge and various generalizations and show it has the finite model property over closure spaces but not over Cantor derivative spaces. The latter is shown by embedding a version of linear temporal logic with `past', which does not have the finite model property.
Open AccessCommon Knowledge Always, Forever
There has been an increasing interest in topological semantics for epistemic logic, which has been shown to be useful for, e.g., modelling evidence, degrees of belief, and self-reference. We introduce a polytopological PDL capable of expressing common knowledge and various generalizations and show it has the finite model property over closure spaces but not over Cantor derivative spaces. The latter is shown by embedding a version of linear temporal logic with `past', which does not have the finite model property.
- Open Access
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 224-237
Extracting Policies from Quantified Answer Set Programs
Quantified Answer Set Programming (QASP) extends Answer Set Programming (ASP) by allowing quantification over propositional variables, similar to Quantified Boolean Formulas (QBF). In this paper, we interpret models of QASP formulas in terms of policies, which represent decision-making strategies that determine how existentially quantified variables should be assigned, given the conditions set by universally quantified variables. As a main contribution, we present an algorithm for policy extraction under QASP semantics, inspired by the Equilibrium Logic semantics for general ASP theories.
- 8 January 2026
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 439, 224-237
Open AccessExtracting Policies from Quantified Answer Set Programs
Quantified Answer Set Programming (QASP) extends Answer Set Programming (ASP) by allowing quantification over propositional variables, similar to Quantified Boolean Formulas (QBF). In this paper, we interpret models of QASP formulas in terms of policies, which represent decision-making strategies that determine how existentially quantified variables should be assigned, given the conditions set by universally quantified variables. As a main contribution, we present an algorithm for policy extraction under QASP semantics, inspired by the Equilibrium Logic semantics for general ASP theories.
- Open Access
- 1 July 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (4) , 579-594
Towards Constraint Temporal Answer Set Programming
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.
- 1 July 2025
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 25 (4) , 579-594
Open AccessTowards Constraint Temporal Answer Set Programming
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.
- 18 October 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 338
Gödel–Dummett linear temporal logic
- 18 October 2024
- Published by Elsevier in Artificial Intelligence
- Vol. 338
Gödel–Dummett linear temporal logic
- 9 October 2024
- Published by Springer Nature
- p. 304-316
A Fixpoint Characterisation of Temporal Equilibrium Logic
- 9 October 2024
- Published by Springer Nature
- p. 304-316
A Fixpoint Characterisation of Temporal Equilibrium Logic
- Open Access
- 1 May 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (3) , 425-452
Metric Temporal Equilibrium Logic over Timed Traces
In temporal extensions of answer set programming (ASP) based on linear time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. However, timing constraints are important in many applications like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. The resulting Metric Equilibrium Logic (MEL) provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in MEL and Monadic Quantified Equilibrium Logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.
- 1 May 2024
- Published by Cambridge University Press (CUP) in Theory and Practice of Logic Programming
- Vol. 24 (3) , 425-452
Open AccessMetric Temporal Equilibrium Logic over Timed Traces
In temporal extensions of answer set programming (ASP) based on linear time, the behavior of dynamic systems is captured by sequences of states. While this representation reflects their relative order, it abstracts away the specific times associated with each state. However, timing constraints are important in many applications like, for instance, when planning and scheduling go hand in hand. We address this by developing a metric extension of linear-time temporal equilibrium logic, in which temporal operators are constrained by intervals over natural numbers. The resulting Metric Equilibrium Logic (MEL) provides the foundation of an ASP-based approach for specifying qualitative and quantitative dynamic constraints. To this end, we define a translation of metric formulas into monadic first-order formulas and give a correspondence between their models in MEL and Monadic Quantified Equilibrium Logic, respectively. Interestingly, our translation provides a blue print for implementation in terms of ASP modulo difference constraints.