HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories

Abstract

We present a simple resolution proof system for higher-order constrained Horn clauses (HoCHC) - a system of higher-order logic modulo theories - and prove its soundness and refutational completeness w.r.t. the standard semantics. As corollaries, we obtain the compactness theorem and semi-decidability of HoCHC for semi-decidable background theories, and we prove that HoCHC satisfies a canonical model property. Moreover a variant of the well-known translation from higher-order to 1st-order logic is shown to be sound and complete for HoCHC in standard semantics. We illustrate how to transfer decidability results for (fragments of) 1st-order logic modulo theories to our higher-order setting, using as example the Bernays-Schonfinkel-Ramsey fragment of HoCHC modulo a restricted form of Linear Integer Arithmetic.

References in corpus (2)

• HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories
• Language and Proofs for Higher-Order SMT (Work in Progress)

Cited by in corpus (4)

• HoCHC: A Refutationally Complete and Semantically Invariant System of Higher-order Logic Modulo Theories
• The Extended Theory of Trees and Algebraic (Co)datatypes
• An Overview of the HFL Model Checking Project
• Reducing Higher-order Recursion Scheme Equivalence to Coinductive Higher-order Constrained Horn Clauses