Sciweavers

2000 search results - page 344 / 400
» Program Transformation and Proof Transformation
Sort
View
128
Voted
CADE
1998
Springer
15 years 7 months ago
System Description: leanK 2.0
Abstract. leanK is a "lean", i.e., extremely compact, Prolog implementation of a free variable tableau calculus for propositional modal logics. leanK 2.0 includes additio...
Bernhard Beckert, Rajeev Goré
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 7 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
ATAL
2006
Springer
15 years 7 months ago
Multiply-constrained distributed constraint optimization
Distributed constraint optimization (DCOP) has emerged as a useful technique for multiagent coordination. While previous DCOP work focuses on optimizing a single team objective, i...
Emma Bowring, Milind Tambe, Makoto Yokoo
127
Voted
CCS
2008
ACM
15 years 5 months ago
Multi-use unidirectional proxy re-signatures
In 1998, Blaze, Bleumer, and Strauss suggested a cryptographic primitive termed proxy re-signature in which a proxy transforms a signature computed under Alice's secret key in...
Benoît Libert, Damien Vergnaud
EACL
1989
ACL Anthology
15 years 4 months ago
On The Generative Power Of Two-Level Morphological Rules
Koskenniemi's model of two-level morphology has been very influential in recent years, but definitions of the formalism have generally been phrased in terms of a compilation ...
Graeme D. Ritchie