Skip to main content
Log in

Short proofs of the pigeonhole formulas based on the connection method

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

Quadratic proofs of pigeonhole formulas are presented using connection method proof techniques. The interest of this result derives from the fact that for this class of formulas exponential lower bounds are known for the length of resolution refutations.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bayerl, S., Eder, E., Kurfess, F., Letz, R. and Schumann, J., ‘An implementation of a PROLOG-like theorem prover based on the connection method’, in Ph. Jorrand and V. Sgurev (editors), AIMSA'86, Artificial Intelligence II—Methodology, Systems, Applications, pp. 29–36, North-Holland, Amsterdam, 1987.

    Google Scholar 

  2. Bibel, W., Automated Theorem Proving. Vieweg Verlag, Braunschweig, Second edition, 1987.

    Google Scholar 

  3. Bibel, W., ‘Matings in matrices’, Comm. ACM, 26 (1983) 844–852.

    Google Scholar 

  4. Bibel, W., ‘On matrices with connections’, JACM, 28 (1981) 633–645.

    Google Scholar 

  5. Bibel, W., ‘Tautology testing with a generalized matrix reduction method’, Theor. Comput. Sci., 8 (1979) 31–44.

    Google Scholar 

  6. Buss, S. R., ‘Polynomial size proofs of the propositional pigeonhole principle’, The Journal of Symbolic Logic, 52(4) (1987) 916–927.

    Google Scholar 

  7. Chvátal, V. and Szemerédi, E., ‘Many hard examples for resolution’, JACM, to appear.

  8. Cook, S. A., ‘A short proof of the pigeon hole principle using extended resolution’, ACM SIGACT News, 8 (Oct.–Dec. 1976) 28–32.

    Google Scholar 

  9. Eder, E., ‘A comparison of the resolution calculus and the connection method, and a new calculus generalizing both methods’. To appear in Computer Science Logic, Lecture Notes in Computer Science, Springer, Berlin.

  10. Haken, A., ‘The intractability of resolution’, Theor. Comput. Sci., 39 (1985) 297–308.

    Google Scholar 

  11. Krishnamurthy, B., ‘Short proofs for tricky formulas’, Acta Informatica, 22(3) (1985) 253–275.

    Google Scholar 

  12. Letz, R., Schumann, J. and Bayerl, S., ‘SETHEO — A sequential theorem prover for first-order logic’, Technische Universität München, 1988.

  13. Loveland, D. W., ‘A unifying view of some linear Herbrand procedures’, JACM, 19 (1972) 366–384.

    Google Scholar 

  14. Murray, N. V. and Rosenthal, E., Short Proofs of Pigeonhole Formulas Using Path Dissolution and Semantic Graphs, Technical Report, Dept. of Computer Science, SUNY at Albany, 1988.

  15. Prawitz, D., ‘A proof procedure with matrix reduction’, in M. Laudet et al. (editors), Symposium on Automatic Demonstration, Lecture Notes in Math. 125, pp. 207–214, Springer, Berlin, 1970.

    Google Scholar 

  16. Tseitin, G. S., ‘On the complexity of derivation in propositional calculus’, in A. O. Slisenko (editor), Studies in Constructive Mathematics and Mathematical Logic, Part II, pp. 234–259, Seminars in Mathematics, V. A. Steklov Mathematical Institute, vol. 8, Leningrad, 1968. English translation: Consultants Bureau, New York, 1970, pp. 115–125.

    Google Scholar 

  17. Urquhart, A., ‘Hard examples for resolution’, JACM, 34 (1987) 209–219.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bibel, W. Short proofs of the pigeonhole formulas based on the connection method. J Autom Reasoning 6, 287–297 (1990). https://doi.org/10.1007/BF00244489

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00244489

Key words

Navigation