| A cut-free and invariant-free sequent calculus for PLTL J Gaintzarain, M Hermo, P Lucio, M Navarro, F Orejas International Workshop on Computer Science Logic, 481-495, 2007 | 37 | 2007 |
| Dual systems of tableaux and sequents for PLTL J Gaintzarain, M Hermo, P Lucio, M Navarro, F Orejas The Journal of Logic and Algebraic Programming 78 (8), 701-722, 2009 | 33 | 2009 |
| The structure of logarithmic advice complexity classes JL Balcázar, M Hermo Theoretical Computer Science 207 (1), 217-244, 1998 | 25 | 1998 |
| Systematic semantic tableaux for PLTL J Gaintzarain, M Hermo, P Lucio, M Navarro Electronic Notes in Theoretical Computer Science 206, 59-73, 2008 | 19 | 2008 |
| Characterizations of logarithmic advice complexity classes JL Balcázar, M Hermo, E Mayordomo Proceedings of the IFIP 12th World Computer Congress on Algorithms, Software …, 1992 | 18 | 1992 |
| A note on polynomial-size circuits with low resource-bounded Kolmogorov complexity M Hermo, E Mayordomo Mathematical systems theory 27, 347-356, 1994 | 17 | 1994 |
| Learning minimal covers of functional dependencies with queries M Hermo, V Lavín International Conference on Algorithmic Learning Theory, 291-300, 1999 | 12 | 1999 |
| Negative results on learning multivalued dependencies with queries VL Puente, M Hermo Information processing letters 111 (19), 968-972, 2011 | 11 | 2011 |
| Nonuniform complexity classes with sub-linear advice functions M Hermo BULLETIN-EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE 60, 302-304, 1996 | 11 | 1996 |
| Automatic white-box testing of first-order logic ontologies J Álvez, M Hermo, P Lucio, G Rigau Journal of Logic and Computation 29 (5), 723-751, 2019 | 8 | 2019 |
| Compressibility of infinite binary sequences JL Balcázar, R Gavalda, M Hermo Complexity, logic, and recursion theory, 75-91, 2019 | 8 | 2019 |
| Exact learning: On the boundary between horn and CNF M Hermo, A Ozaki ACM Transactions on Computation Theory (TOCT) 12 (1), 1-25, 2020 | 7 | 2020 |
| Towards certified model checking for PLTL using one-pass tableaux A Abuin, A Bolotov, U Díaz de Cerio, M Hermo, P Lucio 26th International Symposium on Temporal Representation and Reasoning (TIME …, 2019 | 7 | 2019 |
| Invariant-free clausal temporal resolution J Gaintzarain, M Hermo, P Lucio, M Navarro, F Orejas Journal of automated reasoning 50, 1-49, 2013 | 7 | 2013 |
| Extending fairness expressibility of ECTL+: a tree-style one-pass tableau approach A Bolotov, M Hermo Huguet, F Lucio Carrasco Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, 2018 | 6 | 2018 |
| Compressibility and uniform complexity M Hermo Information processing letters 62 (5), 259-264, 1997 | 6 | 1997 |
| One-pass Context-based Tableaux Systems for CTL and ECTL A Abuin, A Bolotov, M Hermo Huguet, F Lucio Carrasco Schloss Dagstuhl-Leibniz-Zentrum für Informatik, 2020 | 5 | 2020 |
| Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+ A Bolotov, M Hermo, P Lucio Theoretical Computer Science 813, 428-451, 2020 | 5 | 2020 |
| A learning algorithm for deterministic finite automata using JFLAP M Alecha, M Hermo Electronic Notes in Theoretical Computer Science 248, 47-56, 2009 | 5 | 2009 |
| Learnability of Kolmogorov-easy circuit expressions via queries JL Balcázar, H Buhrman, M Hermo European Conference on Computational Learning Theory, 112-124, 1995 | 5 | 1995 |
Paqui Lucio CarrascoUniversity of the Basque CountryVerified email at ehu.es
