769 search results - page 41 / 154 » Where Is the Proof |
AIML
2008
13 years 10 months ago
2008
In 1983, Valentini presented a syntactic proof of cut-elimination for a sequent calculus GLSV for the provability logic GL where we have added the subscript V for "Valentini&q...
TCS
2010
13 years 7 months ago
2010
We give a new construction of strongly aperiodic set of tiles in H2 , exhibiting a kind of hierarchical structure, simplifying the central framework of Margenstern’s proof that t...
ANOR
2002
13 years 8 months ago
2002
Abstract. The generic hoist scheduling problem is NP-hard and arises from automated manufacturing lines. In recent work using the constraint logic programming (CLP) formalism, a un...
ECOOP
2005
Springer
14 years 2 months ago
2005
Springer
Traits support the factoring out of common behaviour, and its integration into classes in a manner that coexists smoothly with inheritance-based structuring mechanisms. We designed...
PKC
2012
Springer
11 years 11 months ago
2012
Springer
We define a new notion of relatively-sound non-interactive zeroknowledge (NIZK) proofs, where a private verifier with access to a trapdoor continues to be sound even when the Ad...