30 search results - page 1 / 6 » New Directions in Instantiation-Based Theorem Proving |
LICS
2003
IEEE
13 years 10 months ago
2003
IEEE
We consider instantiation-based theorem proving whereby instances of clauses are generated by certain inferences, and where inconsistency is detected by propositional tests. We gi...
TOC
2010
12 years 11 months ago
2010
Abstract: We present a new method for proving lower bounds on quantum query algorithms. The new method is an extension of the adversary method, by analyzing the eigenspace structur...
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
JAT
2006
13 years 4 months ago
2006
We prove an extrapolation theorem for the nonlinear m-term approximation with respect to a system of functions satisfying very mild conditions. This theorem allows us to prove end...
ICFCA
2007
Springer
13 years 8 months ago
2007
Springer
Several fuzzifications of formal concept analysis have been proposed to deal with uncertainty or incomplete information. In this paper, we focus on the new paradigm of multi-adjoin...