Decidable matching for convergent systems
| Author(s) : | G. Sivakumar Subrata Mitra Nachum Dershowitz, |
| Publisher : | N/A |
| Publication Date : | 1992 |
| ISSN : | N/A |
| Abstract : | We describe decision procedures for certain classes of semantic matching problems, where the equational theory with respect to which the semantic matching is performed has a convergent rewrite system. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. 1, |