What you always wanted to know about rigid \(E\)-unification
From MaRDI portal
Publication:1382154
DOI10.1023/A:1005996623714zbMath0893.68135OpenAlexW1585426594MaRDI QIDQ1382154
Andrei Voronkov, Anatoli Degtyarev
Publication date: 30 August 1998
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1005996623714
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (8)
Theorem Proving with Bounded Rigid E-Unification ⋮ Efficient Algorithms for Bounded Rigid E-unification ⋮ Superposition-based equality handling for analytic tableaux ⋮ Free Variables and Theories: Revisiting Rigid E-unification ⋮ \(\lim +, \delta^+\), and non-permutability of \(\beta\)-steps ⋮ Lean induction principles for tableaux ⋮ Connection tableaux with lazy paramodulation ⋮ What you always wanted to know about rigid E-unification
This page was built for publication: What you always wanted to know about rigid \(E\)-unification
