Space bounds for resolution

Information and Computation

Volumn 171, Issue 1, 2001, Pages 84-97

  Esteban, Juan Luis ^a   Torán, Jacobo ^b  

^a UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^b UNIVERSITY OF ULM   (Germany)

Author keywords

Pebble game; Resolution; Space bounds

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; THEOREM PROVING;

PROPOSITIONAL LOGIC;

FORMAL LOGIC;

EID: 0035951023     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.2001.2921     Document Type: Article

References (22)

1. Aharoni, R., and Linial, N. (1986), Minimal non-two-colorable hypergraphs and minimal unsatisfiable formulas, J. Combin. Theor. 43, 196-204.
2. Alekhnovich, M., Ben-Sasson, E., Razborov, A., and Wigderson, A. (2000), Space complexity in propositional calculus, in "Proc. 32nd ACM Symp. on Theory of Computing," pp. 358-367.
3. Beame, P., and Pitassi, T. (1996). Simplified and improved resolution lower bounds, in "Proc. 37th IEEE Symp. on Foundations of Computer Science," pp. 274-282.
4. Ben-Sasson, E., and Widgerson, A. (1999), Short proofs are narrow, resolution made simple, in "Proc. 31st ACM Symp. on Theory of Computing." pp. 517-527.
5. Buss, S., and Pitassi, T. (1997), Resolution and the weak pigeonhole principle, in "Proc. Computer Science Logic 97," Lecture Notes in Computer Science, Vol. 1414, pp. 149-156, Springer-Verlag, Berlin.
6. Chvátal, V., and Szemerédi, E. (1996), Many hard examples for resolution, J. Assoc. Comput. Mach. 35, 759-768.
7. Clegg, M., Edmonds, J., and Impagliazzo, R. (1996), Using the Groebner basis algorithm to find proofs of unsatisfiability, in "Proc. 28th ACM Symp. on Theory of Computing," pp. 174-183.
8. Esteban, J. L. (1995), "Complejidad de la Resolución en Espacio y Tiempo," Masters thesis, Facultad de Informática de Barcelona.
9. Esteban, J. L., and Torán, J. (1999), Space bounds for resolution, in "Proc. 16th STACS," Lecture Notes in Computer Science, Vol. 1563, pp. 551-561, Springer-Verlag, Berlin.
10. Haken, A. (1985), The intractability of resolution, Theoret. Comput. Sci. 35, 297-308.
11. Kleine-Büning, H., and Lettman, T. (1994), "Aussangenlogik: Deduktion und Algorithmen," Teubner, Stuttgart.
12. Margulis, A. (1973), Explicit construction of concentrators, Problems Inform. Transmission 9, 71-80.
13. Messner, J. (1999), personal communication.
14. Pudlák, P. (1997). Lower bounds for resolution and cutting plane proofs and monotone computations, J. Symbolic Logic 62, 981-998.
15. Razborov, A., Wigderson, A., and Yao, A. (1997), Read-once branching programs, rectangular proofs of the pigeonhole principle and the transversal calculus, in "Proc. 29th ACM Symp. on Theory of Computing," pp. 739-748.
16. Savage, J. (1998), "Models of Computation." Addison-Wesley, Reading, MA.
17. Schöning, U. (1997), Better expanders and superconcentrators by Kolmogorov complexity, in "Proceedings 4th International Colloquium on Structural Information and Communication Complexity. Sirocco 97," pp. 138-151, Carleton Scientific, Ottawa.
18. Schöning, U. (1997), Resolution proofs, exponential bounds and Kolmogorov complexity, in "Proc. 22nd MFCS Conference," Lecture Notes in Computer Science, Vol, 1295, pp. 110-116, Springer-Verlag, Berlin.
19. Torán, J. (1999), Lower bounds for the space used in resolution, in "Proc. Computer Science Logic Conference," Lecture Notes in Computer Science, Vol. 1683, pp. 362-373, Springer-Verlag, Berlin.
20. Tseitin, G. S. (1968), On the complexity of derivation in propositional calculus, in "Studies in Constructive Mathematics and Mathematical Logic. Part 2," pp. 115-125, Consultants Bureau, New York.
21. Urquhart, A. (1987), Hard examples for resolution. J. Assoc. Comput. Math. 34, 209-219.
22. van Emde Boas, P., and van Leeuwen, J. (1979), Move rules and trade-offs in the pebble game, in "Proc. 4th GI Conference," Lecture Notes in Computer Science, Vol. 67, pp. 101-112, Springer-Verlag, Berlin/New York.