The paper presents an inductive inference system for proving validity of formulas in the initial algebra TE of an order-sorted equational theory E. The system has 20 inference rules, with 11 of them being fully automated simplification rules and the remaining 9 requiring user interaction. This combination of automated and explicit-induction techniques aims to automate a substantial fraction of the proof effort.
The key techniques used in the inference system include:
All these techniques work modulo axioms B, which can be any combination of associativity, commutativity, and identity axioms. The paper also discusses the theoretical foundations of the inference system, including its soundness, and provides numerous examples illustrating the use of the different inference rules.
Naar een andere taal
vanuit de broninhoud
arxiv.org
Belangrijkste Inzichten Gedestilleerd Uit
by Jose Mesegue... om arxiv.org 05-07-2024
https://arxiv.org/pdf/2405.02420.pdfDiepere vragen