Hubert Comon  Home/Search
Context Related
| lsv.enscachan.fr/Publis...Comcirs1.ps lsv.enscachan.fr/~comon/ftp...cirs1.ps 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: weblifac.enscac...publisalllsv (more) From: lsv.enscachan.fr/~comon...biblio (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this paper how to drop these restrictions. In addition, it turns out that our solution is also a partial answer to the divergence of Knuth-Bendix completion, by representing infinite sets of rules as a single constrained rule. As we show below on an example, the deduction rules need to introduce second order variables. However, the fragment of second-order (order-sorted) logic we need to consider is small enough so as to allow a terminating unification algorithm (this is shown in a second part... (Update)
Cited by: More
Can Context Sequence Matching Be Used for XML Querying? - Kutsia, Marin (Correct)
Context Sequence Matching for XML - Kutsia (2005) (Correct)
A Rule-Based Framework for Solving Regular Context Sequence.. - Kutsia, Marin (2006) (Correct)
Active bibliography (related documents): More All
0.5: Equational Formulae with Membership Constraints - Comon, Delor (1994) (Correct)
0.4: Unification of Infinite Sets of Terms Schematized by.. - Hermann, Galbavý (1996) (Correct)
0.3: Inductive Synthesis of Equational Programs - Dershowitz, Pinchover (1990) (Correct)
Similar documents based on text: More All
0.2: Completion of Rewrite Systems with Membership Constraints Part II: .. - Comon (1997) (Correct)
0.2: A Methodological View of Constraint Solving - Comon, al. (1997) (Correct)
0.2: The First-Order Theory of Lexicographic Path Orderings is.. - Comon, Treinen (1997) (Correct)
Related documents from co-citation: More All
28: nite tree automata (context) - Seidl, of - 1989
26: The problem of solvability of equations in a free semigroup (context) - Makanin - 1977
21: Higher-order matching and tree automata - Comon - 1997
BibTeX entry: (Update)
Hubert Comon. Completion of rewrite systems with membership constraints. In Proc. 19th ICALP, Vienna, LNCS 623, 1992. http://citeseer.ist.psu.edu/article/comon97completion.html More
@article{ comon98completion,
author = "H. Comon",
title = "Completion of Rewrite systems with membership constraints. {Part {II}}: Constraint Solving",
journal = "Journal of Symbolic Computation",
volume = "25",
number = "4",
pages = "421--454",
year = "1998",
url = "citeseer.ist.psu.edu/article/comon97completion.html" }
Citations (may not include all citations):788 Rewrite Systems - Nachum, Jean-Pierre - 1990
384 Simple word problems in universal algebras (context) - Donald, Bendix - 1970
63 Order-Sorted Equational Computation (context) - Gert, Goguen et al. - 1989
58 Deduction with symbolic constraints (context) - Claude, Helene et al. - 1990
49 Computational Aspects of an Order-Sorted Logic with Term Dec.. (context) - Manfred - 1988
47 Solving symbolic ordering constraints - Hubert - 1990
23 Satisfiability of systems of ordinal notations with the subt.. (context) - Jean-Pierre, Mitsuhiro - 1991
21 On Unification of Terms with Integer Exponents - Hubert - 1995
15 Logic Programming with recurrence domains (context) - Chen - 1991
15 Dynamically Typed Computations for Order-Sorted Equational P.. - Hintermeier - 1994
1 ene, & Meseguer, Jos (context) - Claude, H'el - 1988
1 18th International Colloquium on Automata (context) - Javier, Monien et al. - 1991
1 Unification of Term Schemes (context) - Gramlich - 1988
1 A unification algorithm for second order monadic terms (context) - Farmer - 1988
1 On Unification of Infinite Sets of Terms and its Application.. (context) - --, Leech et al. - 1992
1 A semantic approach to order-sorted rewriting (context) - Werner - 1993
1 Jean-Pierre (context) - Kokichi, Joseph - 1985
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://weblifac.ens-cachan.fr/Publis/publis-all-lsv.html): More
From Timed Automata to Logic - and Back - Laroussinie, Larsen, al. (1995) (Correct)
The Regular Viewpoint on PA-Processes - Lugiez, Schnoebelen (1998) (Correct)
Decision Problems in Ordered Rewriting - Comon, Narendran, Nieuwenhuis.. (1998) (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