Name
Papers
Collaborators
MONTSERRAT HERMO
25
20
Citations 
PageRank 
Referers 
55
10.77
60
Referees 
References 
244
195
Search Limit
100244
Title
Citations
PageRank
Year
Verified Model Checking for Conjunctive Positive Logic.00.342021
Exact Learning: On the Boundary between Horn and CNF00.342020
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+.00.342020
One-Pass Context-Based Tableaux Systems for CTL and ECTL.00.342020
Towards Certified Model Checking for PLTL Using One-Pass Tableaux.00.342019
Exact learning of multivalued dependency formulas.00.342018
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach.00.342018
Automatic White-Box Testing of First-Order Logic Ontologies.00.342017
New Steps on the Exact Learning of CNF.00.342016
Exact Learning of Multivalued Dependencies.00.342015
Invariant-Free Clausal Temporal Resolution10.342013
Negative results on learning multivalued dependencies with queries40.452011
Translating propositional extended conjunctions of Horn clauses into Boolean circuits00.342010
A Learning Algorithm for Deterministic Finite Automata using JFLAP00.342009
Dual Systems of Tableaux and Sequents for PLTL50.472009
A cut-free and invariant-free sequent calculus for PLTL90.772007
Negative Results on Learning Dependencies with Queries.20.392002
Learning Minimal Covers of Functional Dependencies with Queries60.541999
The structure of logarithmic advice complexity classes60.761998
Compressibility and uniform complexity10.371997
On the Sparse Set Conjecture for Sets with Low Denisty20.391995
Learnability of Kolmogorov-easy circuit expressions via queries00.341995
Degrees and Reducibilities of Easy Tally Sets20.401994
A note on polynomial-size circuits with low resource-bounded Kolmogorov complexity40.461994
Characterizations of Logarithmic Advice Complexity Classes131.021992