9 search results - page 2 / 2 » Higher-Order Narrowing |
158
Voted
TPHOL
2007
IEEE
16 years 19 days ago
2007
IEEE
Abstract. In this proof pearl, we demonstrate the power of higherorder encodings in the logical framework Twelf[PS99] by investigating proofs about an algorithmic specification of...
193
Voted
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
This paper addresses the segmentation from an image of entities that have the form of a `network', i.e. the region in the image corresponding to the entity is composed of bran...
197
Voted
IJCV
2010
15 years 4 months ago
2010
This paper addresses the segmentation from an image of entities that have the form of a ‘network’, i.e. the region in the image corresponding to the entity is composed of bran...
165
Voted
CSL
2007
Springer
16 years 16 days ago
2007
Springer
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...