Montserrat Hermo

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