@inproceedings{29202d9fec4f4e9f8fcb57a1b2c736bb,
title = "Combining matching algorithms: The regular case",
abstract = "The problem of combining matching algorithms for equational theories with disjoint signatures is studied. It is shown that the combined matching problem is in general undecidable but that it becomes decidable if all theories are regular. For the case of regular theories an efficient combination algorithm is developed. As part of that development we present a simple algorithm for solving the word problem in the combination of arbitrary equational theories with disjoint signatures.",
author = "Tobias Nipkow",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1989.; 3rd International Conference on Rewriting Techniques and Applications, RTA 1989 ; Conference date: 03-04-1989 Through 05-04-1989",
year = "1989",
doi = "10.1007/3-540-51081-8_118",
language = "English",
isbn = "9783540510819",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "343--358",
editor = "Nachum Dershowitz",
booktitle = "Rewriting Techniques and Applications - 3rd International Conference, RTA 1989",
}