Skip to Main content Skip to Navigation
Conference papers

Completeness for Identity-free Kleene Lattices

Amina Doumane 1, 2 Damien Pous 1, 2 
2 PLUME - Preuves et Langages
LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We provide a finite set of axioms for identity-free Kleene lattices, which we prove sound and complete for the equational theory of their relational models. Our proof builds on the completeness theorem for Kleene algebra, and on a novel automata construction that makes it possible to extract axiomatic proofs using a Kleene-like algorithm.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01780845
Contributor : Damien Pous Connect in order to contact the contributor
Submitted on : Monday, July 2, 2018 - 9:16:50 PM
Last modification on : Saturday, September 11, 2021 - 3:18:58 AM

File

KLm.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Amina Doumane, Damien Pous. Completeness for Identity-free Kleene Lattices. CONCUR, Sep 2018, Beijing, China. ⟨10.4230/LIPIcs.CONCUR.2018.18⟩. ⟨hal-01780845v2⟩

Share

Metrics

Record views

120

Files downloads

124