Montserrat Hermo

Publication Activity (10 Years)

Years Active: 1992-2024
Publications (10 Years): 17

Top Topics

Dependent Variables

Multivalued Dependencies

Membership And Equivalence Queries

Top Venues

J. Log. Algebraic Methods Program.

Theor. Comput. Sci.

Publications

Noel Arteche, Montserrat Hermo
Towards the exact complexity of realizability for Safety LTL. J. Log. Algebraic Methods Program. 141 (2024)
Josu Oca, Montserrat Hermo, Alexander Bolotov
A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification. DATE (2024)
Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models. J. Log. Algebraic Methods Program. 130 (2023)
Montserrat Hermo, Paqui Lucio, César Sánchez
Tableaux for Realizability of Safety Specifications. FM (2023)
Josu Oca, Montserrat Hermo, Alexander Bolotov
Revisiting the specification decomposition for synthesis based on LTL solvers. CoRR (2023)
Montserrat Hermo, Paqui Lucio, César Sánchez
A Tableau Method for the Realizability and Synthesis of Reactive Safety Specifications. CoRR (2022)
Alex Abuin, Unai Díaz-de-Cerio, Montserrat Hermo, Paqui Lucio
Verified Model Checking for Conjunctive Positive Logic. SN Comput. Sci. 2 (5) (2021)
Noel Arteche, Montserrat Hermo
On the Complexity of Realizability for Safety LTL and Related Subfragments. CoRR (2021)
Alexander Bolotov, Montserrat Hermo, Paqui Lucio
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+. Theor. Comput. Sci. 813 (2020)
Montserrat Hermo, Ana Ozaki
Exact Learning: On the Boundary between Horn and CNF. ACM Trans. Comput. Theory 12 (1) (2020)
Alex Abuin, Alexander Bolotov, Montserrat Hermo, Paqui Lucio
One-Pass Context-Based Tableaux Systems for CTL and ECTL. TIME (2020)
Javier Álvez, Montserrat Hermo, Paqui Lucio, German Rigau
Automatic white-box testing of first-order logic ontologies. J. Log. Comput. 29 (5) (2019)
Alex Abuin, Alexander Bolotov, Unai Díaz-de-Cerio, Montserrat Hermo, Paqui Lucio
Towards Certified Model Checking for PLTL Using One-Pass Tableaux. TIME (2019)
Montserrat Hermo, Ana Ozaki
Exact learning of multivalued dependency formulas. Theor. Comput. Sci. 716 (2018)
Alexander Bolotov, Montserrat Hermo, Paqui Lucio
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach. TIME (2018)
Javier Álvez, Montserrat Hermo, Paqui Lucio, German Rigau
Automatic White-Box Testing of First-Order Logic Ontologies. CoRR (2017)
Montserrat Hermo, Ana Ozaki
New Steps on the Exact Learning of CNF. CoRR (2016)
Montserrat Hermo, Ana Ozaki
Exact Learning of Multivalued Dependencies. ALT (2015)
Jose Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
Invariant-Free Clausal Temporal Resolution. J. Autom. Reason. 50 (1) (2013)
Víctor Lavín Puente, Montserrat Hermo
Negative results on learning multivalued dependencies with queries. Inf. Process. Lett. 111 (19) (2011)
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro
Translating propositional extended conjunctions of Horn clauses into Boolean circuits. Theor. Comput. Sci. 411 (16-18) (2010)
Mikel Alecha, Montserrat Hermo
A Learning Algorithm for Deterministic Finite Automata using JFLAP. Electron. Notes Theor. Comput. Sci. 248 (2009)
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
Dual Systems of Tableaux and Sequents for PLTL. J. Log. Algebraic Methods Program. 78 (8) (2009)
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro
Systematic Semantic Tableaux for PLTL. Electron. Notes Theor. Comput. Sci. 206 (2008)
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, Fernando Orejas
A Cut-Free and Invariant-Free Sequent Calculus for PLTL. CSL (2007)
Joxe Gaintzarain, Montserrat Hermo, Marisa Navarro
Goals in the Propositional Horn Language Are Monotone Boolean Circuits. MFCS (2005)
Montserrat Hermo, Víctor Lavín
Negative Results on Learning Dependencies with Queries. AI&M (2002)
Montserrat Hermo, Víctor Lavín
Learning Minimal Covers of Functional Dependencies with Queries. ALT (1999)
José L. Balcázar, Montserrat Hermo
The Structure of Logarithmic Advice Complexity Classes. Theor. Comput. Sci. 207 (1) (1998)
Montserrat Hermo
Compressibility and Uniform Complexity. Inf. Process. Lett. 62 (5) (1997)
Harry Buhrman, Montserrat Hermo
On the Sparse Set Conjecture for Sets with Low Denisty. STACS (1995)
José L. Balcázar, Harry Buhrman, Montserrat Hermo
Learnability of Kolmogorov-easy circuit expressions via queries. EuroCOLT (1995)
Montserrat Hermo
Degrees and Reducibilities of Easy Tally Sets. MFCS (1994)
Montserrat Hermo, Elvira Mayordomo
A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity. Math. Syst. Theory 27 (4) (1994)
José L. Balcázar, Montserrat Hermo, Elvira Mayordomo
Characterizations of Logarithmic Advice Complexity Classes. IFIP Congress (1) (1992)