Superposition with Delayed Unification
Abstract: Classically, in saturation-based proof systems, unification has been considered atomic. However, it is also possible to move unification to the calculus level, turning the steps of the unification algorithm into inferences. For calculi that rely on unification procedures returning large or even infinite sets of unifiers, integrating unification into the calculus is an attractive method of dovetailing unification and inference. This applies, for example, to AC-superposition and higher-order superposition. We show that first-order superposition remains complete when moving unification rules to the calculus level. We discuss some of the benefits this has even for standard first-order superposition and provide an experimental evaluation.
- Domenjoud, E.: A technical note on AC-unification. The number of minimal unifiers of the equation αx1+⋯+αxp≐ACβy1+⋯+βyqsubscriptapproaches-limit𝐴𝐶𝛼subscript𝑥1⋯𝛼subscript𝑥𝑝𝛽subscript𝑦1⋯𝛽subscript𝑦𝑞\alpha x_{1}+\cdots+\alpha x_{p}\doteq_{AC}\beta y_{1}+\cdots+\beta y_{q}italic_α italic_x start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT + ⋯ + italic_α italic_x start_POSTSUBSCRIPT italic_p end_POSTSUBSCRIPT ≐ start_POSTSUBSCRIPT italic_A italic_C end_POSTSUBSCRIPT italic_β italic_y start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT + ⋯ + italic_β italic_y start_POSTSUBSCRIPT italic_q end_POSTSUBSCRIPT. Journal of Automated Reasoning 8 (1992)
- Nipkow, T.: Functional unification of higher-order patterns. In: LICS. pp. 64–74. IEEE Computer Society (1993)
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.