Sciweavers

3228 search results - page 251 / 646
» Computationally Sound Proofs
Sort
View
SEMWEB
2009
Springer
15 years 11 months ago
Axiomatic First-Order Probability
Most languages for the Semantic Web have their logical basis in some fragment of first-order logic. Thus, integrating first-order logic with probability is fundamental for represen...
Kathryn B. Laskey
CEFP
2007
Springer
15 years 11 months ago
Proving Properties of Lazy Functional Programs with Sparkle
This tutorial paper aims to provide the necessary expertise for working with the proof assistant Sparkle, which is dedicated to the lazy functional programming language Clean. The ...
Maarten de Mol, Marko C. J. D. van Eekelen, Rinus ...
ATAL
2000
Springer
15 years 9 months ago
Determining the Envelope of Emergent Agent Behaviour via Architectural Transformation
In this paper we propose a methodology to help analyse tendencies in MAS to complement those of simple inspection, Monte Carlo and syntactic proof. We suggest an architecture that ...
Oswaldo Terán, Bruce Edmonds, Steve Wallis
IACR
2011
112views more  IACR 2011»
14 years 4 months ago
A Domain Transformation for Structure-Preserving Signatures on Group Elements
We present a generic transformation that allows us to use a large class of pairing-based signatures to construct schemes for signing group elements in a structure preserving way. A...
Melissa Chase, Markulf Kohlweiss
MM
2000
ACM
98views Multimedia» more  MM 2000»
15 years 9 months ago
Determining computable scenes in films and their structures using audio-visual memory models
In this paper we present novel algorithms for computing scenes and within-scene structures in films. We begin by mapping insights from film-making rules and experimental results f...
Hari Sundaram, Shih-Fu Chang