92 search results - page 9 / 19 » Exploiting structure in quantified formulas |
TWC
2008
14 years 9 months ago
2008
We develop a reduced-complexity hybrid frequency/time-domain orthogonal frequency division multiplexing (OFDM) channel estimation algorithm for high-mobility scenarios where the ch...
76
Voted
TCS
2008
14 years 9 months ago
2008
Suppose we are given a set W of logical structures, or possible worlds, a set of logical formulas called possible data and a logical formula . We then consider the classification p...
89
Voted
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
We present in this paper a novel control synthesis technique for system-level specifications that are better described as a set of concurrent synchronous descriptions, their synch...
90
Voted
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
CADE
2005
Springer
15 years 9 months ago
2005
Springer
We present a fully proof-producing implementation of a quantifier elimination procedure for real closed fields. To our knowledge, this is the first generally useful proof-producing...