Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses

11/19/2018
by   Henning Basold, et al.
0

We establish proof-theoretic, constructive and coalgebraic foundations for proof search in coinductive Horn clause theories. Operational semantics of coinductive Horn clause resolution is cast in terms of coinductive uniform proofs; its constructive content is exposed via soundness relative to an intuitionistic first-order logic with recursion controlled by the later modality; and soundness of both proof systems is proven relative to a novel coalgebraic description of complete Herbrand models.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/20/2020

Constructive Game Logic

Game Logic is an excellent setting to study proofs-about-programs via th...
research
01/05/2023

Proof-theoretic Semantics and Tactical Proof

The use of logical systems for problem-solving may be as diverse as in p...
research
03/18/2019

Coinductive Uniform Proofs

Coinduction occurs in two guises in Horn clause logic: in proofs of circ...
research
05/25/2019

On the Constructive Truth and Falsity in Peano Arithmetic

Recently, Artemov [4] offered the notion of constructive consistency for...
research
04/09/2021

A Constructive Logic with Classical Proofs and Refutations (Extended Version)

We study a conservative extension of classical propositional logic disti...
research
04/26/2018

First-order answer set programming as constructive proof search

We propose an interpretation of the first-order answer set programming (...
research
05/05/2022

Automating Reasoning with Standpoint Logic via Nested Sequents

Standpoint logic is a recently proposed formalism in the context of know...

Please sign up or login with your details

Forgot password? Click here to reset