82 search results - page 2 / 17 » On Wu's Method for Proving Constructive Geometric Theorems |
CONCUR
2010
Springer
13 years 6 months ago
2010
Springer
This paper proposes a geometric solution to the problem of prime decomposability of concurrent processes first explored by R. Milner and F. Moller in [MM93]. Concurrent programs ar...
CCCG
2009
13 years 6 months ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
FOCS
2006
IEEE
13 years 11 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
AISC
2004
Springer
13 years 9 months ago
2004
Springer
Abstract. Origami (paper folding) has a long tradition in Japan's culture and education. We are developing a computational origami system, based on symbolic computation system...
ADG
2006
Springer
13 years 9 months ago
2006
Springer
We present an application of an automatic theorem proving (ATP) in the verification of constructions made with dynamic geometry software (DGS). Given a specification language for g...