13383 search results - page 287 / 2677 » Abstractions from proofs |
196
click to vote
ESOP
2008
Springer
15 years 8 months ago
2008
Springer
A data structure is said to be persistent when any update operation returns a new structure without altering the old version. This paper introduces a new notion of persistence, cal...
145
Voted
AAAI
2004
15 years 8 months ago
2004
We have recently proposed augmenting clauses in a Boolean database with groups of permutations, the augmented clauses then standing for the set of all clauses constructed by actin...
161
Voted
AIPS
2004
15 years 8 months ago
2004
We show that for conditional planning with partial observability the existence problem of plans with success probability 1 is 2-EXP-complete. This result completes the complexity ...
184
click to vote
SODA
1998
ACM
15 years 8 months ago
1998
ACM
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
149
click to vote
JAPLL
2006
15 years 6 months ago
2006
Deduction chains represent a syntactic and in a certain sense constructive method for proving completeness of a formal system. Given a formula , the deduction chains of are built...