Sciweavers

1818 search results - page 43 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
LOPSTR
2000
Springer
14 years 11 days ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
CSL
2008
Springer
13 years 10 months ago
Quantitative Game Semantics for Linear Logic
We present a game-based semantic framework in which the time complexity of any IMELL proof can be read out of its interpretation. This gives a compositional view of the geometry of...
Ugo Dal Lago, Olivier Laurent
JAR
2007
77views more  JAR 2007»
13 years 8 months ago
Superposition-based Equality Handling for Analytic Tableaux
We present a variant of the basic ordered superposition rules to handle equality in an analytic free-variable tableau calculus. We prove completeness of this calculus by an adaptat...
Martin Giese
TC
2011
13 years 3 months ago
Exact and Approximated Error of the FMA
Abstract—The fused multiply accumulate-add (FMA) instruction, specified by the IEEE 754-2008 Standard for Floating-Point Arithmetic, eases some calculations, and is already avai...
Sylvie Boldo, Jean-Michel Muller
ECCC
2010
103views more  ECCC 2010»
13 years 3 months ago
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
We present an alternate proof of the recent result by Gutfreund and Kawachi that derandomizing Arthur-Merlin games into PNP implies linear-exponential circuit lower bounds for ENP...
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, ...