Cyclic Proofs with Ordering Constraints

Abstract : CLKID ω is a sequent-based cyclic inference system able to reason on first-order logic with inductive definitions. The current approach for verifying the soundness of CLKID ω proofs is based on expensive model-checking techniques leading to an explosion in the number of states. We propose proof strategies that guarantee the soundness of a class of CLKID ω proofs if some ordering and derivability constraints are satisfied. They are inspired from previous works about cyclic well-founded induction reasoning, known to provide effective sets of ordering constraints. A derivability constraint can be checked in linear time. Under certain conditions, one can build proofs that implicitly satisfy the ordering constraints.
Type de document :
Communication dans un congrès
TABLEAUX 2017 (26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), Sep 2017, Brasilia, Brazil. 12, pp.311 - 327, 2017, Automated Reasoning with Analytic Tableaux and Related Methods
Liste complète des métadonnées

Littérature citée [19 références]  Voir  Masquer  Télécharger

https://hal.archives-ouvertes.fr/hal-01590651
Contributeur : Sorin Stratulat <>
Soumis le : jeudi 21 septembre 2017 - 06:22:52
Dernière modification le : mardi 2 octobre 2018 - 01:16:22

Fichier

Str_10501_2017a.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-01590651, version 1

Citation

Sorin Stratulat. Cyclic Proofs with Ordering Constraints. TABLEAUX 2017 (26th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods), Sep 2017, Brasilia, Brazil. 12, pp.311 - 327, 2017, Automated Reasoning with Analytic Tableaux and Related Methods. 〈hal-01590651〉

Partager

Métriques

Consultations de la notice

38

Téléchargements de fichiers

49