11740 search results - page 8 / 2348 » More Problems in Rewriting |
ACL
1996
13 years 8 months ago
1996
Context-dependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, ...
RTA
1995
Springer
13 years 11 months ago
1995
Springer
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
EPIA
1993
Springer
13 years 11 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
VLDB
2005
ACM
14 years 29 days ago
2005
ACM
As a simple XML query language but with enough expressive power, XPath has become very popular. To expedite evaluation of XPath queries, we consider the problem of rewriting XPath...
ENTCS
2008
13 years 7 months ago
2008
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...