Record Details

DECIDABLE MATCHING FOR CONVERGENT SYSTEMS - PRELIMINARY VERSION

DSpace at IIT Bombay

View Archive Info
 
 
Field Value
 
Title DECIDABLE MATCHING FOR CONVERGENT SYSTEMS - PRELIMINARY VERSION
 
Creator DERSHOWITZ, N
MITRA, S
SIVAKUMAR, G
 
Description 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.
 
Publisher SPRINGER VERLAG
 
Date 2011-08-30T08:18:55Z
2011-12-26T12:58:51Z
2011-12-27T05:49:29Z
2011-08-30T08:18:55Z
2011-12-26T12:58:51Z
2011-12-27T05:49:29Z
1992
 
Type Article
 
Identifier LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 607(), 589-602
http://dspace.library.iitb.ac.in/xmlui/handle/10054/12251
http://hdl.handle.net/10054/12251
 
Language en