E-Cyclist: Implementation of an Efficient Validation of FOLID Cyclic Induction Reasoning

09/07/2021 ∙ by Sorin Stratulat, et al. ∙ Université Lorraine 0

Checking the soundness of cyclic induction reasoning for first-order logic with inductive definitions (FOLID) is decidable but the standard checking method is based on an exponential complement operation for Büchi automata. Recently, we introduced a polynomial checking method whose most expensive steps recall the comparisons done with multiset path orderings. We describe the implementation of our method in the Cyclist prover. Referred to as E-Cyclist, it successfully checked all the proofs included in the original distribution of Cyclist. Heuristics have been devised to automatically define, from the analysis of the proof derivations, the trace-based ordering measures that guarantee the soundness property.

READ FULL TEXT VIEW PDF
POST COMMENT

Comments

There are no comments yet.

Authors

page 5

page 6

This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.

References

  • [1]
  • [2] S. Berardi & M. Tatsuta (2019): Classical System of Martin-Lof’s Inductive Definitions is not Equivalent to Cyclic Proofs. Logical Methods in Computer Science 15(3), doi:10.23638/LMCS-15(3:10)2019.
  • [3] J. Brotherston (2005): Cyclic Proofs for First-Order Logic with Inductive Definitions. In: Proceedings of TABLEAUX-14, LNAI 3702, Springer-Verlag, pp. 78–92, doi:10.1007/115545548.
  • [4] J. Brotherston (2006): Sequent Calculus Proof Systems for Inductive Definitions. Ph.D. thesis, University of Edinburgh.
  • [5] J. Brotherston, N. Gorogiannis & R. L. Petersen (2012): A Generic Cyclic Theorem Prover. In: APLAS-10 (10th Asian Symposium on Programming Languages and Systems), LNCS 7705, Springer, pp. 350–367, doi:10.1007/978-3-642-35182-225.
  • [6] J. Brotherston & A. Simpson (2011): Sequent calculi for induction and infinite descent. Journal of Logic and Computation 21(6), pp. 1177–1216, doi:10.1093/logcom/exq052.
  • [7] N. Dershowitz & G. Moser (2007): The Hydra Battle Revisited. Rewriting, Computation and Proof, pp. 1–27, doi:10.1007/978-3-540-73147-4_1.
  • [8] G. Gentzen (1935): Untersuchungen über das logische Schließen. I. Mathematische Zeitschrift 39, pp. 176–210, doi:10.1007/BF01201353.
  • [9] M. Michel (1988): Complementation is more difficult with automata on infinite words. Technical Report, CNET.
  • [10] S. Stratulat (2017): Cyclic Proofs with Ordering Constraints. In R. A. Schmidt & C. Nalon, editors:

    TABLEAUX 2017 (26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods)

    , LNAI 10501, Springer, pp. 311–327, doi:10.1007/978-3-319-66902-119.
  • [11] S. Stratulat (2018): Validating Back-links of FOL Cyclic Pre-proofs. In S. Berardi & S. van Bakel, editors: CL&C’18 (Seventh International Workshop on Classical Logic and Computation), EPTCS 281, pp. 39–53, doi:10.4204/EPTCS.281.4.