Single versus simultaneous equational unification and equational unification for variable-permuting theories
From MaRDI portal
Publication:1367080
DOI10.1023/A:1005764526878zbMATH Open0882.68079MaRDI QIDQ1367080FDOQ1367080
Authors: Paliath Narendran, Friedrich Otto 
Publication date: 4 February 1998
Published in: Journal of Automated Reasoning (Search for Journal in Brave)
Recommendations
- Unification in a combination of arbitrary disjoint equational theories
- scientific article; zbMATH DE number 4080961
- Unification in a combination of equational theories: an efficient algorithm
- scientific article; zbMATH DE number 4049131
- scientific article; zbMATH DE number 3930372
- scientific article
- Unification in permutative equational theories is undecidable
- Some results on equational unification
- Term Rewriting and Applications
- scientific article; zbMATH DE number 3900185
Cited In (14)
- Title not available (Why is that?)
- On equational theories, unification, and (un)decidability
- Unification and Matching Modulo Leaf-Permutative Equational Presentations
- Some results on equational unification
- Title not available (Why is that?)
- \(E\)-unification with constants vs. general \(E\)-unification
- The STO-problem is NP-hard
- Matching - a special case of unification?
- Permutative rewriting and unification
- Complexity of linear standard theories
- Unification in permutative equational theories is undecidable
- Variant-based equational anti-unification
- Some independence results for equational unification
- Title not available (Why is that?)
This page was built for publication: Single versus simultaneous equational unification and equational unification for variable-permuting theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367080)
