| Publication | Date of Publication | Type |
|---|
An optimal pastification algorithm for \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{F} \rbrack\) and \(\mathsf{LTL} \lbrack \mathsf{X}, \mathsf{G} \rbrack \)
Artificial Intelligence | 2026-07-24 | Paper |
| On cascades of reset automata | 2026-06-24 | Paper |
| The logic of prefixes and suffixes is elementary under homogeneity | 2026-02-27 | Paper |
| Synthesis of timeline-based planning strategies avoiding determinization | 2025-08-19 | Paper |
Succinctness issues for \(\textsf{LTL}_{\textsf{f}}\) and safety and cosafety fragments of \textsf{LTL}
Information and Computation | 2025-01-31 | Paper |
Extended bounded response LTL: a new safety fragment for efficient reactive synthesis
Formal Methods in System Design | 2025-01-13 | Paper |
| Expressiveness of extended bounded response \textsf{LTL} | 2024-12-06 | Paper |
| Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete | 2024-12-06 | Paper |
| Succinctness of cosafety fragments of LTL via combinatorial proof systems | 2024-10-30 | Paper |
SAT meets tableaux for linear temporal logic satisfiability
Journal of Automated Reasoning | 2024-09-27 | Paper |
Controller synthesis for timeline-based games
Logical Methods in Computer Science | 2024-09-04 | Paper |
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals \textsc{ExpSpace-complete}
Logical Methods in Computer Science | 2024-06-27 | Paper |
Controller synthesis for timeline-based games
(available as arXiv preprint) | 2024-02-08 | Paper |
| Controller synthesis for timeline-based games | 2024-02-08 | Paper |
A first-order logic characterisation of safety and co-safety languages
Lecture Notes in Computer Science | 2024-01-23 | Paper |
| Complexity of qualitative timeline-based planning | 2023-11-02 | Paper |
| Past Matters: Supporting LTL+Past in the BLACK Satisfiability Checker | 2023-10-02 | Paper |
| Pspace-Completeness of the Temporal Logic of Sub-Intervals and Suffixes | 2023-10-02 | Paper |
\textsc{Pspace}-completeness of the temporal logic of sub-intervals and suffixes
Information and Computation | 2023-09-27 | Paper |
A first-order logic characterization of safety and co-safety languages
Logical Methods in Computer Science | 2023-08-26 | Paper |
Interval Temporal Logic for Visibly Pushdown Systems
ACM Transactions on Computational Logic | 2023-07-18 | Paper |
An interval temporal logic characterization of extended \(\omega\)-regular languages
Theoretical Computer Science | 2023-06-01 | Paper |
Fairness, assumptions, and guarantees for extended bounded response \textsf{LTL+P} synthesis
Software Engineering and Formal Methods | 2023-05-26 | Paper |
| scientific article; zbMATH DE number 7650330 (Why is no real title available?) | 2023-02-03 | Paper |
| Taming the complexity of timeline-based planning over dense temporal domains | 2023-02-03 | Paper |
Evaluation of temporal datasets via interval temporal logic model checking
1515.68109 | 2023-02-03 | Paper |
| Complexity analysis of a unifying algorithm for model checking interval temporal logic | 2023-02-03 | Paper |
\(\mathsf{GR}(1)\) is equivalent to \(\mathsf{R}(1)\)
Information Processing Letters | 2022-10-28 | Paper |
Completeness results for two-sorted metric temporal logics
Algebraic Methodology and Software Technology | 2022-08-16 | Paper |
| On a Temporal Logic of Prefixes and Infixes. | 2022-07-18 | Paper |
A game-theoretic approach to timeline-based planning with uncertainty
(available as arXiv preprint) | 2022-05-28 | Paper |
Decidability and complexity of action-based temporal planning over dense time
Artificial Intelligence | 2022-04-11 | Paper |
Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption
(available as arXiv preprint) | 2022-02-09 | Paper |
| Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption | 2022-02-09 | Paper |
Complexity issues for timeline-based planning over dense time under future and minimal semantics
Theoretical Computer Science | 2022-01-18 | Paper |
Reactive synthesis from interval temporal logic specifications
Theoretical Computer Science | 2021-12-22 | Paper |
One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\)
(available as arXiv preprint) | 2021-12-17 | Paper |
| One-pass and tree-shaped tableau systems for \(\mathrm{TPTL}\) and \(\mathrm{TPTL}_b+\mathrm{Past}\) | 2021-12-17 | Paper |
Complexity of timeline-based planning over dense temporal domains: exploring the middle ground
(available as arXiv preprint) | 2021-12-17 | Paper |
| Complexity of timeline-based planning over dense temporal domains: exploring the middle ground | 2021-12-17 | Paper |
On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions
(available as arXiv preprint) | 2021-12-14 | Paper |
| On the complexity of model checking for syntactically maximal fragments of the interval temporal logic HS with regular expressions | 2021-12-14 | Paper |
Beyond BS-regular languages: T-regular expressions and counter-check automata
(available as arXiv preprint) | 2021-12-14 | Paper |
| Beyond BS-regular languages: T-regular expressions and counter-check automata | 2021-12-14 | Paper |
Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete
(available as arXiv preprint) | 2021-12-07 | Paper |
| Model checking the logic of Allen's relations \textit{Meets} and \textit{Started-by} is \(\mathbf{P}^{\mathbf{NP}}\)-complete | 2021-12-07 | Paper |
Complexity analysis of a unifying algorithm for model checking interval temporal logic
Information and Computation | 2021-09-21 | Paper |
Interval-based synthesis
(available as arXiv preprint) | 2021-06-24 | Paper |
| Interval-based synthesis | 2021-06-24 | Paper |
One-pass and tree-shaped tableau systems for TPTL and \(\mathrm{TPTL_b+Past}\)
Information and Computation | 2021-06-03 | Paper |
Interval temporal logics over strongly discrete linear orders: the complete picture
(available as arXiv preprint) | 2021-04-27 | Paper |
| Interval temporal logics over strongly discrete linear orders: the complete picture | 2021-04-27 | Paper |
An optimal decision procedure for MPNL over the integers
(available as arXiv preprint) | 2021-03-03 | Paper |
| An optimal decision procedure for MPNL over the integers | 2021-03-03 | Paper |
| Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption | 2020-05-27 | Paper |
Model checking interval temporal logics with regular expressions
Information and Computation | 2020-05-26 | Paper |
| A SAT-based encoding of the one-pass and tree-shaped tableau system for LTL | 2020-05-14 | Paper |
Beyond -regular languages: T-regular expressions and their automata and logic counterparts
Theoretical Computer Science | 2020-04-21 | Paper |
Timeline-based planning over dense temporal domains
Theoretical Computer Science | 2020-04-21 | Paper |
On timeline-based games and their complexity
Theoretical Computer Science | 2020-04-06 | Paper |
An in-depth investigation of interval temporal logic model checking with regular expressions
Software Engineering and Formal Methods | 2019-09-16 | Paper |
Decidability and complexity of the fragments of the modal logic of Allen's relations over the rationals
Information and Computation | 2019-05-02 | Paper |
Which fragments of the interval temporal logic HS are tractable in model checking?
Theoretical Computer Science | 2019-03-13 | Paper |
Interval vs. point temporal logic model checking. An expressiveness comparison
ACM Transactions on Computational Logic | 2019-02-07 | Paper |
A one-pass tree-shaped tableau for LTL+past
EPiC Series in Computing | 2019-01-10 | Paper |
Model checking for fragments of the interval temporal logic HS at the low levels of the polynomial time hierarchy
Information and Computation | 2018-09-27 | Paper |
Interval vs. Point Temporal Logic Model Checking: an Expressiveness Comparison
(available as arXiv preprint) | 2018-04-19 | Paper |
Model checking for fragments of Halpern and Shoham's interval temporal logic based on track representatives
Information and Computation | 2018-03-21 | Paper |
A set-theoretic translation method for (poly)modal logics
STACS 95 | 2017-12-04 | Paper |
| scientific article; zbMATH DE number 6767596 (Why is no real title available?) | 2017-08-31 | Paper |
Adding an equivalence relation to the interval logic \(AB\bar{B}\): complexity and expressiveness
2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science | 2017-07-03 | Paper |
Prompt interval temporal logic
Logics in Artificial Intelligence | 2016-11-30 | Paper |
Checking interval properties of computations
Acta Informatica | 2016-10-21 | Paper |
Metric propositional neighborhood logic with an equivalence relation
Acta Informatica | 2016-10-21 | Paper |
Interval temporal logic model checking: the border between good and bad HS fragments
Automated Reasoning | 2016-09-05 | Paper |
Undecidability of the logic of overlap relation over discrete linear orderings
Electronic Notes in Theoretical Computer Science | 2016-08-05 | Paper |
| Constraining cycle alternations in model checking for interval temporal logic | 2016-08-05 | Paper |
| scientific article; zbMATH DE number 6602207 (Why is no real title available?) | 2016-07-08 | Paper |
Adding one or more equivalence relations to the interval temporal logic \(\mathsf{AB}\overline{\mathsf{B}}\)
Theoretical Computer Science | 2016-05-27 | Paper |
On the complexity of fragments of the modal logic of Allen's relations over dense structures
Language and Automata Theory and Applications | 2016-04-08 | Paper |
A complete classification of the expressiveness of interval logics of Allen's relations: the general and the dense cases
Acta Informatica | 2016-04-07 | Paper |
A decidable weakening of compass logic based on cone-shaped cardinal directions
Logical Methods in Computer Science | 2016-01-07 | Paper |
| Interval temporal logics over finite linear orders: the complete picture | 2015-12-11 | Paper |
A graph-theoretic approach to map conceptual designs to XML schemas
ACM Transactions on Database Systems | 2015-09-03 | Paper |
On the expressiveness of the interval logic of Allen's relations over finite and discrete linear orders
Logics in Artificial Intelligence | 2015-01-14 | Paper |
Interval temporal logics over strongly discrete linear orders: expressiveness and complexity
Theoretical Computer Science | 2014-12-02 | Paper |
Decidability of the interval temporal logic \(\mathsf{A}\bar{\mathsf{A}}\mathsf{B}\bar{\mathsf{B}}\) over the rationals
Mathematical Foundations of Computer Science 2014 | 2014-10-14 | Paper |
The light side of interval temporal logic: the Bernays-Schönfinkel fragment of CDT
Annals of Mathematics and Artificial Intelligence | 2014-07-11 | Paper |
The dark side of interval temporal logic: marking the undecidability border
Annals of Mathematics and Artificial Intelligence | 2014-07-11 | Paper |
An algorithm for enumerating maximal models of Horn theories with an application to modal logics
Logic for Programming, Artificial Intelligence, and Reasoning | 2014-01-17 | Paper |
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
Theoretical Computer Science | 2014-01-10 | Paper |
A tableau system for right propositional neighborhood logic over finite linear orders: an implementation
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Interval logics and B-regular languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
| scientific article; zbMATH DE number 6131597 (Why is no real title available?) | 2013-01-28 | Paper |
The importance of the past in interval temporal logics: the case of propositional neighborhood logic
Logic Programs, Norms and Action | 2012-07-23 | Paper |
| Decidability of the interval temporal logic \(\operatorname{AB\overline{B}}\) over the natural numbers | 2012-01-23 | Paper |
Propositional interval neighborhood logics: expressiveness, decidability, and undecidable extensions
Annals of Pure and Applied Logic | 2011-08-26 | Paper |
Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders
Lecture Notes in Computer Science | 2011-07-01 | Paper |
| Metric propositional neighborhood logics: expressiveness, decidability, and undecidability | 2011-05-11 | Paper |
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Automata, Languages and Programming | 2010-09-07 | Paper |
Binary extensions of S1S and the composition method
Lecture Notes in Computer Science | 2010-03-23 | Paper |
A general tableau method for propositional interval temporal logics
Lecture Notes in Computer Science | 2010-03-09 | Paper |
Towards compact and tractable automaton-based representations of time granularities.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Tableaux for logics of subinterval structures over dense orderings
Journal Of Logic And Computation | 2010-02-19 | Paper |
A tableau-based system for spatial reasoning about directional relations
Lecture Notes in Computer Science | 2009-12-01 | Paper |
On the relationships between theories of time granularity and the monadic second-order theory of one successor
Journal of Applied Non-Classical Logics | 2009-11-30 | Paper |
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
Computer Science Logic | 2009-11-12 | Paper |
A Road Map of Interval Temporal Logics and Duration Calculi
Journal of Applied Non-Classical Logics | 2009-11-11 | Paper |
A Road Map of Interval Temporal Logics and Duration Calculi
Journal of Applied Non-Classical Logics | 2009-11-11 | Paper |
A theory of ultimately periodic languages and automata with an application to time granularity
Acta Informatica | 2009-10-02 | Paper |
