Decidable matching for convergent systems

Nachum Dershowitz, Subrata Mitra, G. Sivakumar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations


We provide a simple system, based on transformation rules, which is complete 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 also use this transformation system to describe decision procedures for semantic matching problems. We give counterexamples to show that semantic matching becomes undecidable (as it generally is) when the conditions we give are weakened. Our main result pertains to convergent systems with variable preserving rules, with some particular patterns of defined functions on the right hand sides.

Original languageEnglish
Title of host publicationAutomated Deduction — CADE-11 - 11 th International Conference on Automated Deduction, Proceedings
EditorsDeepak Kapur
PublisherSpringer Verlag
Number of pages14
ISBN (Print)9783540556022
StatePublished - 1992
Externally publishedYes
Event11th International Conference on Automated Deduction, CADE, 1992 - Saratoga Springs, United States
Duration: 15 Jun 199218 Jun 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume607 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference11th International Conference on Automated Deduction, CADE, 1992
Country/TerritoryUnited States
CitySaratoga Springs


FundersFunder number
U. S. National Science FoundationCGR-90-07195, CCR-90-24271


    Dive into the research topics of 'Decidable matching for convergent systems'. Together they form a unique fingerprint.

    Cite this