Publicaciones (27) Publicaciones de MONTSERRAT HERMO HUGUET

2023

  1. Tableaux and sequent calculi for CTL and ECTL: Satisfiability test with certifying proofs and models

    Journal of Logical and Algebraic Methods in Programming, Vol. 130

  2. Tableaux for Realizability of Safety Specifications

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2021

  1. Verified Model Checking for Conjunctive Positive Logic

    SN Computer Science, Vol. 2, Núm. 5

2020

  1. Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+

    Theoretical Computer Science, Vol. 813, pp. 428-451

  2. Exact learning: On the boundary between horn and CNF

    ACM Transactions on Computation Theory, Vol. 12, Núm. 1

  3. One-pass context-based tableaux systems for CTL and ECTL

    Leibniz International Proceedings in Informatics, LIPIcs

2019

  1. Automatic white-box testing of first-order logic ontologies

    Journal of Logic and Computation, Vol. 29, Núm. 5, pp. 723-751

  2. Towards certified model checking for PLTL using one-pass tableaux

    Leibniz International Proceedings in Informatics, LIPIcs

2018

  1. Exact learning of multivalued dependency formulas

    Theoretical Computer Science, Vol. 716, pp. 4-14

  2. Extending fairness expressibility of ECTL+: A tree-style one-pass tableau approach

    Leibniz International Proceedings in Informatics, LIPIcs

2015

  1. Exact learning of multivalued dependencies

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2013

  1. Invariant-free clausal temporal resolution

    Journal of Automated Reasoning, Vol. 50, Núm. 1, pp. 1-49

2011

  1. Negative results on learning multivalued dependencies with queries

    Information Processing Letters, Vol. 111, Núm. 19, pp. 968-972

2010

  1. Translating propositional extended conjunctions of Horn clauses into Boolean circuits

    Theoretical Computer Science, Vol. 411, Núm. 16-18, pp. 1723-1733

2009

  1. A Learning Algorithm for Deterministic Finite Automata using JFLAP

    Electronic Notes in Theoretical Computer Science, Vol. 248, pp. 47-56

  2. A new proposal for using first-order theorem provers to reason with OWL DL ontologies

    Programación y lenguajes: IX Jornadas sobre Programación y Lenguajes, PROLE'09, I Taller de Programación Funcional, TPF'09, San Sebastián, España, del 8 al 11 de septiembre de 2009

  3. Dual Systems of Tableaux and Sequents for PLTL

    Journal of Logic and Algebraic Programming, Vol. 78, Núm. 8, pp. 701-722

2008

  1. Systematic Semantic Tableaux for PLTL

    Electronic Notes in Theoretical Computer Science, Vol. 206, Núm. C, pp. 59-73

2007

  1. A cut-free and invariant-free sequent calculus for PLTL

    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

2005

  1. Goals in the prepositional Horn⊃ language are monotone Boolean circuits

    Lecture Notes in Computer Science