1 citations · 1 across the 2 of their papers we have counts for
3 papers
cs.DM2026
Learning Unions of Intersecting Affine Modules in One Dimension with Queries
Eva González, Montserrat Hermo, Anthony Lin
We study the exact learnability of finite unions of intersecting affine modules in one dimension. An affine module is a set of the form , where $a,b…
cs.LO2023
A Correct Algorithm for Identifying Independent Variable Sets in Reactive Systems
Josu Oca, Montserrat Hermo, Alexander Bolotov
Recent work has proposed algorithms for decomposing reactive synthesis specifications into simpler and independent subspecifications. Motivated by the DecomposeContract algorithm i…
cs.LO2022★ 1 cited
On the Complexity of Realizability for Safety LTL and Related Subfragments
Noel Arteche, Montserrat Hermo
We study the realizability problem for Safety LTL, the syntactic fragment of Linear Temporal Logic capturing safe formulas. We show that the problem is EXP-complete, disproving the…