Skip to main content
Article thumbnail
Location of Repository

Decidable Matching for Convergent Systems

By Nachum Dershowitz, Subrata Mitra and G. Sivakumar

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 wegive are weakened

Year: 1992
OAI identifier: oai:CiteSeerX.psu:10.1.1.32.4774
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.math.tau.ac.il/~nac... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.