Efficient unification of quantified terms

DOI10.1016/0743-1066(88)90015-5MaRDI QIDQ3787472zbMATH OpenOpenAlexFDO

Authors John Staples, Peter J. Robinson

Publication date 1988

Published in The Journal of Logic Programming (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0743-1066(88)90015-5

zbMATH Keywords

data structuresefficient computationsymbolic computationunificationquantified termsConventional logic-programming languages

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Data structures (68P05)

Recommendations

• scientific article; zbMATH DE number 4043301
• Structure sharing for quantified terms: Fundamentals
• A practically efficient and almost linear unification algorithm
• scientific article; zbMATH DE number 36613
• scientific article; zbMATH DE number 1330135

Cited in

(5)

• Delaying unification algorithms for lambda calculi
• Unification and matching on compressed terms
• Sparse logical terms
• scientific article; zbMATH DE number 4043301 (Why is no real title available?)
• Structure sharing for quantified terms: Fundamentals

This page was built for publication: Efficient unification of quantified terms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3787472)