LoRea (Logic and Reasoning) - GIU 21/044
Argitalpenak (47) Ikertzaileren baten partaidetza izan duten argitalpenak
2025
-
Towards an efficient implementation of a tableau method for reactive safety specifications
Journal of Logical and Algebraic Methods in Programming, Vol. 142
2024
-
A Sound and Complete Algorithm to Identify Independent Variables in a Reactive System Specification
Proceedings -Design, Automation and Test in Europe, DATE
-
Towards the exact complexity of realizability for Safety LTL
Journal of Logical and Algebraic Methods in Programming, Vol. 141
2023
-
Exploiting Metonymy from Available Knowledge Resources
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
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
-
Tableaux for Realizability of Safety Specifications
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
-
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
-
Towards Effective Correction Methods Using WordNet Meronymy Relations
12th Global Wordnet Conference, GWC 2023
2021
-
Verified Model Checking for Conjunctive Positive Logic
SN Computer Science, Vol. 2, Núm. 5
2020
-
Branching-time logic ECTL# and its tree-style one-pass tableau: Extending fairness expressibility of ECTL+
Theoretical Computer Science, Vol. 813, pp. 428-451
-
Exact learning: On the boundary between horn and CNF
ACM Transactions on Computation Theory, Vol. 12, Núm. 1
-
One-pass context-based tableaux systems for CTL and ECTL
Leibniz International Proceedings in Informatics, LIPIcs
2019
-
A Framework for the Evaluation of SUMO-Based Ontologies Using WordNet
IEEE Access, Vol. 7, pp. 36075-36093
-
Automatic white-box testing of first-order logic ontologies
Journal of Logic and Computation, Vol. 29, Núm. 5, pp. 723-751
-
Towards certified model checking for PLTL using one-pass tableaux
Leibniz International Proceedings in Informatics, LIPIcs
2018
-
Exact learning of multivalued dependency formulas
Theoretical Computer Science, Vol. 716, pp. 4-14
-
Extending fairness expressibility of ECTL+: A tree-style one-pass tableau approach
Leibniz International Proceedings in Informatics, LIPIcs
2017
-
A tutorial on using Dafny to construct verified software
Electronic Proceedings in Theoretical Computer Science, EPTCS
2015
-
An assertional proof of the stability and correctness of Natural Mergesort
ACM Transactions on Computational Logic, Vol. 17, Núm. 1
-
Evaluating the competency of a first-order ontology
Proceedings of the 8th International Conference on Knowledge Capture, K-CAP 2015