@inproceedings{50fef3ecc7774b62a7dfbec8b6001577,
title = "Complete sets of unifiers and matchers in equational theories",
abstract = "We propose an abstract framework to present unification and matching problems. We argue about the necessity of a somewhat complicated definition of basis of unifiers (resp. matchers). In particular we prove the non-existence of complete sets of minimal unifiers (resp. matchers) in some equational theories, even regular.",
author = "Fran{\c c}ois Fages and G{\'e}rard Huet",
note = "Publisher Copyright: {\textcopyright} 1983, Springer-Verlag.; 8th Colloquium on Trees in Algebra and Programming, CAAP 1983 ; Conference date: 09-03-1983 Through 11-03-1983",
year = "1983",
month = jan,
day = "1",
doi = "10.1007/3-540-12727-5\_12",
language = "English",
isbn = "9783540127277",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "205--220",
editor = "Marco Protasi and Giorgio Ausiello",
booktitle = "CAAP 1983 - Trees in Algebra and Programming 8th Colloquium, Proceedings",
}