3552 search results - page 521 / 711 » Proof theory in the abstract |
181
click to vote
MICCAI
2008
Springer
16 years 7 months ago
2008
Springer
Abstract. In this paper, we explore the use of over-complete spherical wavelets in shape analysis of closed 2D surfaces. Previous work has demonstrated, theoretically and practical...
170
click to vote
DAC
2002
ACM
16 years 7 months ago
2002
ACM
The ForSyDe methodology has been developed for system level design. In this paper we present formal transformation methods for the refinement of an abstract and formal system mode...
173
click to vote
PODC
2009
ACM
16 years 7 months ago
2009
ACM
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
161
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. Automata-based decision procedures commonly achieve optimal complexity bounds. However, in practice, they are often outperformed by sub-optimal (but more local-search bas...
181
click to vote
CADE
2007
Springer
16 years 6 months ago
2007
Springer
Abstract. In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equ...