| Publication | Date of Publication | Type |
|---|
| The logic of prefixes and suffixes is elementary under homogeneity | 2026-02-27 | Paper |
| Reactive synthesis for expected impacts | 2025-08-19 | Paper |
| Synthesis of timeline-based planning strategies avoiding determinization | 2025-08-19 | Paper |
| Adding the relation \textit{Meets} to the temporal logic of prefixes and infixes makes it EXPSPACE-complete | 2024-12-06 | Paper |
Predictive mining of multi-temporal relations
Information and Computation | 2024-12-03 | 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 |
| 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 |
An interval temporal logic characterization of extended \(\omega\)-regular languages
Theoretical Computer Science | 2023-06-01 | Paper |
| On a Temporal Logic of Prefixes and Infixes. | 2022-07-18 | Paper |
scientific article; zbMATH DE number 7471713 (Why is no real title available?)
(available as arXiv preprint) | 2022-02-09 | Paper |
| scientific article; zbMATH DE number 7471713 (Why is no real title available?) | 2022-02-09 | Paper |
Reactive synthesis from interval temporal logic specifications
Theoretical Computer Science | 2021-12-22 | Paper |
| Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata | 2021-12-14 | Paper |
Beyond \(\omega BS\)-regular languages: \(\omega T\)-regular expressions and counter-check automata
(available as arXiv preprint) | 2021-12-14 | 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 |
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 |
| Interval-based synthesis | 2021-06-24 | Paper |
Interval-based synthesis
(available as arXiv preprint) | 2021-06-24 | Paper |
Checking sets of pure evolving association rules
Fundamenta Informaticae | 2021-06-04 | Paper |
| Interval temporal logics over strongly discrete linear orders: the complete picture | 2021-04-27 | Paper |
Interval temporal logics over strongly discrete linear orders: the complete picture
(available as arXiv preprint) | 2021-04-27 | Paper |
| An optimal decision procedure for MPNL over the integers | 2021-03-03 | Paper |
An optimal decision procedure for MPNL over the integers
(available as arXiv preprint) | 2021-03-03 | Paper |
| Begin, after, and later: a maximal decidable interval temporal logic | 2021-02-16 | Paper |
| Satisfiability and model checking for the logic of sub-intervals under the homogeneity assumption | 2020-05-27 | Paper |
Beyond -regular languages: T-regular expressions and their automata and logic counterparts
Theoretical Computer Science | 2020-04-21 | Paper |
On coarser interval temporal logics
Artificial Intelligence | 2019-08-28 | 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 |
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 |
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 |
Mining approximate interval-based temporal dependencies
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 |
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 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 |
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 |
Interval-based temporal functional dependencies: specification and verification
Annals of Mathematics and Artificial Intelligence | 2014-07-11 | Paper |
Optimal decision procedures for MPNL over finite structures, the natural numbers, and the integers
Theoretical Computer Science | 2014-01-10 | Paper |
Interval logics and \(\omega B\)-regular languages
Language and Automata Theory and Applications | 2013-03-18 | Paper |
On begins, meets and before
International Journal of Foundations of Computer Science | 2012-08-30 | 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 |
Optimal tableau systems for propositional neighborhood logic over all, dense, and discrete linear orders
Lecture Notes in Computer Science | 2011-07-01 | Paper |
Maximal decidable fragments of Halpern and Shoham's modal logic of intervals
Automata, Languages and Programming | 2010-09-07 | 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 |
A Decidable Spatial Logic with Cone-Shaped Cardinal Directions
Computer Science Logic | 2009-11-12 | Paper |
Optimal Tableaux for Right Propositional Neighborhood Logic over Linear Orders
Logics in Artificial Intelligence | 2008-10-27 | Paper |
Tableau Systems for Logics of Subinterval Structures over Dense Orderings
Lecture Notes in Computer Science | 2008-01-04 | Paper |
An Optimal Tableau-Based Decision Algorithm for Propositional Neighborhood Logic
STACS 2007 | 2007-09-03 | Paper |
A general tableau method for propositional interval temporal logics: theory and implementation
Journal of Applied Logic | 2006-10-10 | Paper |
