Abstract
AbstractIn sequent calculi, cut elimination is a property that guarantees that any provable formula can be proven analytically. For example, Gentzen’s classical and intuitionistic calculi LK and LJ enjoy cut elimination. The property is less studied in coinductive extensions of sequent calculi. In this paper, we use coinductive Horn clause theories to show that cut is not eliminable in a coinductive extension of LJ, a system we call CLJ. We derive two further practical results from this study. We show that CoLP by Gupta et al. gives rise to cut-free proofs in CLJ with fixpoint terms, and we formulate and implement a novel method of coinductive theory exploration that provides several heuristics for discovery of cut formulae in CLJ.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Computational Theory and Mathematics,Hardware and Architecture,Theoretical Computer Science,Software
Reference23 articles.
1. 14. Komendantskaya, E. and Li, Y. 2017. Productive corecursion in logic programming. J. TPLP (ICLP’17 post-proc.) 17, 5-6, 906–923.
2. 18. Saotome, K. , Nakazawa, K. , and Kimura, D. 2020. Restriction on cut in cyclic proof system for symbolic heaps. In FLOPS’20.
3. Programming with Higher-Order Logic
4. 3. Blanchette, J. et al. 2017. Foundational nonuniform (co)datatypes for higher-order logic. In LICS’17. IEEE Computer Society, 1–12.
5. 17. Plotkin, G. D. 1970. A note on inductive generalization. Machine intelligence.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献