Semantic Matching for Left-Linear Convergent Rewrite Systems
نویسندگان
چکیده
In this paper a calculus for solving the semantic matching problem with respect to left-linear or variable-preserving convergent termrewriting systems is presented. Narrowing calculi usually use advanced selection rules to reduce the search space. Our approach to designing a special calculus for special goals is another way of reducing the efficiency defects of narrowing. Our calculus constructs derivations in
منابع مشابه
A Semantic Matching Algorithm : Analysis
A decision procedure for a class of semantic matching problems was proposed in 3], but it yielded eeciency problems, principally because of redundancies. We present in this paper a new semantic matching algorithm for a restricted class of convergent rewrite systems, its theoretical properties, and an eecient implementation. This class of rewrite systems is particularly interesting for functiona...
متن کاملDecidable Matching for Convergent Systems
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.
متن کاملSemantic Matching in Rewrite Theories
\Semantic matching" is the process of generating a basis set of substitutions (of terms for variables) that makes one term equal to another in a speci ed theory. We restrict ourselves here to matching problems in equational theories that can be presented as programs in the form of convergent rewrite systems, that is, nite sets of equations that compute unique output values when applied (from le...
متن کاملMatching and Uni cation in Rewrite Theories
\Semantic uni cation" is the process of generating a basis set of substitutions (of terms for variables) that makes two given terms equal in a speci ed theory. Semantic uni cation is an important component of some theorem provers. \Semantic matching," a simpler variant of uni cation, where the substitution is made in only one of the terms, has potential usage in programming language interpreter...
متن کاملOn Modularity in Term Rewriting and Narrowing
We introduce a modular property of equational proofs called modularity of normalization for the union of term rewrite systems with shared symbols The idea is that every normalization with R R R may be obtained by rst normalizing with R followed by an R normalization We develop criteria for this that cover non convergent TRS R where as the main restriction R is required to be left linear and con...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Functional and Logic Programming
دوره 1999 شماره
صفحات -
تاریخ انتشار 1999