Results 1  10
of
2,513
Rewrite rules
"... Towards a homotopical theory of computation based on higher dimensional categories alphabet Σ Word rewriting rules R = {r: u → v} termination: u → * û confluence: û is unique 〈a  a2 = 1 〉 + (integers modulo 2, or permutations of 2 elements); ..."
Abstract
 Add to MetaCart
Towards a homotopical theory of computation based on higher dimensional categories alphabet Σ Word rewriting rules R = {r: u → v} termination: u → * û confluence: û is unique 〈a  a2 = 1 〉 + (integers modulo 2, or permutations of 2 elements);
Rewrite rules
"... • Describe the structure of sentences and explore ways of characterizing all the legal structures in a language – How a sentence is broken into its major subparts/constituents? ..."
Abstract
 Add to MetaCart
• Describe the structure of sentences and explore ways of characterizing all the legal structures in a language – How a sentence is broken into its major subparts/constituents?
Learning Plan Rewriting Rules
 In Artificial Intelligence Planning Systems
, 2000
"... Planning by Rewriting (PbR) is a new paradigm for efficient highquality planning that exploits plan rewriting rules and efficient local search techniques to transform an easytogenerate, but possibly suboptimal, initial plan into a highquality plan. Despite the advantages of PbR in terms of scala ..."
Abstract

Cited by 27 (2 self)
 Add to MetaCart
Planning by Rewriting (PbR) is a new paradigm for efficient highquality planning that exploits plan rewriting rules and efficient local search techniques to transform an easytogenerate, but possibly suboptimal, initial plan into a highquality plan. Despite the advantages of PbR in terms
Scoped Dynamic Rewrite Rules
 Rule Based Programming (RULE’01), volume 59/4 of Electronic Notes in Theoretical Computer Science
, 2001
"... The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the contextfree nature of rewrite rules. The first problem is addressed by languages supporting userdefinable rewriting strategies. This paper addresses the second problem b ..."
Abstract

Cited by 20 (9 self)
 Add to MetaCart
The applicability of term rewriting to program transformation is limited by the lack of control over rule application and by the contextfree nature of rewrite rules. The first problem is addressed by languages supporting userdefinable rewriting strategies. This paper addresses the second problem
An Efficient Compiler for Weighted Rewrite Rules
 IN 34TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS
, 1996
"... Contextdependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finitestate transducers (FSTs). We describe a new algorithm for compilin ..."
Abstract

Cited by 77 (24 self)
 Add to MetaCart
Contextdependent rewrite rules are used in many areas of natural language and speech processing. Work in computational phonology has demonstrated that, given certain conditions, such rewrite rules can be represented as finitestate transducers (FSTs). We describe a new algorithm
Learning Plan Rewriting Rules
"... Considerable work has been done to automatically learn domainspecific knowledge to improve the performance of domain independent problem solving systems. However, most of this work has focussed on learning search control knowledgeknowledge that can be used by a problem solving system during sear ..."
Abstract
 Add to MetaCart
search to improve its performance. An alternative approach to improving the performance of domain independent systems is by using rewriting rules. These are the rules that can be used by a problem solving system after generating an initial solution in order to transform it into a higher quality
Tiles, Rewriting Rules and CCS
"... In [12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of concurrency theory, and our formalism recollects many properties ..."
Abstract

Cited by 14 (8 self)
 Add to MetaCart
In [12] we introduced the tile model, a framework encompassing a wide class of computational systems, whose behaviour can be described by certain rewriting rules. We gathered our inspiration both from the world of term rewriting and of concurrency theory, and our formalism recollects many
An Overview of Rewrite Rule Laboratory (RRL)
 J. of Computer and Mathematics with Applications
, 1995
"... RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical proble ..."
Abstract

Cited by 70 (25 self)
 Add to MetaCart
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical
An explicit Eta rewrite rule
, 1994
"... : In this report, we extend calculi of explicit substitutions by an Eta rule. We do this in the framework of AE, a calculus of explicit substitutions introduced by Lescanne (1994) and thoroughly studied by Lescanne and RouyerDegli (1994). The main feature of such a calculus is that the classical ..."
Abstract
 Add to MetaCart
ficontraction is expressed by a firstorder term rewriting system. Our main result is the explicitation of the jcontraction by means of an unconditional, generic Eta rewrite rule and of an extension of the substitution calculus, AE. Previous definitions of Eta are due to Hardin (1992) and R
Transducers from Rewrite Rules with Backreferences
, 1999
"... Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing. ..."
Abstract

Cited by 30 (5 self)
 Add to MetaCart
Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing.
Results 1  10
of
2,513