Papers by Montserrat Hermo


I am interested in Computational Complexity, Computational Learning Theory and Automated Reasoning.

Conferences, Journals, Book Chapters

Exact Learning of Multivalued Dependencies. M. Hermo and A. Ozaki: Algorithmic Learning Theory (ALT), 2015. (Best Student Paper Award)

Learning a Subclass of Multivalued Dependencies Formulas from Entailments. M. Hermo and A. Ozaki: XV Jornadas sobre Programación y Lenguajes. Santander, 15-17 de septiembre de 2015.

Projective Quantifier Elimination for Equational Constraint Solving. J. Álvez, M. Hermo and P. Lucio: Quantify 2014- First International Workshop on Quantification. http://www.easychair.org/smart-program/VSL2014/QUANTIFY-program.html

Invariant-Free Clausal Temporal Resolution. J. Gaintzarain, M. Hermo, P. Lucio, M. Navarro and F. Orejas:  Journal of Automated Reasoning. 50(1): 1-49 (2013).

Negative results on learning multivalued dependencies with queries. V. Lavín Puente, M. Hermo.  Information Processing Letters. 111(19): 968-972 (2011).

Finite Model Reasoning on Large First-Order Ontologies. A. Azpeitia, M. Hermo and P. Lucio. XI Jornadas sobre Programación y Lenguajes. A Coruña, 5-7 de septiembre de 2011.

Translating propositional extended conjunctions of Horn clauses into Boolean Circuits. J. Gaintzarain, M. Hermo, P. Lucio and M. Navarro. Theoretical Computer Science. Volume 411, Issues 16-18, Pages 1723-1733 (2010).

Dual Systems of Tableaux and Sequents for PLTL. J. Gaintzarain, M. Hermo, P. Lucio, M. Navarro and  F. Orejas. The Journal of Logic and Algebraic Programming. Volume 78(8), Pages 701-722 (2009)

A New Proposal for Using First-Order Theorem Provers to Reason with OWL DL Ontologies. M. Alecha, J. Álvez, M. Hermo and E. Laparra. Proceedings Spanish Conference on Programming and Computer Languages (PROLE 2009). Pages 151-160 (2009)

A Learning Algorithm for Deterministic Finite Automata using JFLAP. M. Alecha and M. Hermo. Electronic Notes in Theoretical Computer Science. Volume 248. Pages 47-56 (2009).

Systematic Semantic Tableaux for PLTL, J. Gaintzarain, M. Hermo, P. Lucio and M. Navarro. Electronic Notes in Theoretical Computer Science. Volume 206, Pages 1-174 (2008).

Invariant-Free Clausal Temporal Resolution. J. Gaintzarain, M. Hermo, P. Lucio, M. Navarro, and F. Orejas. Contributed Talk in Workshop on Modal Fixpoint Logics, Amsterdam, March 25-27 (2008).

A Cut-Free and Invariant-Free Sequent Calculus for PLTL, J. Gaintzarain, M. Hermo, P. Lucio, M. Navarro and F. Orejas. Lecture Notes in Computer  Science. Proceedings of CSL'07. Volumen 4646, Springer (2007).

Goals in the Propositional Horn^ Language are Monotone Boolean Circuits, J. Gaintzarain, M. Hermo and M. Navarro. Lecture Notes in Computer  Science. Proceedings of MFCS'05. Volumen 3618, Springer-Verlag (2005).

On Learning Conjunctions of Horn^ Clauses, J. Gaintzarain, M. Hermo and M. Navarro. CiE 2005
New Computational Paradigms. Amsterdam (2005). 

Classifying the problem of Learning Extended Horn Clauses. J. Gaintzarain, M. Hermo, M. Navarro.
Actas de las V Jornadas sobre programación y Lenguajes - PROLE 2005.
Thomson Paraninfo, páginas 205-210 (2005).

Negative Results on Learning Dependencies with Queries,  M. Hermo and V. Lavín. Seventh International Symposium on Artificial Intelligence and Mathematics (2002).

Learning Minimal Covers of Functional Dependencies with Queries,  M. Hermo and V. Lavín. Lecture Notes in Artificial Intelligence. Proceedings of  ALT'99, Volumen 1720, Springer (1999).

The Structure of Logarithmic Advice Complexity Classes,  J. L. Balcázar and M. Hermo. Theoretical Computer Science. Volumen 207(1) (1998), 217-244.

Compressibility and Uniform Complexity, M. Hermo. Information Processing Letters 62  (1997), 259-264.

Compressibility of Infinite Binary Sequences,  J. L. Balcázar, R. Gavaldà and M. Hermo. Complexity, Logic, and Recursion Theory.  Marcel Dekker, Inc. (1997), 75-91.

On the Sparse Set Conjecture for Sets with Low Density,  H. Buhrman and M. Hermo.  Lecture Notes in Computer Science.  Proceedings of STACS'95. Volumen 900, Springer (1995).

Learnability of Kolmogorov-Easy Circuit Expression Via Queries, J. L. Balcázar, H. Buhrman and M. Hermo.  Lecture Notes in Artificial Intelligence. Proceedings of  EuroColt'95. Volumen 904, Springer (1995).

Circuit Expressions of Low Kolmogorov Complexity, J. L. Balcázar, H. Buhrman and M. Hermo. Follow-up and major overhaul of EuroColt'95. (1995)

A Note on Polynomial-Size Circuits with Low Resource-Bounded Kolmogorov Complexity,  E. Mayordomo and M. Hermo. Mathematical Systems Theory 27 (1994), 347-356.

On Infinite Sequences (almost) as easy as pi, . L. Balcázar, R. Gavaldà and M. Hermo. Workshop on Applications of Descriptional Complexity to Inductive, Statiscal and Visual Inference. Rutgers University (New Jersey) (1994).

Degrees and Reducibilities of Easy Tally Sets,  M. Hermo.  Lecture Notes in Computer  Science. Proceedings of MFCS'94. Volumen 841, Springer-Verlag (1994).

Characterizations of Logarithmic Advice Classes, J. L. Balcázar, M. Hermo and E. Mayordomo. Algorithms, Software, Architecture.  Information Processing 92. Proceedings of IFIP'92, Volumen I, North-Holland (1992).


Back to Montserrat Hermo's Home Page
Last updated 20/12/2015