Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Montserrat Hermo
Observed names:
Hermo, Montserrat,
M. Hermo
Institution:
University of the Basque Country
Observed institution:
University of the Basque Country
ORCID:
0000-0001-5627-501X
Observed ORCID:
0000-0001-5627-501X
OpenAlex ID:
A5070619182
Dual Systems of Tableaux and Sequents for PLTL
2009
·
Jose Gaintzarain
, Montserrat Hermo
, et al.
·
The Journal of Logic and Algebraic Programming
·
28
A Cut-Free and Invariant-Free Sequent Calculus for PLTL
2007
·
Joxe Gaintzarain
, Montserrat Hermo
, et al.
·
Lecture notes in computer science
·
21
Systematic Semantic Tableaux for PLTL
2008
·
J. Gaintzarain
, M. Hermo
, et al.
·
Electronic Notes in Theoretical Computer Science
·
17
The structure of logarithmic advice complexity classes
1998
·
JoséL. Balcázar
, Montserrat Hermo
·
Theoretical Computer Science
·
17
PDF
Characterizations of Logarithmic Advice Complexity Classes
1992
·
José L. Balcázar
, Montserrat Hermo
, et al.
·
World Computer Congress on Algorithms, Software, Architecture
·
14
Automatic white-box testing of first-order logic ontologies
2019
·
Javier Álvez
, Montserrat Hermo
, et al.
·
Journal of Logic and Computation
·
8
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity
1994
·
Montserrat Hermo
, Elvira Mayordomo
·
Theory of Computing Systems
·
8
Exact Learning: On the Boundary between Horn and CNF
2020
·
Montserrat Hermo
, Ana Ozaki
·
ACM Transactions on Computation Theory
·
7
PDF
Learning Minimal Covers of Functional Dependencies with Queries
1999
·
Montserrat Hermo
, Víctor Lavín
·
Lecture notes in computer science
·
7
Compressibility of Infinite Binary Sequences
2019
·
José L. Balcázar
, Ricard Gavaldà
, et al.
·
CRC Press eBooks
·
6
Structural complexity I
1990
·
A. Arrieta
, Montserrat Hermo
·
6
Towards Certified Model Checking for PLTL Using One-Pass Tableaux
2019
·
Abuin, Alex
, Bolotov, Alexander
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
5
PDF
Invariant-Free Clausal Temporal Resolution
2011
·
Jose Gaintzarain
, Montserrat Hermo
, et al.
·
Journal of Automated Reasoning
·
5
Negative results on learning multivalued dependencies with queries
2011
·
Víctor Lavín Puente
, Montserrat Hermo
·
Information Processing Letters
·
5
Tableaux for Realizability of Safety Specifications
2023
·
Montserrat Hermo
, Paqui Lucio
, et al.
·
Lecture notes in computer science
·
4
PDF
A Learning Algorithm for Deterministic Finite Automata using JFLAP
2009
·
Mikel Alecha
, Montserrat Hermo
·
Electronic Notes in Theoretical Computer Science
·
4
Negative Results on Learning Dependencies with Queries.
2002
·
Montserrat Hermo
, Víctor Lavín Puente
·
Annals of Mathematics and Artificial Intelligence
·
4
On the sparse set conjecture for sets with low density
1995
·
Harry Buhrman
, Montserrat Hermo
·
Lecture notes in computer science
·
4
Towards the exact complexity of realizability for Safety LTL
2024
·
Noel Arteche
, Montserrat Hermo
·
Journal of Logical and Algebraic Methods in Programming
·
3
Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models
2022
·
Alex Abuin
, Alexander Bolotov
, et al.
·
Journal of Logical and Algebraic Methods in Programming
·
3
PDF
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+
2020
·
Alexander Bolotov
, Montserrat Hermo
, et al.
·
Theoretical Computer Science
·
3
PDF
Nonuniform complexity classes with sub-linear advice functions
1996
·
Montserrat Hermo
·
Dialnet (Universidad de la Rioja)
·
3
Learnability of Kolmogorov-easy circuit expressions via queries
1995
·
José L. Balcázar
, Harry Buhrman
, et al.
·
Lecture notes in computer science
·
3
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach
2018
·
Bolotov, Alexander
, Hermo, Montserrat
, et al.
·
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
·
2
PDF
Degrees and reducibilities of easy tally sets
1994
·
Montserrat Hermo
·
Lecture notes in computer science
·
2
Show more works
View as search
Works count:
49
Citation count:
197
H-index:
7
I10-index:
5
Year
Topic
Type