A cut-free cyclic proof system for Kleene algebra - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A cut-free cyclic proof system for Kleene algebra

Résumé

We introduce a sound non-wellfounded proof system whose regular (or 'cyclic') proofs are complete for (in)equations between regular expressions. We achieve regularity by using hypersequents rather than usual sequents, with more structure in the succedent, and relying on the discreteness of rational languages to drive proof search. By inspection of the proof search space we extract a PSpace bound for the system, which is optimal for deciding such (in)equations.
Fichier principal
Vignette du fichier
hka.pdf (390.17 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01558132 , version 1 (07-07-2017)

Identifiants

  • HAL Id : hal-01558132 , version 1

Citer

Anupam Das, Damien Pous. A cut-free cyclic proof system for Kleene algebra. TABLEAUX, Sep 2017, Brasilia, Brazil. ⟨hal-01558132⟩
311 Consultations
567 Téléchargements

Partager

Gmail Facebook X LinkedIn More