scientific article; zbMATH DE number 3688778

zbMATH Open0441.68110MaRDI QIDQ3883563FDOQ3883563

Authors: Jörg H. Siekmann 

Publication date: 1979

Title of this publication is not available (Why is that?)

zbMATH Keywords

matchingunification problemunification algorithm for terms involving a commutative function

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Decidability of theories and sets of sentences (03B25)

Cited In (5)

• What is essential unification?
• A formalisation of nominal C-matching through unification with protected variables
• Formalising nominal C-unification generalised with protected variables
• Decidability of confluence and termination of monadic term rewriting systems
• Deciding the word problem for ground and strongly shallow identities w.r.t. extensional symbols

This page was built for publication:

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