Argitalpenak (45) Ikertzaileren baten partaidetza izan duten argitalpenak

2023

  1. Exploiting Metonymy from Available Knowledge Resources

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

  2. 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

  3. Tableaux for Realizability of Safety Specifications

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

  4. This is not a Dataset: A Large Negation Benchmark to Challenge Large Language Models

    EMNLP 2023 - 2023 Conference on Empirical Methods in Natural Language Processing, Proceedings

  5. Towards Effective Correction Methods Using WordNet Meronymy Relations

    12th Global Wordnet Conference, GWC 2023

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. A Framework for the Evaluation of SUMO-Based Ontologies Using WordNet

    IEEE Access, Vol. 7, pp. 36075-36093

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

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

  3. 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

2017

  1. A tutorial on using Dafny to construct verified software

    Electronic Proceedings in Theoretical Computer Science, EPTCS

2015

  1. An assertional proof of the stability and correctness of Natural Mergesort

    ACM Transactions on Computational Logic, Vol. 17, Núm. 1

  2. Evaluating the competency of a first-order ontology

    Proceedings of the 8th International Conference on Knowledge Capture, K-CAP 2015

  3. Exact learning of multivalued dependencies

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

  4. Improving the competency of first-order ontologies

    Proceedings of the 8th International Conference on Knowledge Capture, K-CAP 2015