Sciweavers

60 search results - page 7 / 12
» Some extensions of the Cauchy-Davenport theorem
Sort
View
TPHOL
2009
IEEE
14 years 2 months ago
A Formalisation of Smallfoot in HOL
In this paper a general framework for separation logic inside the HOL theorem prover is presented. This framework is based on Abeparation Logic. It contains a model of an abstract,...
Thomas Tuerk
IJAR
2008
140views more  IJAR 2008»
13 years 6 months ago
Financial risk measurement with imprecise probabilities
Although financial risk measurement is a largely investigated research area, its relationship with imprecise probabilities has been mostly overlooked. However, risk measures can b...
Paolo Vicig
TPHOL
2000
IEEE
13 years 11 months ago
Equational Reasoning via Partial Reflection
We modify the reflection method to enable it to deal with partial functions like division. The idea behind reflection is to program a tactic for a theorem prover not in the impleme...
Herman Geuvers, Freek Wiedijk, Jan Zwanenburg
WWW
2005
ACM
14 years 8 months ago
Debugging OWL ontologies
As an increasingly large number of OWL ontologies become available on the Semantic Web and the descriptions in the ontologies become more complicated, finding the cause of errors ...
Bijan Parsia, Evren Sirin, Aditya Kalyanpur
MMSEC
2006
ACM
167views Multimedia» more  MMSEC 2006»
14 years 1 months ago
Hermite polynomials as provably good functions to watermark white gaussian hosts
In the watermark detection scenario, also known as zero-bit watermarking, a watermark, carrying no hidden message, is inserted in content. The watermark detector checks for the pr...
Teddy Furon