The University of Southampton
University of Southampton Institutional Repository

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

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

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.

Coalgebra, Coinduction, Fibrations, Horn clause logic, Intuitionistic logic, Löb modality, Uniform proofs
0302-9743
783-813
Springer
Basold, Henning
88ab5efa-e9d1-45aa-ad68-6cbf83089936
Komendantskaya, Ekaterina
f12d9c23-5589-40b8-bcf9-a04fe9dedf61
Li, Yue
f52843d0-0f3f-440e-810c-8ae25ef32ffd
Caires, Luís
Basold, Henning
88ab5efa-e9d1-45aa-ad68-6cbf83089936
Komendantskaya, Ekaterina
f12d9c23-5589-40b8-bcf9-a04fe9dedf61
Li, Yue
f52843d0-0f3f-440e-810c-8ae25ef32ffd
Caires, Luís

Basold, Henning, Komendantskaya, Ekaterina and Li, Yue (2019) Coinduction in Uniform: Foundations for Corecursive Proof Search with Horn Clauses. Caires, Luís (ed.) In Programming Languages and Systems - 28th European Symposium on Programming, ESOP 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings. vol. 11423 LNCS, Springer. pp. 783-813 . (doi:10.1007/978-3-030-17184-1_28).

Record type: Conference or Workshop Item (Paper)

Abstract

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.

Text
978-3-030-17184-1_28 - Version of Record
Available under License Creative Commons Attribution.
Download (1MB)

More information

Published date: 2019
Additional Information: Publisher Copyright: © The Author(s) 2019.
Venue - Dates: 28th European Symposium on Programming, ESOP 2019 Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, , Prague, Czech Republic, 2019-04-06 - 2019-04-11
Keywords: Coalgebra, Coinduction, Fibrations, Horn clause logic, Intuitionistic logic, Löb modality, Uniform proofs

Identifiers

Local EPrints ID: 500750
URI: http://eprints.soton.ac.uk/id/eprint/500750
ISSN: 0302-9743
PURE UUID: b489a2cf-e529-4293-83a6-7c8eb84351d6
ORCID for Ekaterina Komendantskaya: ORCID iD orcid.org/0000-0002-3240-0987

Catalogue record

Date deposited: 12 May 2025 16:53
Last modified: 23 May 2025 02:08

Export record

Altmetrics

Contributors

Author: Henning Basold
Author: Ekaterina Komendantskaya ORCID iD
Author: Yue Li
Editor: Luís Caires

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×