10715 search results - page 371 / 2143 » Proofs from Tests |
198
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...
150
click to vote
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...
163
click to vote
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 ...
189
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...
187
click to vote
ENTCS
2008
15 years 7 months ago
2008
Following earlier work, a modal logic for T-coalgebras is a functor L on a suitable variety. Syntax and proof system of the logic are given by presentations of the functor. This p...