111 search results - page 9 / 23 » The eskolemization of universal quantifiers |
FOSSACS
2008
Springer
13 years 9 months ago
2008
Springer
We introduce a new decidable logic for reasoning about infinite arrays of integers. The logic is in the first-order fragment and allows (1) Presburger constraints on existentially...
SIGUCCS
2004
ACM
14 years 1 months ago
2004
ACM
The Princeton University Help Desk KnowledgeBase (KB) is a searchable online information system that publishes Princetonspecific computer solutions to better serve the University ...
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
Compilers for polymorphic languages can use runtime type inspection to support advanced implementation techniques such as tagless garbage collection, polymorphic marshalling, and ...
TIT
2010
13 years 2 months ago
2010
The significant and meaningful fraction of all the potential information residing in the molecules and structures of living systems is unknown. Sets of random molecular sequences o...
DCC
2007
IEEE
14 years 7 months ago
2007
IEEE
Compressive sensing (CS) is a new signal acquisition technique for sparse and compressible signals. Rather than uniformly sampling the signal, CS computes inner products with rand...