513 search results - page 56 / 103 » Finitely Based, Finite Sets of Words |
CADE
2009
Springer
16 years 13 days ago
2009
Springer
Abstract. Saturation-based calculi such as superposition can be successfully instantiated to decision procedures for many decidable fragments of first-order logic. In case of termi...
107
click to vote
CSL
2010
Springer
15 years 28 days ago
2010
Springer
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
105
click to vote
DCG
2010
14 years 9 months ago
2010
Fix a finite set of points in Euclidean n-space En , thought of as a point-cloud sampling of a certain domain D En . The VietorisRips complex is a combinatorial simplicial complex...
158
click to vote
IEEECGIV
2005
IEEE
15 years 5 months ago
2005
IEEE
We use two fourth order geometric partial differential equations to efficiently solve several surface modelling problems, including the surface blending, the N-sided hole fillin...
ICAT
2003
IEEE
15 years 5 months ago
2003
IEEE
This study presents a haptic simulator for learning palpation of aorta in cardiovascular surgery and performs quantitative evaluation in educational use through some user study. T...