1061 search results - page 200 / 213 » Dependently Sorted Logic |
132
click to vote
CADE
2005
Springer
16 years 2 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...
179
click to vote
SIGMOD
2006
ACM
16 years 1 months ago
2006
ACM
Real-world data -- especially when generated by distributed measurement infrastructures such as sensor networks -- tends to be incomplete, imprecise, and erroneous, making it impo...
127
click to vote
POPL
2010
ACM
15 years 11 months ago
2010
ACM
We describe a new automatic static analysis for determining upper-bound functions on the use of quantitative resources for strict, higher-order, polymorphic, recursive programs de...
123
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
107
click to vote
ICCAD
2006
IEEE
15 years 10 months ago
2006
IEEE
Enumeration of bounded size cuts is an important step in several logic synthesis algorithms such as technology mapping and re-writing. The standard algorithm does not scale beyond...