Sciweavers

195 search results - page 8 / 39
» Matrix-based Constructive Theorem Proving
Sort
View
APPROX
2009
Springer
107views Algorithms» more  APPROX 2009»
14 years 1 months ago
Hierarchy Theorems for Property Testing
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
Oded Goldreich, Michael Krivelevich, Ilan Newman, ...
ASE
2005
140views more  ASE 2005»
13 years 6 months ago
Automated Procedure Construction for Deductive Synthesis
Deductive program synthesis systems based on automated theorem proving offer the promise of software that is correct by construction. However, the difficulty encountered in constru...
Steve Roach, Jeffrey Van Baalen
CCCG
2009
13 years 7 months ago
On Graph Thickness, Geometric Thickness, and Separator Theorems
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
Christian A. Duncan
ESSLLI
1999
Springer
13 years 11 months ago
A Dynamic View on Model Construction for Discourse Interpretation
In this paper I take a dynamic view in the spirit of the update semantics by Veltman (1996) on the first–order model construction procedure presented by Manthey and Bry (1988)....
Michael Kuhn
MLQ
2006
84views more  MLQ 2006»
13 years 6 months ago
A note on Bar Induction in Constructive Set Theory
Bar Induction occupies a central place in Brouwerian mathematics. This note is concerned with the strength of Bar Induction on the basis of Constructive ZermeloFraenkel Set Theory...
Michael Rathjen