1000 search results - page 52 / 200 » Nominal rewriting systems |
RTA
1987
Springer
13 years 11 months ago
1987
Springer
We present completion methods for rewriting modulo a congruence, generalizing previous methods by Peterson and Stickel (1981) and Jouannaud and Kirchner (1986). We formalize our me...
SIAMCO
2011
13 years 2 months ago
2011
Given a nominal plant, together with a fixed neighborhood of this plant, the problem of robust stabilization is to find a controller that stabilizes all plants in that neighborh...
ICCS
2003
Springer
14 years 25 days ago
2003
Springer
Several software systems have been developed recently for the automated generation of combustion reactions kinetic mechanisms using different representations of species and reacti...
IASTEDSEA
2004
13 years 9 months ago
2004
Program transformation through the repeated application of simple rewrite rules is conducive to formal verification. In practice, program transformation oftentimes requires data t...
EMNLP
2006
13 years 9 months ago
2006
This paper explores the use of two graph algorithms for unsupervised induction and tagging of nominal word senses based on corpora. Our main contribution is the optimization of th...