Efficient general AGH-unification
From MaRDI portal
Publication:462489
DOI10.1016/J.IC.2014.07.008zbMATH Open1360.94321OpenAlexW2004781946WikidataQ118190368 ScholiaQ118190368MaRDI QIDQ462489FDOQ462489
Authors: Zhiqiang Liu, Christopher Lynch 
Publication date: 20 October 2014
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2014.07.008
Recommendations
- scientific article; zbMATH DE number 7471678
- 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
- All about Maude -- a high-performance logical framework. How to specify, program and verify systems in rewriting logic. With CD-ROM.
- Rewriting
- Unification algorithms cannot be combined in polynomial time
- Unification in Boolean rings and Abelian groups
- Unification in a combination of arbitrary disjoint equational theories
- Handbook of automated reasoning. In 2 vols
- Unification in commutative theories
- Maude-NPA: Cryptographic Protocol Analysis Modulo Equational Properties
- Title not available (Why is that?)
- Title not available (Why is that?)
- A criterion for intractability of E-unification with free function symbols and its relevance for combination of unification algorithms
- Unification and matching modulo nilpotence
- Efficient general unification for XOR with homomorphism
- Unification in monoidal theories
Cited In (6)
Uses Software
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)
