1274 search results - page 116 / 255 » New Proofs for |
IPPS
2002
IEEE
15 years 5 months ago
2002
IEEE
We describe the mechanization of recent examples of compositional reasoning, due to Charpentier and Chandy [4]. The examples illustrate a new theory for composition proposed by Ch...
104
Voted
STOC
2000
ACM
15 years 5 months ago
2000
ACM
We propose a new method for proving lower bounds on quantum query algorithms. Instead of a classical adversary that runs the algorithm with one input and then modifies the input,...
102
click to vote
COLT
1999
Springer
15 years 5 months ago
1999
Springer
We consider the problem of learning to predict as well as the best in a group of experts making continuous predictions. We assume the learning algorithm has prior knowledge of the ...
127
click to vote
KRDB
1996
15 years 2 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
102
Voted
BIRTHDAY
2010
Springer
15 years 1 months ago
2010
Springer
Stable models of logic programs have been studied by many researchers, mainly because of their role in the foundations of answer set programming. This is a review of some of the de...