Work

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

Year: 2019

Type: conference-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.

Source: Lecture notes in computer science

DOI: 10.1007/978-3-030-17184-1_28

Authors: Henning Basold, Ekaterina Komendantskaya, Yue Li

Institutions: École Normale Supérieure de Lyon, Centre National de la Recherche Scientifique, Heriot-Watt University

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

Estimated APC paid: $5,392

Funders: Engineering and Physical Sciences Research Council, H2020 European Research Council