Sciweavers

1888 search results - page 30 / 378
» Proof theory and computational analysis
Sort
View
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
14 years 2 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
EUROGP
2001
Springer
103views Optimization» more  EUROGP 2001»
13 years 12 months ago
Computational Complexity, Genetic Programming, and Implications
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
Bart Rylander, Terence Soule, James A. Foster

Book
290views
15 years 5 months ago
Type Theory and Functional Programming
"Constructive Type theory has been a topic of research interest to computer scientists, mathematicians, logicians and philosophers for a number of years. For computer scient...
Simon Thompson
FCT
2007
Springer
14 years 1 months ago
On Block-Wise Symmetric Signatures for Matchgates
We give a classification of block-wise symmetric signatures in the theory of matchgate computations. The main proof technique is matchgate identities, a.k.a. useful Grassmann-Pl¨...
Jin-yi Cai, Pinyan Lu
CSL
2007
Springer
14 years 1 months ago
Unbounded Proof-Length Speed-Up in Deduction Modulo
In 1973, Parikh proved a speed-up theorem conjectured by G¨odel 37 years before: there exist arithmetical formulæ that are provable in first order arithmetic, but whose shorter ...
Guillaume Burel