1 citations · 1 across the 5 of their papers we have counts for
6 papers
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…
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…
A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications
Montserrat Hermo, Paqui Lucio, César Sánchez
We introduce a tableau decision method for deciding realizability of specifications expressed in a safety fragment of LTL that includes bounded future temporal operators. Tableau d…
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…
Automatic White-Box Testing of First-Order Logic Ontologies
Javier Álvez, Montserrat Hermo, Paqui Lucio +1
Formal ontologies are axiomatizations in a logic-based formalism. The development of formal ontologies, and their important role in the Semantic Web area, is generating considerabl…
New Steps on the Exact Learning of CNF
Montserrat Hermo, Ana Ozaki
A major problem in computational learning theory is whether the class of formulas in conjunctive normal form (CNF) is efficiently learnable. Although it is known that this class ca…