Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses

09/10/2021
by   Jerome Jochems, et al.
0

Higher-order constrained Horn clauses (HoCHC) are a semantically-invariant system of higher-order logic modulo theories. With semi-decidable unsolvability over a semi-decidable background theory, HoCHC is suitable for safety verification. Less is known about its relation to larger classes of higher-order verification problems. Motivated by program equivalence, we introduce a coinductive version of HoCHC that enjoys a greatest model property. We define an encoding of higher-order recursion schemes (HoRS) into HoCHC logic programs. Correctness of this encoding reduces decidability of the open HoRS equivalence problem – and, thus, the LambdaY-calculus Böhm tree equivalence problem – to semi-decidability of coinductive HoCHC over a complete and decidable theory of trees.

READ FULL TEXT

Authors

page 1

page 2

page 3

page 4

02/27/2019

HoCHC: a Refutationally-complete and Semantically-invariant System of Higher-order Logic Modulo Theories

We present a simple resolution proof system for higher-order constrained...
01/31/2021

Superposition with Lambdas

We designed a superposition calculus for a clausal fragment of extension...
05/05/2020

Superposition for Lambda-Free Higher-Order Logic

We introduce refutationally complete superposition calculi for intention...
10/08/2018

Defunctionalization of Higher-Order Constrained Horn Clauses

Building on the successes of satisfiability modulo theories (SMT), Bjørn...
04/21/2020

The Imandra Automated Reasoning System (system description)

We describe Imandra, a modern computational logic theorem prover designe...
04/29/2021

Initial Limit Datalog: a New Extensible Class of Decidable Constrained Horn Clauses

We present initial limit Datalog, a new extensible class of constrained ...
08/24/2021

On Decidability of the Bisimilarity on Higher-order Processes with Parameterization

Higher-order processes with parameterization are capable of abstraction ...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.