Montserrat Hermo

According to our database, Montserrat Hermo authored at least 35 papers between 1992 and 2025.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2025

Towards an efficient implementation of a tableau method for reactive safety specifications.

Ander Alonso, Montserrat Hermo, Josu Oca

J. Log. Algebraic Methods Program., 2025

2024

Towards the exact complexity of realizability for Safety LTL.

Noel Arteche, Montserrat Hermo

J. Log. Algebraic Methods Program., 2024

A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification.

Josu Oca, Montserrat Hermo, Alexander Bolotov

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2024

2023

Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models.

Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio

J. Log. Algebraic Methods Program., 2023

Revisiting the specification decomposition for synthesis based on LTL solvers.

Josu Oca, Montserrat Hermo, Alexander Bolotov

CoRR, 2023

Tableaux for Realizability of Safety Specifications.

Montserrat Hermo, Paqui Lucio, César Sánchez

Proceedings of the Formal Methods - 25th International Symposium, 2023

2022

A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications.

Montserrat Hermo, Paqui Lucio, César Sánchez

CoRR, 2022

2021

Verified Model Checking for Conjunctive Positive Logic.

Alex Abuin, Unai Díaz-de-Cerio, Montserrat Hermo, Paqui Lucio

SN Comput. Sci., 2021

2020

Exact Learning: On the Boundary between Horn and CNF.

Montserrat Hermo, Ana Ozaki

ACM Trans. Comput. Theory, 2020

Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+.

Alexander Bolotov, Montserrat Hermo, Paqui Lucio

Theor. Comput. Sci., 2020

One-Pass Context-Based Tableaux Systems for CTL and ECTL.

Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio

Proceedings of the 27th International Symposium on Temporal Representation and Reasoning, 2020

2019

Automatic white-box testing of first-order logic ontologies.

Javier Álvez, Montserrat Hermo, Paqui Lucio, German Rigau

J. Log. Comput., 2019

Towards Certified Model Checking for PLTL Using One-Pass Tableaux.

Alex Abuin, Alexander Bolotov, Unai Díaz-de-Cerio, Montserrat Hermo, Paqui Lucio

Proceedings of the 26th International Symposium on Temporal Representation and Reasoning, 2019

2018

Exact learning of multivalued dependency formulas.

Montserrat Hermo, Ana Ozaki

Theor. Comput. Sci., 2018

Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach.

Alexander Bolotov, Montserrat Hermo, Paqui Lucio

Proceedings of the 25th International Symposium on Temporal Representation and Reasoning, 2018

2016

New Steps on the Exact Learning of CNF.

Montserrat Hermo, Ana Ozaki

CoRR, 2016

2015

Exact Learning of Multivalued Dependencies.

Montserrat Hermo, Ana Ozaki

Proceedings of the Algorithmic Learning Theory - 26th International Conference, 2015

2013

Invariant-Free Clausal Temporal Resolution.

Jose Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas

J. Autom. Reason., 2013

2011

Negative results on learning multivalued dependencies with queries.

Víctor Lavín Puente, Montserrat Hermo

Inf. Process. Lett., 2011

2010

Translating propositional extended conjunctions of Horn clauses into Boolean circuits.

Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro

Theor. Comput. Sci., 2010

2009

Dual Systems of Tableaux and Sequents for PLTL.

Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas

J. Log. Algebraic Methods Program., 2009

2008

A Learning Algorithm for Deterministic Finite Automata using JFLAP.

Mikel Alecha, Montserrat Hermo

Proceedings of the Eighth Spanish Conference on Programming and Computer Languages, 2008

2007

Systematic Semantic Tableaux for PLTL.

Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro

Proceedings of the Seventh Spanish Conference on Programming and Computer Languages, 2007

A Cut-Free and Invariant-Free Sequent Calculus for PLTL.

Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas

Proceedings of the Computer Science Logic, 21st International Workshop, 2007

2005

Goals in the Propositional Horn Language Are Monotone Boolean Circuits.

Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro

Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

2002

Negative Results on Learning Dependencies with Queries.

Montserrat Hermo, Víctor Lavín

Proceedings of the International Symposium on Artificial Intelligence and Mathematics, 2002

1999

Learning Minimal Covers of Functional Dependencies with Queries.

Montserrat Hermo, Víctor Lavín

Proceedings of the Algorithmic Learning Theory, 10th International Conference, 1999

1998

The Structure of Logarithmic Advice Complexity Classes.

José L. Balcázar, Montserrat Hermo

Theor. Comput. Sci., 1998

1997

Compressibility and Uniform Complexity.

Montserrat Hermo

Inf. Process. Lett., 1997

1996

Nonuniform complexity classes with sub-linear advice functions.

Montserrat Hermo Huguet

PhD thesis, 1996

1995

On the Sparse Set Conjecture for Sets with Low Denisty.

Harry Buhrman, Montserrat Hermo

Proceedings of the STACS 95, 1995

Learnability of Kolmogorov-easy circuit expressions via queries.

José L. Balcázar, Harry Buhrman, Montserrat Hermo

Proceedings of the Computational Learning Theory, Second European Conference, 1995

1994

A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity.

Montserrat Hermo, Elvira Mayordomo

Math. Syst. Theory, 1994

Degrees and Reducibilities of Easy Tally Sets.

Montserrat Hermo

Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

1992

Characterizations of Logarithmic Advice Complexity Classes.

José L. Balcázar, Montserrat Hermo, Elvira Mayordomo

Proceedings of the Algorithms, Software, Architecture, 1992