A Verified Decision Procedure for Orders in Isabelle/HOL

04/27/2021
by   Lukas Stevens, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/28/2022

Towards a Verified Prover for a Ground Fragment of Set Theory

Using Isabelle/HOL, we verify the state-of-the-art decision procedure fo...
research
07/12/2018

A Generic Framework for Implicate Generation Modulo Theories

The clausal logical consequences of a formula are called its implicates....
research
08/06/2022

A Set-Theoretic Decision Procedure for Quantifier-Free, Decidable Languages Extended with Restricted Quantifiers

Let ℒ_𝒳 be the language of first-order, decidable theory 𝒳. Consider the...
research
07/17/2018

Expressing Linear Orders Requires Exponential-Size DNNFs

We show that any DNNF circuit that expresses the set of linear orders ov...
research
07/02/2018

Well-Scaling Procedure for Deciding Gammoid Class-Membership of Matroids

We introduce a procedure that solves the decision problem whether a give...
research
12/29/2020

Scalable Multivariate Histograms

We give a distributed variant of an adaptive histogram estimation proced...
research
05/06/2021

A Decision Procedure for a Theory of Finite Sets with Finite Integer Intervals

In this paper we extend a decision procedure for the Boolean algebra of ...

Please sign up or login with your details

Forgot password? Click here to reset