989 search results - page 95 / 198 » Pebbling and Proofs of Work |
CL
2000
Springer
14 years 14 days ago
2000
Springer
How to extract negative information from programs is an important issue in logic programming. Here we address the problem for functional logic programs, from a proof-theoretic pers...
AISC
2010
Springer
14 years 14 days ago
2010
Springer
General purpose theorem provers provide sophisticated proof methods, but lack some of the advanced structuring mechanisms found in specification languages. This paper builds on pr...
SIBGRAPI
1999
IEEE
14 years 12 days ago
1999
IEEE
Abstract. In this work we study the problem of reconstructing an image from a perceptual segmentation based on a geometric classification of its points using non-linear curvature f...
TLCA
1999
Springer
14 years 11 days ago
1999
Springer
In this paper we present a strongly normalising cut-elimination procedure for classical logic. This procedure adapts Gentzen’s standard cut-reductions, but is less restrictive th...
KR
1998
Springer
14 years 10 days ago
1998
Springer
In this paper, we propose a definition of goal achievability: given a basic action theory describing an initial state of the world and some primitive actions available to a robot,...