Recommendations
- Efficient full higher-order unification
- A practically efficient and almost linear unification algorithm
- scientific article; zbMATH DE number 1346494
- An improved general E-unification method
- An improved general \(E\)-unification method
- A practical unification algorithm
- Fast algorithms for uniform semi-unification
- An efficient nominal unification algorithm
- Publication:3204025
- Unification in a combination of equational theories: an efficient algorithm
Cites work
- scientific article; zbMATH DE number 3885353 (Why is no real title available?)
- scientific article; zbMATH DE number 1024091 (Why is no real title available?)
- A criterion for intractability of \(E\)-unification with free function symbols and its relevance for combination of unification algorithms
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Efficient general unification for XOR with homomorphism
- Handbook of automated reasoning. In 2 vols
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Rewriting
- Unification algorithms cannot be combined in polynomial time
- Unification and matching modulo nilpotence
- Unification in Boolean rings and Abelian groups
- Unification in a combination of arbitrary disjoint equational theories
- Unification in commutative theories
- Unification in monoidal theories
Cited in
(6)- Unification modulo homomorphic encryption
- scientific article; zbMATH DE number 2043528 (Why is no real title available?)
- Bounded ACh unification
- Efficient general unification for XOR with homomorphism
- Mechanizing Mathematical Reasoning
- scientific article; zbMATH DE number 7453112 (Why is no real title available?)
This page was built for publication: Efficient general AGH-unification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q462489)
