On interpolation and automatization for Frege systems

SIAM Journal on Computing

Volumn 29, Issue 6, 2000, Pages 1939-1967

  Bonet, Maria Luisa ^a   Pitassi, Toniann ^b   Raz, Ran ^c  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b University of Arizona   (United States)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; INTEGER PROGRAMMING; INTERPOLATION; POLYNOMIALS; THRESHOLD ELEMENTS; VECTORS;

DIFFIE-HELLMAN THEORY; FREGE PROOF SYSTEMS;

THEOREM PROVING;

EID: 0034478771     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798353230     Document Type: Article

References (32)

1. N. ALON AND R. BOPPANA, The monotone circuit complexity of Boolean functions, Combinatorica, 7 (1987), pp. 1-22.
2. A. ALEKNOVICH, S. Buss, S. MORAN, AND T. PITASSI, Minimal propositional proof length is NP-hard to linearly approximate, J. Symbolic Logic, to appear.
3. E. BIHAM, D. BONEH, AND O. REINGOLD, Generalized Diffie-Hellman modulo a composite is not weaker than factoring, Theory of Cryptography Library, Record 97-14, available from http://theory.lcs.mit.edu/tcryptol/homepage.html.
4. P. BEAME, S. COOK, AND H. J. HOOVER, Log depth circuits for division and related problems, SIAM J. Comput., 15 (1986), pp. 994-1003.
5. M. BONET, C. DOMINGO, R. GAVALDÁ, A. MACIEL, AND T. PITASSI, Non-automatizability of bounded-depth Frege proofs, in Proceedings IEEE Symposium on Complexity, Atlanta, GA, 1999, pp. 15-23.
6. M. BONET, T. PITASSI, AND R. RAZ, Lower bounds for cutting planes proofs with small coefficients, in Proceedings ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 575-584. Also in J. Symbolic Logic, 62 (1997), pp. 708-728.
7. M. BONET, T. PITASSI, AND R. RAZ, Lower bounds for cutting planes proofs with small coefficients, in Proceedings ACM Symposium on the Theory of Computing, Las Vegas, NV, 1995, pp. 575-584. Also in J. Symbolic Logic, 62 (1997), pp. 708-728.
8. S. Buss, The undecidability of k-provability, Ann. Pure Appl. Logic, 53 (1991), pp. 75-102.
9. S. Buss, On Godel's theorems on lengths of proofs II: Lower bounds for recognizing k symbol provability, in Feasible Mathematics II, P. Clote and J. Remmel, eds., Birkhäuser Boston, Cambridge, MA, 1995, pp. 57-90.
10. S. Buss AND P. CLOTE, Cutting planes, connectivity and threshold logic, Arch. Math. Logic, 35 (1996), pp. 33-62.
11. S. COOK AND A. HAKEN, An exponential lower bound for the size of monotone real circuits, J. Comput. System Sci., 58 (1999), pp. 326-330.
12. A. K. CHANDRA, L. STOCKMEYER, AND U. VISHKIN, Constant depth reducibility, SIAM J. Comput., 13 (1984), pp. 423-439.
13. W. DIFFIE AND M. HELLMAN, New directions in cryptography, IEEE Trans. Inform. Theory, 22 (1976). pp. 644-654.
14. R. IMPAGLIAZZO, T. PITASSI, AND A. URQUHART, Upper and lower bounds for tree-like cutting planes proofs, in Proceedings IEEE Symposium on Logic in Computer Science, Paris, France, 1994, pp. 220-228.
15. J. KRAJÍČEK, Interpolation theorems, lower bounds for proof systems and independence results for bounded arithmetic, J. Symbolic Logic, 62 (1997), pp. 457-486.
16. J. KRAJÍČEK, Lower bounds to the size of constant-depth propositional proofs, J. Symbolic Logic, 59 (1994), pp. 73-86.
17. J. KRAJÍČEK, Discretely ordered modules as a first-order extension of the cutting planes proof system, J. Symbolic Logic, 63 (1998), pp. 1582-1596.
18. 2 and EF, in Logic and Computational Complexity, D. Leivant, ed., Lecture Notes in Comput. Sci. 960, Springer-Verlag, New York, 1995, pp. 210-220.
19. A. MACIEL, Threshold Circuits of Small Majority Depth, Ph.D. thesis, McGill University, Montreal, PQ, Canada, 1995.
20. k]-Frege proofs, in Proceedings ACM Symposium on Theory of Computing, El Paso, TX, 1997, pp. 720-729.
21. K. MCCURLEY, A key distribution system equivalent to factoring, J. Cryptology, 1 (1988), pp. 95-105.
22. D. MUNDICI, Complexity of Craig's interpolation, Fund. Inform., 5 (1982), pp. 261-278.
23. D. MUNDICI, A lower bound for the complexity of Craig's interpolants in sentential logic, Arch. Math. Logik Grundlag, 23 (1983), pp. 27-36.
24. D. MUNDICI, Tautologies with a unique Craig interpolant, uniform vs. non-uniform complexity, Ann. Pure Appl. Logic, 27 (1984), pp. 265-273.
25. M. NAOR, Personal Communication, 1996.
26. P. PUDLAK, Lower bounds for resolution and cutting planes proofs and monotone computations, J. Symbolic Logic, 62 (1997), pp. 981-998.
27. P. PUDLÁK AND J. SGALL, Algebraic models of computation and interpolation for algebraic proof systems, in Proof Complexity and Feasible Arithmetic, S. Buss, ed., Lecture Notes in Comput. Sci. 39, Springer-Verlag, New York, 1998, pp. 279-295.
28. P. PUDLAK, On the complexity of propositional calculus, in Logic Colloquium 97, Cambridge University Press, Cambridge, UK, 1999, pp. 197-218.
29. A. RAZBOROV, Lower bounds for the monotone complexity of some Boolean functions, Dokl. Akad. Nauk. SSSR, 281 (1985), pp. 798-801 (in Russian). English translation in Soviet Mathematics Doklady, 31 (1985), pp. 354-357.
30. A. RAZBOROV, Lower bounds for the monotone complexity of some Boolean functions, Dokl. Akad. Nauk. SSSR, 281 (1985), pp. 798-801 (in Russian). English translation in Soviet Mathematics Doklady, 31 (1985), pp. 354-357.
31. A. RAZBOROV, Unprovability of lower bounds on the circuit size in certain fragments of bounded arithmetic, Izv. Ross. Akad. Nauk. Ser. Mat., 59 (1995), pp. 201-224.
32. Z. SHMUELY, Composite Diffie-Hellman Public-Key Generating Systems Are Hard to Break, Technical report 356. Computer Science Department, Technion, Israel, 1985.