Sciweavers

1960 search results - page 314 / 392
» The Logic of Large Enough
Sort
View
MICS
2010
81views more  MICS 2010»
13 years 8 months ago
Tactics for Hierarchical Proof
Abstract. There is something of a discontinuity at the heart of popular tactical theorem provers. Low-level, fully-checked mechanical proofs are large trees consisting of primitive...
David Aspinall, Ewen Denney, Christoph Lüth
EXACT
2009
13 years 7 months ago
Explanations and Arguments Based on Practical Reasoning
In this paper a representative example is chosen that is meant be fairly simple for illustrating the point that in a very common kind of instance, argument and explanation are mixe...
Douglas Walton
ICASSP
2011
IEEE
13 years 1 months ago
Belief theoretic methods for soft and hard data fusion
In many contexts, one is confronted with the problem of extracting information from large amounts of different types soft data (e.g., text) and hard data (from e.g., physics-based...
Thanuka Wickramarathne, Kamal Premaratne, Manohar ...
FPGA
2012
ACM
300views FPGA» more  FPGA 2012»
12 years 5 months ago
Reducing the cost of floating-point mantissa alignment and normalization in FPGAs
In floating-point datapaths synthesized on FPGAs, the shifters that perform mantissa alignment and normalization consume a disproportionate number of LUTs. Shifters are implemente...
Yehdhih Ould Mohammed Moctar, Nithin George, Hadi ...
POPL
2012
ACM
12 years 5 months ago
Playing in the grey area of proofs
Interpolation is an important technique in verification and static analysis of programs. In particular, interpolants extracted from proofs of various properties are used in invar...
Krystof Hoder, Laura Kovács, Andrei Voronko...