Journal of Automated Reasoning

, Volume 2, Issue 1, pp 89–101

Schubert's Steamroller problem: Formulations and solutions

  • Mark E. Stickel
Problem Corner

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Antoniou, G. and Ohlbach, H. J., ‘Terminator’, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, 1983, pp. 916–919.Google Scholar
  2. 2.
    Bläsius, K., Eisinger, N., Siekman, J., Smolka, G., Herold, A., and Walther, C., ‘The Markgraf Karl Refutation Procedure (Fall 1981)’, Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver, BC, Canada, 1981, pp. 511–518.Google Scholar
  3. 3.
    Boyer, R. S., ‘Locking: a restriction of resolution’, PhD dissertation, University of Texas, Austin, Texas, 1971.Google Scholar
  4. 4.
    De Champeaux, D., ‘A theorem prover dating a semantic network’, Proceedings of the AISB/GI Conference on Artificial Intelligence, Hamburg, West Germany, 1978, pp. 82–92.Google Scholar
  5. 5.
    Cohn, A. G., ‘Mechanizing a particularly expressive many sorted logic’, PhD dissertation, University of Essex, Essex, England, 1983.Google Scholar
  6. 6.
    Cohn, A. G., ‘On the solution of Schubert's steamroller in many sorted logic’, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, California, 1985, pp. 1169–1174.Google Scholar
  7. 7.
    Dahl, V., ‘Translating Spanish into logic through logic’, American Journal of Computational Linguistics 7, 149–164 (1981).Google Scholar
  8. 8.
    Frisch, A. M., ‘An investigation into inference with restricted quantification and a taxonomic representation’, Technical Report CSRP 041, Cognitive Studies Programmme, The University of Sussex, Brighton, England.Google Scholar
  9. 9.
    Henschen, L. J., ‘N-sorted logic for automatic theorem-proving in higher-order logic’, Proceedings of the ACM Annual Conference, Boston, Massachusetts, 1972, pp. 71–81.Google Scholar
  10. 10.
    Kowalski, R., ‘A proof procedure using connection graphs’, Journal of the ACM 22, 572–595 (1975).Google Scholar
  11. 11.
    Lusk, E. L., McCune, W. W., and Overbeek, R. A., ‘Logic Machine Architecture: kernel functions’, Proceedings of the 6th Conference on Automated Deduction, New York, New York, 1982, pp. 70–84.Google Scholar
  12. 12.
    Lusk, E. L., McCune, W. W., and Overbeek, R. A., ‘Logic Machine Architecture: inference mechanisms’, Proceedings of the 6th Conference on Automated Deduction, New York, New York, 1982, 85–108.Google Scholar
  13. 13.
    Lusk, E. L. and Overbeek, R. A., ‘A portable environment for research in automated reasoning’, Proceedings of the 7th Conference on Automated Deduction, Napa, California, 1984, pp. 43–52.Google Scholar
  14. 14.
    McCune, W. W., ‘Schubert's steamroller problem with linked UR-resolution’, Association of Automated Reasoning Newsletter No. 4 (Spring 1985), pp. 4–6.Google Scholar
  15. 15.
    Pelletier, J. F., ‘Completely non-clausal, completely heuristically driven automatic theorem proving’, MSc Thesis, University of Alberta, Edmonton, Alberta, Canada, 1982.Google Scholar
  16. 16.
    Schmidt-Schauss, M. A., ‘A many-sorted calculus with polymorphic functions based on resolution and paramodulation’, Proceedings of the Ninth International Joint Conference on Artificial Intelligence, Los Angeles, California, 1985, pp. 1162–1168.Google Scholar
  17. 17.
    Stickel, M. E., ‘A nonclausal connection-graph resolution theorem-proving program’, Proceedings of the AAAI-82 National Conference on Artificial Intelligence, Pittsburgh, Pennsylvania, 1982, pp. 229–233.Google Scholar
  18. 18.
    Stickel, M. E., ‘A PROLOG technology theorem prover’, New Generation Computing 2 371–383 (1984).Google Scholar
  19. 19.
    Stickel, M. E., ‘Automated deduction by theory resolution’, Journal of Automated Reasoning 1, 333–355 (1985).Google Scholar
  20. 20.
    Walther, C., ‘A many-sorted calculus based on resolution and paramodulation’, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, West Germany, 1983, pp. 882–891.Google Scholar
  21. 21.
    Walther, C., ‘A mechanical solution of Schubert's steamroller by many-sorted resolution’, Proceedings of the AAAI-84 National Conference on Artificial Intelligence, Austin, Texas, 1984, pp. 330–334. Revised version appeared in Artificial Intelligence 26, 217–224 (1985).Google Scholar
  22. 22.
    Winker, S., ‘An evaluation of an implementation of qualified hyperresolution’, IEEE Transactions on Computers C 25, 835–843 (1976).Google Scholar
  23. 23.
    Wos, L., Veroff, R., Smith, B., and McCune, W., ‘The linked inference principle, II: the user's viewpoint’, Proceedings of the 7th International Conference on Automated Deduction, Napa, California, 1984, pp. 316–332.Google Scholar

Copyright information

© D. Reidel Publishing Company 1986

Authors and Affiliations

  • Mark E. Stickel
    • 1
  1. 1.Artificial Intelligence CenterSRI InternationalMenlo ParkU.S.A.

Personalised recommendations