Characterizations of Logarithmic Advice Complexity Classes. - José L. Balcázar; Montserrat Hermo; Elvira Mayordomo (IFIP Congress (1), 1992)

Degrees and Reducibilities of Easy Tally Sets. - Montserrat Hermo (MFCS, 1994)

A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity. - Montserrat Hermo; Elvira Mayordomo (Math. Syst. Theory, 1994)

Learnability of Kolmogorov-easy circuit expressions via queries. - José L. Balcázar; Harry Buhrman; Montserrat Hermo (EuroCOLT, 1995)

On the Sparse Set Conjecture for Sets with Low Denisty. - Harry Buhrman; Montserrat Hermo (STACS, 1995)

Nonuniform complexity classes with sub-linear advice functions. - Montserrat Hermo Huguet (1996)

Compressibility and Uniform Complexity. - Montserrat Hermo (Inf. Process. Lett., 1997)

The Structure of Logarithmic Advice Complexity Classes. - José L. Balcázar; Montserrat Hermo (Theor. Comput. Sci., 1998)

Learning Minimal Covers of Functional Dependencies with Queries. - Montserrat Hermo; Víctor Lavín (ALT, 1999)

Negative Results on Learning Dependencies with Queries. - Montserrat Hermo; Víctor Lavín (AI&M, 2002)

Goals in the Propositional Horn Language Are Monotone Boolean Circuits. - Joxe Gaintzarain; Montserrat Hermo; Marisa Navarro (MFCS, 2005)

A Cut-Free and Invariant-Free Sequent Calculus for PLTL. - Joxe Gaintzarain; Montserrat Hermo; Paqui Lucio; Marisa Navarro; Fernando Orejas (CSL, 2007)

Systematic Semantic Tableaux for PLTL. - Joxe Gaintzarain; Montserrat Hermo; Paqui Lucio; Marisa Navarro (PROLE, 2007)

A Learning Algorithm for Deterministic Finite Automata using JFLAP. - Mikel Alecha; Montserrat Hermo (PROLE, 2008)

Dual Systems of Tableaux and Sequents for PLTL. - Joxe Gaintzarain; Montserrat Hermo; Paqui Lucio; Marisa Navarro; Fernando Orejas (J. Log. Algebraic Methods Program., 2009)

Translating propositional extended conjunctions of Horn clauses into Boolean circuits. - Joxe Gaintzarain; Montserrat Hermo; Paqui Lucio; Marisa Navarro (Theor. Comput. Sci., 2010)

Negative results on learning multivalued dependencies with queries. - Víctor Lavín Puente; Montserrat Hermo (Inf. Process. Lett., 2011)

Invariant-Free Clausal Temporal Resolution. - Jose Gaintzarain; Montserrat Hermo; Paqui Lucio; Marisa Navarro; Fernando Orejas (J. Autom. Reason., 2013)

Exact Learning of Multivalued Dependencies. - Montserrat Hermo; Ana Ozaki (ALT, 2015)

New Steps on the Exact Learning of CNF. - Montserrat Hermo; Ana Ozaki (CoRR, 2016)

Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. - Alexander Bolotov; Montserrat Hermo; Paqui Lucio (TIME, 2018)

Exact learning of multivalued dependency formulas. - Montserrat Hermo; Ana Ozaki (Theor. Comput. Sci., 2018)

Towards Certified Model Checking for PLTL Using One-Pass Tableaux. - Alex Abuin; Alexander Bolotov; Unai Díaz-de-Cerio; Montserrat Hermo; Paqui Lucio (TIME, 2019)

Automatic white-box testing of first-order logic ontologies. - Javier Álvez; Montserrat Hermo; Paqui Lucio; German Rigau (J. Log. Comput., 2019)

One-Pass Context-Based Tableaux Systems for CTL and ECTL. - Alex Abuin; Alexander Bolotov; Montserrat Hermo; Paqui Lucio (TIME, 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)

Exact Learning: On the Boundary between Horn and CNF. - Montserrat Hermo; Ana Ozaki (ACM Trans. Comput. Theory, 2020)

Verified Model Checking for Conjunctive Positive Logic. - Alex Abuin; Unai Díaz-de-Cerio; Montserrat Hermo; Paqui Lucio (SN Comput. Sci., 2021)

A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications. - Montserrat Hermo; Paqui Lucio; César Sánchez 001 (CoRR, 2022)

Tableaux for Realizability of Safety Specifications. - Montserrat Hermo; Paqui Lucio; César Sánchez 001 (FM, 2023)

Revisiting the specification decomposition for synthesis based on LTL solvers. - Josu Oca; Montserrat Hermo; Alexander Bolotov (CoRR, 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)

A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification. - Josu Oca; Montserrat Hermo; Alexander Bolotov (DATE, 2024)

Towards the exact complexity of realizability for Safety LTL. - Noel Arteche; Montserrat Hermo (J. Log. Algebraic Methods Program., 2024)

Towards an efficient implementation of a tableau method for reactive safety specifications. - Ander Alonso; Montserrat Hermo; Josu Oca (J. Log. Algebraic Methods Program., 2025)