111 search results - page 4 / 23 » The eskolemization of universal quantifiers |
BIRTHDAY
2004
Springer
13 years 10 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
PKDD
2005
Springer
14 years 15 days ago
2005
Springer
In applications such as fraud and intrusion detection, it is of great interest to measure the evolving trends in the data. We consider the problem of quantifying changes between tw...
IANDC
2006
13 years 7 months ago
2006
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
IMC
2006
ACM
14 years 1 months ago
2006
ACM
A number of previous measurement studies [10, 12, 17] have shown the existence of path exploration and slow convergence in the global Internet routing system, and a number of prot...
AGI
2008
13 years 8 months ago
2008
: Indefinite probabilities are a novel technique for quantifying uncertainty, which were created as part of the PLN (Probabilistic Logic Networks) logical inference engine, which i...