Automatic Proof Generation in Kleene Algebra
From MaRDI portal
Publication:3498428
Recommendations
Cites work
- scientific article; zbMATH DE number 3560737 (Why is no real title available?)
- scientific article; zbMATH DE number 1033559 (Why is no real title available?)
- scientific article; zbMATH DE number 1086671 (Why is no real title available?)
- scientific article; zbMATH DE number 2196588 (Why is no real title available?)
- A completeness theorem for Kleene algebras and the algebra of regular events
- On Hoare logic and Kleene algebra with tests
Cited in
(18)- Automated Reasoning in Kleene Algebra
- scientific article; zbMATH DE number 978243 (Why is no real title available?)
- A bialgebraic approach to automata and formal language theory
- Automated Algebraic Reasoning for Collections and Local Variables with Lenses
- Automating Change of Representation for Proofs in Discrete Mathematics
- Algorithms for Kleene algebra with converse
- Programming and automating mathematics in the Tarski-Kleene hierarchy
- scientific article; zbMATH DE number 1341622 (Why is no real title available?)
- scientific article; zbMATH DE number 6938205 (Why is no real title available?)
- Left-handed completeness
- Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation
- On probabilistic Kleene algebras, automata and simulations
- scientific article; zbMATH DE number 1688351 (Why is no real title available?)
- Automating algebraic proof systems is NP-hard
- Left-handed completeness
- Deciding Kleene algebra terms equivalence in Coq
- A Bialgebraic Approach to Automata and Formal Language Theory
- A cut-free cyclic proof system for Kleene algebra
This page was built for publication: Automatic Proof Generation in Kleene Algebra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3498428)