Please use this identifier to cite or link to this item:
|Title:||DECIDABLE MATCHING FOR CONVERGENT SYSTEMS - PRELIMINARY VERSION|
|Citation:||LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 607(), 589-602|
|Abstract:||We provide a simple system, based on transformation rules, which is complete for certain classes of semantic matching problem, 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.|
|Appears in Collections:||Article|
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.