Skip to main content
SpringerLink
Log in

The Depth of Resolution Proofs

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

This paper investigates the depth of resolution proofs, that is to say, the length of the longest path in the proof from an input clause to the conclusion. An abstract characterization of the measure is given, as well as a discussion of its relation to other measures of space complexity for resolution proofs

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

Access this article

Log in via an institution

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. Alekhnovich, Michael, Jan Johannsen, Toniann Pitassi, and Alasdair Urquhart, ‘An exponential separation between regular and general resolution’. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing: May 19-21 2002, Montréal, Québec, Canada, 2002, pp. 448–456.

  2. Alekhnovich, Michael, Eli Ben-Sasson, Alexander A. Razborov, and Avi Wigderson, ‘Space Complexity in Propositional Calculus’. SIAM Journal of Computing 31(4):1184–1211, 2001. Preliminary version: Proceedings of the 32nd Annual ACM Symposium on Theory of Computing, 2000, pp. 358–367.

    Google Scholar 

  3. Atserias, Albert, and Victor Dalmau, ‘A combinatorial characterization of resolution width’. In 18th IEEE Conference on Computational Complexity (CCC). IEEE Computer Society Press, 2003, pp. 239–247.

  4. Ben-Sasson, Eli. ‘Size Space Tradeoffs For Resolution’, Proceedings of the 34th ACM Symposium on the Theory of Computing, 2002, pp. 457–464.

  5. Ben-Sasson, Eli, Russell Impagliazzo, and Avi Wigderson, ‘Near optimal separation of tree-like and general resolution’. Combinatorica 24:585–603, 2004. Preliminary version, ECCC TR00-005, 2000.

    Google Scholar 

  6. Ben-Sasson, Eli, and Avi Wigderson, ‘Short proofs are narrow – resolution made simple’. Journal of the Association for Computing Machinery 48:149–169, 2001. Preliminary version: Proceedings of the 31st Annual ACM Symposium on Theory of Computing, 1999, pp. 517–526.

  7. Bonet , Maria L., Esteban J.L., Nicola Galesi, Jan Johannsen: ‘On the relative complexity of resolution refinements and cutting planes proof systems’. SIAM Journal on Computing 30, 1462–1484 (2000)

    Article  Google Scholar 

  8. Esteban, Juan Luis, Complexity Measures for Resolution. PhD thesis, Universitat Politècnica de Catalunya, 2003.

  9. Esteban, Juan Luis, Nicola Galesi, and Jochen Messner, ‘On the complexity of resolution with bounded conjunctions’. Theoretical Computer Science 321:347–370, 2004. Preliminary version in 29th International Colloquium on Automata, Languages and Programming, 2002.

  10. Esteban , Juan Luis, Jacobo Torán: ‘Space Bounds for Resolution’. Information and Computation 171, 84–97 (2001)

    Article  Google Scholar 

  11. Esteban, Juan Luis and Jacobo Torán, ‘A Combinatorial Characterization of Treelike Resolution Space’. Electronic Colloquium on Computational Complexity 44, 2003.

  12. Lovász László, Moni Naor, Ilan Newman, Avi Wigderson: ‘Search problems in the decision tree model’. SIAM Journal on Discrete Mathematics 8, 119–132 (1995)

    Article  Google Scholar 

  13. Nordström, J., ‘Narrow Proofs May Be Spacious: Separating Space and Width in Resolution’. Proceedings of the 38th ACM Symposium on the Theory of Computing, 2006.

  14. Papadimitriou, Christos H., Computational Complexity. Addison-Wesley, 1994.

  15. Paul W.J., Tarjan R.E., Celoni J.R.: ‘Space bounds for a game on graphs’. Mathematical Systems Theory 10, 239–251 (1977)

    Article  Google Scholar 

  16. Pudlák, Pavel, and Russell Impagliazzo, ‘A lower bound for DLL algorithms for k-SAT’. In Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Association for Computing Machinery, 2000, pp. 128–136.

  17. Raz Ran, Pierre McKenzie: ‘Separation of the monotone NC hierarchy’. Combinatorica 19, 403–435 (1999)

    Article  Google Scholar 

  18. Savage, John E., Models of Computation: Exploring the Power of Computing. Addison-Wesley, 1998.

  19. Savitch Walter: ‘Relationship between nondeterministic and deterministic tape complexities’. Journal of Computer and System Sciences 4, 177–192 (1970)

    Article  Google Scholar 

  20. Siekmann, Jörg, Graham, Wrightson (eds): Automation of Reasoning. Springer-Verlag, New York (1983)

    Google Scholar 

  21. Tseitin G.S., ‘On the complexity of derivation in propositional calculus’. In A. O. Slisenko (ed.), Studies in Constructive Mathematics and Mathematical Logic, Part 2. Consultants Bureau, New York, 1970, pp. 115–125. Reprinted in [20], Vol. 2, pp. 466–483

  22. Urquhart Alasdair: ‘The complexity of propositional proofs’. The Bulletin of Symbolic Logic 1, 425–467 (1995)

    Article  Google Scholar 

  23. Urquhart, Alasdair, ‘Regular and general resolution: An improved separation’. In Hans Kleine Büning and Xishun Zhao (eds.), Theory and Applications of Satisfiability Testing – SAT 2008. Springer-Verlag, 2008, pp. 277–290. Lecture Notes in Computer Science 4996.

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Toronto, 10 King’s College Road, Toronto, Ontario, Canada

    Alasdair Urquhart

Authors
  1. Alasdair Urquhart
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alasdair Urquhart.

Additional information

Dedicated to Professor Ryszard Wójcicki on the occasion of his 80th birthday

Special issue in honor of Ryszard Wójcicki on the occasion of his 80th birthday Edited by J. Czelakowski, W. Dziobiak, and J. Malinowski

Rights and permissions

Reprints and permissions

About this article

Cite this article

Urquhart, A. The Depth of Resolution Proofs. Stud Logica 99, 349 (2011). https://doi.org/10.1007/s11225-011-9356-9

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11225-011-9356-9

Keywords

Search

Navigation