1000 search results - page 54 / 200 » Nominal rewriting systems |
115
click to vote
ANLP
2000
15 years 6 months ago
2000
We report on a method for utilising corpora collected in natural settings. It is based on distilling re-writing natural dialogues to elicit the type of dialogue that would occur i...
136
click to vote
VL
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper outlines a method to specify a wide range of diagrams by hypergraphs and diagram dynamics by hypergraph rewrite rules. The specification of a diagram language together ...
152
Voted
WOODPECKER
2001
15 years 6 months ago
2001
Maude is an executable rewriting logic language specially well suited for the specification of object-oriented open and distributed systems. In this paper we explore the possibilit...
132
click to vote
CADE
2010
Springer
15 years 6 months ago
2010
Springer
In this paper we use the decreasing diagrams technique to show that a left-linear term rewrite system R is confluent if all its critical pairs are joinable and the critical pair st...
155
click to vote
DAC
2006
ACM
16 years 6 months ago
2006
ACM
Pareto surfaces in the performance space determine the range of feasible performance values for a circuit topology in a given technology. We present a non-dominated sorting based ...