10715 search results - page 171 / 2143 » Proofs from Tests |
117
click to vote
AAAI
2008
15 years 3 months ago
2008
Currently, the most effective complete SAT solvers are based on the DPLL algorithm augmented by clause learning. These solvers can handle many real-world problems from application...
109
Voted
CORR
2010
Springer
15 years 26 days ago
2010
Springer
Abstract. Weighted logic programming, a generalization of bottom-up logic programming, is a successful framework for specifying dynamic programming algorithms. In this setting, pro...
115
click to vote
ENTCS
2008
15 years 25 days ago
2008
Current object-oriented approaches to distributed programs may be criticized in several respects. First, method calls are generally synchronous, which leads to much waiting in dis...
117
Voted
TCS
2010
14 years 11 months ago
2010
The paper contains the first complete proof of strong normalization (SN) for full second order linear logic (LL): Girard’s original proof uses a standardization theorem which i...
112
Voted
DAC
2000
ACM
16 years 1 months ago
2000
ACM
The effect of crosstalk errors is most significant in highperformance circuits, mandating at-speed testing for crosstalk defects. This paper describes a self-test methodology that...