23201 search results - page 48 / 4641 » Rewriting Systems with Data |
101
Voted
CAD
2010
Springer
15 years 27 days ago
2010
Springer
We present a new constructive solving approach for systems of 3D geometric constraints. The solver is based on the cluster rewriting approach, which can efficiently solve large sy...
104
Voted
ENTCS
2008
15 years 25 days ago
2008
Semantic labeling is a powerful transformation technique for proving termination of term rewrite systems. The semantic part is given by a model or a quasi-model of the rewrite rul...
91
Voted
RTA
2010
Springer
15 years 4 months ago
2010
Springer
For the whole class of linear term rewriting systems and for each integer k, we define k-bounded rewriting as a restriction of the usual notion of rewriting. We show that the k-bo...
CORR
2006
Springer
15 years 25 days ago
2006
Springer
In a previous work, the first author extended to higher-order rewriting and dependent types the use of size annotations in types, a termination proof technique called type or size ...
83
Voted
PG
2002
IEEE
15 years 5 months ago
2002
IEEE
Lworld is a computer graphics animation system based on L-systems, a parallel rewriting technique used primarily in computer graphics for plant modeling. Because rulebased program...