3552 search results - page 391 / 711 » Proof theory in the abstract |
161
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— We prove the following strong hardness result for learning: Given a distribution on labeled examples from the hypercube such that there exists a monomial (or conjunction) consi...
165
click to vote
FOCS
2009
IEEE
16 years 1 months ago
2009
IEEE
— The question of whether or not parallel repetition reduces the soundness error is a fundamental question in the theory of protocols. While parallel repetition reduces (at an ex...
181
click to vote
MKM
2004
Springer
16 years 4 days ago
2004
Springer
This paper reports on refinements and extensions to the MathLang framework that add substantial support for natural language text. We show how the extended framework supports mult...
176
click to vote
BIRTHDAY
2010
Springer
15 years 7 months ago
2010
Springer
One of the obstacles in automatic program proving is to obtain suitable loop invariants. The invariant of a loop is a weakened form of its postcondition (the loop's goal, als...
158
click to vote
JAR
2006
15 years 6 months ago
2006
Otter-lambda is Otter modified by adding code to implement an algorithm for lambda unification. Otter is a resolution-based, clause-language first-order prover that accumulates de...