Subrata Mitra  Home/Search
Context Related
| uiuc.edu/~nachum/p...mitrathesis.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: uiuc.edu/~nachum/papers/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: ing AC-goals : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 66 5.4 Transformations for non-AC goals : : : : : : : : : : : : : : : : : : : : : : : : : : 67 5.5 Transformation rules for AC-goals : : : : : : : : : : : : : : : : : : : : : : : : : : 68 5.6 Using constraints to prune AC-goals : : : : : : : : : : : : : : : : : : : : : : : : : 72 5.7 Transformation rules for constraints : : : : : : : : : : : : : : : : : : : : : : : : : 72 8.1 Inference rules for validity of ! : :... (Update)
Context of citations to this paper: More
...narrowing strategy whose search space is always finite. As regards non finitary theories, a decidability result is established by Mitra [16, 21] for constructorbased rewrite systems, assuming that, for every function symbol f , there is at most one rewrite rule among the rules...
...t, #) where f(l 1 , l m ) r is a renamed rule in R. 6 The above rules are a subset of the transformation rules used in [DS87, MMR89, Mit94] for semantic unification. They yield a complete forwarddecomposition calculus for solving goals of the form s = N , where N is...
Cited by: More
Deciding Fundamental Properties of Right-(Ground or - Variable Rewrite Systems (Correct)
Jeopardy: Inverting Mildly Deep Definitions - Dershowitz, Mitra (1999) (Correct)
E-Unification by Means of Tree Tuple Synchronized Grammars - Limet, Réty (1996) (Correct)
Active bibliography (related documents): More All
1.4: Matching and Unification in Rewrite Theories - Mitra, Dershowitz (Correct)
1.2: The Integration of Functions into Logic Programming: A Survey - Hanus (1994) (Correct)
1.0: Rewrite Systems - Dershowitz, Jouannaud (1990) (Correct)
Similar documents based on text: More All
0.2: Application of Concurrent Engineering in New Automobile Design - Subrata Mitra And (2002) (Correct)
0.1: Semantic Matching in Rewrite Theories - Mitra, Dershowitz (1997) (Correct)
0.1: Mitra: A Scalable Continuous Media Server - Ghandeharizadeh, Zimmermann.. (1997) (Correct)
Related documents from co-citation: More All
10: Rewrite systems - Dershowitz, Jouannaud - 1990
7: Logic Programming with Functions and Predicates: The language Babel (context) - Moreno-Navarro, Rodr'iguez-Artalejo - 1992
7: A Needed Narrowing Strategy - Antoy, Echahed et al. - 1994
BibTeX entry: (Update)
S. Mitra. Semantic Unification for Convergent System. Technical Report CS-R-94-1855, University of Illinois at Urbana-Champaign, 1994. http://citeseer.ist.psu.edu/mitra94semantic.html More
@techreport{ mitra94semantic,
author = "Subrata Mitra",
title = "Semantic unification for convergent systems",
number = "UIUCDCS-R-94-1855",
year = "1994",
url = "citeseer.ist.psu.edu/mitra94semantic.html" }
Citations (may not include all citations):1911 Introduction to automata theory (context) - Hopcroft, Ullman - 1979
788 Rewrite systems - Dershowitz, Jouannaud - 1990
634 A machine oriented logic based on the resolution principle (context) - Robinson - 1965
474 Term rewriting systems - Klop - 1992
363 Programming in Prolog (context) - Clocksin, Mellish - 1981
362 ML for the working programmer (context) - Paulson - 1991
214 Orderings for term-rewriting systems (context) - Dershowitz - 1982
174 A unification algorithm for typed -calculus (context) - Huet - 1975
172 Journal of Symbolic Computation (context) - Dershowitz, rewriting - 1987
170 ACM Transactions on Programming Languages and Systems (context) - Martelli, Montanari et al. - 1982
151 Proving termination with multiset orderings (context) - Dershowitz, Manna - 1979
134 Unification theory - Baader, Siekmann - 1993
126 Canonical forms and unification (context) - Hullot - 1980
125 Solving equations in abstract algebras: a rule-based survey .. (context) - Jouannaud, Kirchner - 1991
114 Building in equational theories (context) - Plotkin - 1972
105 The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
85 On proving term rewriting systems are Noetherian (context) - Lankford - 1979
82 Journal of Computer and System Sciences (context) - Paterson, Wegman - 1978
81 Slog: a logic programming language interpreter based on clau.. (context) - Fribourg - 1985
76 Equations and rewrite rules: a survey (context) - Huet, Oppen - 1980
67 Paramodulation and theorem proving in first order theories w.. (context) - Robinson, Wos - 1969
62 A unification algorithm for associative-commutative function.. (context) - Stickel - 1981
58 Termination of rewriting systems by polynomial interpretatio.. (context) - Cherifa, Lescanne - 1987
56 Higher-order unification revisited: complete sets of transfo.. (context) - Snyder, Gallier - 1989
55 Combining algebra and higher-order types (context) - Breazu-Tannen - 1988
54 First-order unification in an equational theory (context) - Fay - 1979
48 Basic narrowing revisited (context) - Nutt, R'ety et al. - 1989
47 A rationale for conditional equational programming (context) - Dershowitz, Okada - 1990
46 Complete sets of transformations for general E-unification (context) - Gallier, Snyder - 1989
43 Termination orderings for associative-commutative rewrite sy.. (context) - Bachmair, Plaisted - 1985
42 Journal of Symbolic Computation (context) - Siekmann - 1989
41 A precedence-based total ACcompatible ordering (context) - Rubio, Nieuwenhuis - 1993
38 Canonical conditional rewrite systems (context) - Dershowitz, Okada et al. - 1988
37 Third-order matching is decidable - Dowek - 1992
36 RRL: a rewrite rule laboratory (context) - Kapur, Zhang - 1987
35 Logic programming: Functions (context) - DeGroot, Lindstrom - 1986
33 Extension of the associative path ordering to a chain of ass.. (context) - Delor, Puel - 1993
32 Confluence of conditional rewrite systems (context) - Dershowitz, Okada et al. - 1987
29 The relation between logic and functional languages: a surve.. (context) - Bellia, Levi - 1986
27 Computing unification algorithms (context) - Kirchner - 1986
25 the relationship between logic and functional languages (context) - Reddy - 1986
23 Associative-commutative unification (context) - Fages - 1984
21 On unification of terms with integer exponents - Comon - 1992
19 the recursive decomposition ordering with lexicographic stat.. (context) - Lescanne - 1990
18 A new method for proving termination of AC-rewrite systems (context) - Kapur, Sivakumar et al. - 1990
17 Counterexamples to completeness results for basic narrowing (context) - Middledorp, Hamoen - 1992
17 Solving goals in equational languages (context) - Dershowitz, Sivakumar - 1987
17 Implementation of narrowing: the prolog-based approach - Cheong, Fribourg - 1993
16 Narrowing directed by a graph of terms (context) - Chabin, R'ety - 1991
16 Associative-commutative rewriting (context) - Dershowitz, Hsiang et al. - 1983
15 Equational programming (context) - Dershowitz, Plaisted - 1988
15 Improving basic narrowing techniques (context) - R'ety - 1987
15 Proof methods for equational theories (context) - Bachmair - 1987
14 Programming languages: an interpreter-based approach (context) - Kamin - 1990
14 Some termination criteria for narrowing and E-narrowing (context) - Christian - 1992
13 Associative-commutative reduction orderings (context) - Bachmair - 1992
13 Decidable matching for convergent systems - Dershowitz, Mitra et al. - 1992
13 An optimal narrowing strategy for general canonical systems (context) - Bockmayr, Krischer et al. - 1992
12 Funlog: a computational model integrating logic programming .. (context) - Subrahmanyam, You - 1986
11 Higher-order unification via combinators - Dougherty - 1993
11 Higher-order E-unification (context) - Snyder - 1990
11 Lazy unification algorithms for canonical rewrite systems (context) - Martelli, Rossi et al. - 1989
10 Leaf: a language which integrates logic (context) - Barbuti, Bellia et al. - 1986
10 Modular higher-order E-unification (context) - Nipkow, Qian - 1991
10 The undecidability of the unification and matching problem f.. (context) - Heilbrunner, Holldobler - 1987
10 Decidable problems in shallow equational theories (context) - Comon, Haberstrau et al. - 1991
9 From unification in combination of equational theories to a .. (context) - Kirchner - 1989
9 Logic programming by completion (context) - Dershowitz, Josephson - 1984
7 Theoretical Computer Science (context) - Baader, Buttner et al. - 1988
7 An improved general Eunification method - Dougherty, Johann - 1990
7 Functional programming and the logical variable (context) - Lindstrom - 1985
6 Refined strategies for semantic unification (context) - Bosco, Giovanneti et al. - 1987
6 Journal of Logic Programming (context) - Josephson, Dershowitz et al. - 1989
6 Proofs and computations in conditional equational theories (context) - Sivakumar - 1989
6 A note on a canonical theory with undecidable unification an.. (context) - Bockmayr - 1987
6 Equation solving in conditional AC-theories (context) - Dershowitz, Mitra et al. - 1990
6 A combinatory logic approach to higher-order E-unification - Dougherty, Johann - 1992
6 North Holland Publishing Company (context) - Kowalski, problem - 1979
5 Incremental construction of unification algorithms in equati.. (context) - Jouannaud, Kirchner et al. - 1983
5 the relation between primitive recursion (context) - Hermann - 1992
5 A unification algorithm for confluent theories (context) - Holldobler - 1987
5 Unification problems with one-sided distributivity (context) - Arnborg, Tid'en - 1985
4 unification based on a reduction to AC1-unification (context) - Contejean, solution et al. - 1992
4 Unification of commutative terms (context) - Siekmann - 1979
3 Higher-order and semantic unification (context) - Dershowitz, Mitra - 1993
3 Prentice-Hall International Series in Computer Science (context) - Henderson, application - 1980
3 Universal unification and classification of equational theor.. (context) - Siekmann, Szab'o - 1984
3 Goal-directed equation solving (context) - Dershowitz, Sivakumar - 1988
3 ACM SIGSAM Bulletin (context) - Kapur, Narendran et al. - 1987
3 Top-down equation solving and extensions to associative and .. (context) - Mitra - 1990
3 A new equational unification method: a generalization of Mar.. (context) - Kirchner - 1984
3 Unification in idempotent semigroups is of type zero (context) - Baader - 1986
2 A proof theory for general E-unification (context) - Snyder - 1991
2 Path orderings for termination of associative-commutative re.. (context) - Dershowitz, Mitra - 1992
2 Adding algebra to the untyped lambda-calculus (context) - Dougherty - 1991
1 AC-equation solving (context) - Mitra, Sivakumar - 1991
1 Max-Plank Institute fur Informatik (context) - Socher-Ambrosius, terms et al. - 1993
1 unification revisited (context) - Hsiang, Jouannaud - 1988
1 Presonal Communication (context) - Hanus - 1993
1 modules and generics for logic programming (context) - Goguen, Meseguer et al. - 1984
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www-sal.cs.uiuc.edu/~nachum/papers/): More
Hierarchical Termination - Dershowitz (1995) (Correct)
Logical Debugging - Lee, Dershowitz (Correct)
Rewrite, Rewrite, Rewrite, Rewrite, Rewrite, ... - Dershowitz, al. (1989) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC