882 search results - page 114 / 177 » A Taste of Rewrite Systems |
GPEM
2007
13 years 8 months ago
2007
We present a novel means of algorithmically describing a growth process that is an extension of Lindenmayer’s Map L-systems. This growth process relies upon a set of rewrite rule...
CORR
1998
Springer
13 years 8 months ago
1998
Springer
Abstract. This paper presents a novel formalization of optimality theory. Unlike previous treatments of optimality in computational linguistics, starting with Ellison 1994 , the n...
CONCUR
2004
Springer
14 years 2 months ago
2004
Springer
We develop new methods to statically bound the resources needed for the execution of systems of concurrent, interactive threads. Our study is concerned with a synchronous model of ...
RTA
2010
Springer
14 years 19 days ago
2010
Springer
In usual proof systems, like the sequent calculus, only a very limited way of combining proofs is available through the tree structure. We present in this paper a logicindependent ...
KES
2006
Springer
13 years 8 months ago
2006
Springer
In this paper, in order to reduce the explosive increase of the search space as the input dimension grows, we present a new representation method for the structure of fuzzy rules, ...