188 search results - page 4 / 38 » What Is a Skeptical Proof |
127
click to vote
TYPES
1998
Springer
15 years 4 months ago
1998
Springer
Investigating soundness and completeness of verification calculi for imperative programming languages is a challenging task. Incorrect results have been published in the past. We t...
93
Voted
JCT
2007
15 years 17 days ago
2007
Given a sequence of integers b = (b0,b1,b2,...) one gives a Dyck path P of length 2n the weight wt(P) = bh1 bh2 ···bhn , where hi is the height of the ith ascent of P. The corr...
113
Voted
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. We investigate the question of what constitutes a proof when quantifiers and multiplicative units are both present. On the technical level this paper provides two new as...
89
Voted
SYNASC
2007
IEEE
15 years 7 months ago
2007
IEEE
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
110
click to vote
KR
1998
Springer
15 years 4 months 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,...