Cycle unification

DOI10.1007/3-540-55602-8_158MaRDI QIDQ4264713zbMATH OpenFDO

Authors Wolfgang Bibel, Steffen Hölldobler, Jörg Würtz

Publication date 7 October 1999

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

Full work available at URL https://doi.org/10.1007/3-540-55602-8_158

Mathematics Subject Classification ID

Logic in computer science (03B70) Grammars and rewriting systems (68Q42)

Recommendations

• Reduction of cycle unification of type \(Cpg+r\)
• Primal grammars and unification modulo a binary clause
• General E-unification with eager variable elimination and a nice cycle rule
• scientific article; zbMATH DE number 4060703
• scientific article; zbMATH DE number 475191

Cited in

(9)

• Weighted systems of equations
• Reduction of cycle unification of type \(Cpg+r\)
• Thue trees
• Unprovability results for clause set cycles
• Satisfiability of the smallest binary program
• scientific article; zbMATH DE number 3855267 (Why is no real title available?)
• More problems in rewriting
• Detecting non-provable goals
• Primal grammars and unification modulo a binary clause

This page was built for publication: Cycle unification

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