Unification in incompletely specified theories: A case study

DOI10.1007/3-540-54345-7_51MaRDI QIDQ4035229zbMATH OpenFDO

Authors Staffan Bonnier

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-54345-7_51

zbMATH Keywords

approximation framesevaluation based unification algorithmsintegrating logic and functional programmingweakly complete

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Logic programming (68N17) Symbolic computation and algebraic computation (68W30)

Recommendations

• Completion for unification
• scientific article; zbMATH DE number 4112560
• scientific article; zbMATH DE number 4016225
• scientific article; zbMATH DE number 3871321
• Complete sets of unifiers and matchers in equational theories

Cited in

(2)

• scientific article; zbMATH DE number 4049025 (Why is no real title available?)
• On Asymmetric Unification and the Combination Problem in Disjoint Theories

This page was built for publication: Unification in incompletely specified theories: A case study

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