Sciweavers

29 search results - page 3 / 6
» Primitive Rewriting
Sort
View
CAD
2010
Springer
13 years 11 months ago
A non-rigid cluster rewriting approach to solve systems of 3D geometric constraints
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...
Hilderick A. van der Meiden, Willem F. Bronsvoort
ICDE
2006
IEEE
119views Database» more  ICDE 2006»
15 years 3 days ago
Laws for Rewriting Queries Containing Division Operators
Relational division, also known as small divide, is a derived operator of the relational algebra that realizes a many-to-one set containment test, where a set is represented as a ...
Ralf Rantzau, Christoph Mangold
CIKM
2004
Springer
14 years 4 months ago
QFilter: fine-grained run-time XML access control via NFA-based query rewriting
At present, most of the state-of-the-art solutions for XML access controls are either (1) document-level access control techniques that are too limited to support fine-grained sec...
Bo Luo, Dongwon Lee, Wang-Chien Lee, Peng Liu
IFIP
2004
Springer
14 years 4 months ago
Ensuring Termination by Typability
A term terminates if all its reduction sequences are of finite length. We show four type systems that ensure termination of well-typed π-calculus processes. The systems are obtai...
Yuxin Deng, Davide Sangiorgi
TAPSOFT
1993
Springer
14 years 2 months ago
Optimal Reductions in Interaction Systems
Lamping's optimalgraph reduction technique for the -calculus is generalized to a new class of higher order rewriting systems, called Interaction Systems. Interaction Systems ...
Andrea Asperti, Cosimo Laneve