scientific article; zbMATH DE number 517077

MaRDI QIDQ4282607zbMATH OpenFDO

Authors Jean Goubault-Larrecq

Publication date 17 March 1994

zbMATH Keywords

completenesscongruence closure algorithmNP-completenessrigid E-unificationtermination

Mathematics Subject Classification ID

Recommendations

• scientific article; zbMATH DE number 1614698
• scientific article; zbMATH DE number 1552529
• Efficient algorithms for bounded rigid E-unification
• What you always wanted to know about rigid \(E\)-unification
• What you always wanted to know about rigid \(E\)-unification

Cited in

(10)

• scientific article; zbMATH DE number 1614698 (Why is no real title available?)
• Fault-tolerant aggregate signatures
• Congruence closure with free variables
• Efficient algorithms for bounded rigid E-unification
• Cyclic connections
• A completion-based method for mixed universal and rigid \(E\)-unification
• What you always wanted to know about rigid \(E\)-unification
• RIGID REACHABILITY, THE NON-SYMMETRIC FORM OF RIGID E-UNIFICATION
• The undecidability of simultaneous rigid E-unification
• Rigid E-unification: NP-completeness and applications to equational matings

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 Q4282607)