M. Hermo

From MaRDI portal
Person:287085

Available identifiers

zbMath Open hermo.montserratMaRDI QIDQ287085

List of research outcomes





PublicationDate of PublicationType
Towards an efficient implementation of a tableau method for reactive safety specifications2024-11-26Paper
Towards the exact complexity of realizability for safety LTL2024-10-08Paper
One-pass Context-based Tableaux Systems for CTL and ECTL2023-11-02Paper
Tableaux for realizability of safety specifications2023-08-17Paper
Towards certified model checking for PLTL using one-pass tableaux2023-02-03Paper
Exact Learning2022-12-05Paper
Tableaux and sequent calculi for \textsf{CTL} and \textsf{ECTL}: satisfiability test with certifying proofs and models2022-11-16Paper
Degrees and reducibilities of easy tally sets2022-08-18Paper
Extending Fairness Expressibility of ECTL+: A Tree-Style One-Pass Tableau Approach2022-05-28Paper
Branching-time logic \(\mathsf{ECTL}^{\#}\) and its tree-style one-pass tableau: extending fairness expressibility of \(\mathsf{ECTL}^+\)2020-04-21Paper
Automatic white-box testing of first-order logic ontologies2020-02-03Paper
Exact learning of multivalued dependency formulas2018-03-12Paper
On the sparse set conjecture for sets with low density2017-12-04Paper
Exact Learning of Multivalued Dependencies2016-11-30Paper
Compressibility and uniform complexity2016-05-26Paper
Systematic semantic tableaux for PLTL2014-01-10Paper
Invariant-free clausal temporal resolution2013-07-05Paper
Negative results on learning multivalued dependencies with queries2013-04-04Paper
Translating propositional extended conjunctions of Horn clauses into Boolean circuits2010-04-15Paper
Dual systems of tableaux and sequents for PLTL2009-11-04Paper
A Cut-Free and Invariant-Free Sequent Calculus for PLTL2009-03-05Paper
https://portal.mardi4nfdi.de/entity/Q49553192000-07-24Paper
The structure of logarithmic advice complexity classes1999-01-12Paper
https://portal.mardi4nfdi.de/entity/Q43481241997-09-22Paper
A Note on polynomial-size circuits with low resource-bounded Kolmogorov complexity1994-08-10Paper

Research outcomes over time

This page was built for person: M. Hermo