Publicaciones (38) Publicaciones de FRANCISCA LUCIO CARRASCO

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. 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. 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. Improving the competency of first-order ontologies

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

2013

  1. Invariant-free clausal temporal resolution

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

  2. Logical foundations for more expressive declarative temporal logic programming languages

    ACM Transactions on Computational Logic, Vol. 14, Núm. 4

2012

  1. Adimen-SUMO: Reengineering an ontology for first-order reasoning

    International Journal on Semantic Web and Information Systems, Vol. 8, Núm. 4, pp. 80-116

2010

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

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

2008

  1. A New Proposal Of Quasi-Solved Form For Equality Constraint Solving

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