Hubert Comon  Home/Search
Context Related
| lsv.enscachan.fr/Publis...Comcirs2.ps lsv.enscachan.fr/~comon/ftp...cirs2.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 is to show how to solve the constraints that are involved in the deduction mechanism of the first part. This may be interesting in its own since this provides with a unification algorithm for an order-sorted logic with context variables and can be read independently of the first part. This can also be compared with unification of term schemes of various kind (Chen & Hsiang, 1991; Salzer, 1992; Comon, 1995; R. Galbav'y and M. Hermann, 1992). Indeed, (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)
Similar documents based on text: More All
0.2: Completion of Rewrite Systems with Membership Constraints Part I.. - Comon (1997) (Correct)
0.2: A Methodological View of Constraint Solving - Comon, al. (1997) (Correct)
0.2: Ground Reducibility is EXPTIME-complete - Comon, Jacquemard (1998) (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/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/comon97completion.html" }
Citations not processed or no citations identified.
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