1818 search results - page 18 / 364 » Granularity-Adaptive Proof Presentation |
ECCC
2010
13 years 7 months ago
2010
We present an alternate proof of the result by Kabanets and Impagliazzo that derandomizing polynomial identity testing implies circuit lower bounds. Our proof is simpler, scales b...
IPL
2007
13 years 7 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for...
DKE
2008
13 years 7 months ago
2008
In this work, we present the design and implementation of a system for proof explanation in the Semantic Web, based on defeasible reasoning. Trust is a vital feature for Semantic ...
TABLEAUX
2000
Springer
13 years 11 months ago
2000
Springer
We present an approach to inductive theorem proving that integrates rippling-based rewriting into matrix-based logical proof search. The selection of appropriate connections in a m...