A verified decision procedure for orders in Isabelle/HOL
From MaRDI portal
Publication:2147186
Abstract: We present the first verified implementation of a decision procedure for the quantifier-free theory of partial and linear orders. We formalise the procedure in Isabelle/HOL and provide a specification that is made executable using Isabelle's code generator. The procedure is already part of the development version of Isabelle as a sub-procedure of the simplifier.
Recommendations
Cites work
- scientific article; zbMATH DE number 1670734 (Why is no real title available?)
- Data refinement in Isabelle/HOL
- Isabelle/HOL. A proof assistant for higher-order logic
- Linear Quantifier Elimination
- On the elementary theory of linear order
- Proof-theoretical analysis of order relations
- Undecidability of some simple formalized theories
Cited in
(8)- Linear quantifier elimination
- Towards a Verified Tableau Prover for a Quantifier-Free Fragment of Set Theory
- Programming and verifying a declarative first-order prover in Isabelle/HOL
- Linear Quantifier Elimination
- Complete integer decision procedures as derived rules in HOL
- Logic for Programming, Artificial Intelligence, and Reasoning
- A slice-based decision procedure for type-based partial orders
- Parametric Linear Arithmetic over Ordered Fields in Isabelle/HOL
This page was built for publication: A verified decision procedure for orders in Isabelle/HOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2147186)