Sciweavers

999 search results - page 5 / 200
» On the Decidability of Functional Uncertainty
Sort
View
ISIPTA
1999
IEEE
169views Mathematics» more  ISIPTA 1999»
13 years 11 months ago
Dempster-Belief Functions Are Based on the Principle of Complete Ignorance
This paper shows that a "principle of complete ignorance" plays a central role in decisions based on Dempster belief functions. Such belief functions occur when, in a fi...
Peter P. Wakker
ITA
2007
153views Communications» more  ITA 2007»
13 years 7 months ago
Deciding inclusion of set constants over infinite non-strict data structures
Abstract. Various static analyses of functional programming languages that permit infinite data structures make use of set constants like Top, Inf, and Bot, denoting all terms, al...
Manfred Schmidt-Schauß, David Sabel, Marko S...
ICDT
2003
ACM
121views Database» more  ICDT 2003»
14 years 20 days ago
Deciding Termination of Query Evaluation in Transitive-Closure Logics for Constraint Databases
We study extensions of first-order logic over the reals with different types of transitive-closure operators as query languages for constraint databases that can be described by...
Floris Geerts, Bart Kuijpers
CSFW
2005
IEEE
14 years 1 months ago
Deciding Knowledge in Security Protocols under (Many More) Equational Theories
In the analysis of security protocols, the knowledge of attackers is often described in terms of message deducibility and indistinguishability relations. In this paper, we pursue ...
Martín Abadi, Véronique Cortier
ADCM
2000
39views more  ADCM 2000»
13 years 7 months ago
Uncertainty products of local periodic wavelets
This paper is on the angle-frequency localization of periodic scaling functions and wavelets. It is shown that the uncertainty products of uniformly local, uniformly regular and u...
Say Song Goh, Chee Heng Yeo