1916 search results - page 190 / 384 » Reasoning with class algebra |
138
click to vote
BIRTHDAY
2008
Springer
15 years 6 months ago
2008
Springer
As Dag Normann has recently shown, the fully abstract model for PCF of hereditarily sequential functionals is not -complete and therefore not continuous in the traditional terminol...
134
click to vote
CAD
2010
Springer
15 years 4 months 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...
125
click to vote
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
123
click to vote
MICS
2008
15 years 3 months ago
2008
The disambiguation approach to the input of formulae enables users of mathematical assistants to type correct formulae in a terse syntax close to the usual ambiguous mathematical n...
130
click to vote
IJFCS
2010
15 years 2 months ago
2010
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is de ned by a tree bimorphism (Ï...