Skip to main content
SpringerLink
Log in

Seventy-five problems for testing automatic theorem provers

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

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

References

  • BledsoeW., BoyerR., and HennemanW. (1972) ‘Computer proofs of limit theorems’,Artificial Intelligence,3, 27–60.

    Article  MATH  MathSciNet  Google Scholar 

  • CookS. and ReckhowR. (1979) ‘The relative efficiency of propositional proof systems’,J. Symbolic Logic 44, 36–50.

    Article  MATH  MathSciNet  Google Scholar 

  • DeChampeauxD. (1979) ‘Sub-problem finder and instance checker: two cooperating preprocessors for theorem provers’IJCAI 6, 191–196.

    Google Scholar 

  • GalilZ. (1977) ‘On resolution with clauses of bounded size’,SIAM J. Computing 6, 444–459.

    Article  MATH  MathSciNet  Google Scholar 

  • Kalish, D. & Montague, R. (1964)Logic: Techniques of Formal Reasoning, World, Harcourt & Brace,

  • LuskE. and OverbeekR. (1985) ‘Reasoning about equality’,J. Automated Reasoning,1, 209–228.

    MATH  MathSciNet  Google Scholar 

  • McCharenR., OverbeekR., & WosL. (1976) ‘Problems and experiments for and with automated theorem-proving programs’,IEEE Trans. Computers C-25(8), 773–782.

    MATH  Google Scholar 

  • McCuneW. (1985) ‘Schubert's Steamroller Problem with linked UR-resolution’Assoc. Automated Reasoning Newsletter,4, 4–6.

    Google Scholar 

  • MontagueR. (1955) ‘On the paradox of grounded classes’J. Symbolic Logic 20, 140.

    Article  MATH  MathSciNet  Google Scholar 

  • NewellA., ShawJ., and SimonH. (1957) ‘Empirical explorations with the logic theory machine: a case study in heuristics’. Reprinted in E.Feigenbaum and J.Feldman (eds.)Computers and Thought (McGraw-Hill, N.Y.) pp. 279–293 (1963).

    Google Scholar 

  • NewellA. and SimonH. (1972)Human Problem Solving, (Prentice-Hall, Englewood Cliffs).

    Google Scholar 

  • PelletierF. J. (1982) ‘Completely nonclausal, completely heuristically driven automatic theorem proving’, Technical Report TR82-7, (Dept. of Computing Science, Edmonton, Alberta).

    Google Scholar 

  • PelletierF. J. (1985) ‘Six problems in translational equivalence’,Logique et Analyse 108, 423–434.

    MathSciNet  Google Scholar 

  • SiklóssyL., RichA., and MarinovV. (1973) ‘Breadth first search: some surprising results’,Artificial Intelligence 4, 1–27.

    Article  MATH  MathSciNet  Google Scholar 

  • StickelM. (1986) ‘Schubert's steamroller problem: formulations and solutions’,J. Automated Reasoning 2, 89–104.

    Article  MATH  MathSciNet  Google Scholar 

  • ThomasonR. (1972)Symbolic Logic (Prentice-Hall, Englewood Cliffs).

    Google Scholar 

  • TseitinG. S. (1968) ‘On the complexity of derivation in propositional calculus’, reprinted in J.Siekmann and G.Wrightson (eds.)Automation of Reasoning (Springer-Verlag, Berlin).

    Google Scholar 

  • Urquhart, A. (unpublished a) ‘The complexity of Genzen systems for propositional logic’.

  • Urquhart, A. (unpublished b) ‘Hard examples for resolution’.

  • WaltherC. (1985) ‘A mechanical solution of Schubert's steamroller by many-sorted resolution’,Artificial Intelligence 26, 217–224.

    Article  MATH  MathSciNet  Google Scholar 

  • WhiteheadA. and RussellB. (1910)Principia Mathematica, Vol. I. (Cambridge UP, Cambridge).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Philosophy, University of Alberta, T6G 2E5, Edmonton, Alberta, Canada

    Francis Jeffry Pelletier

Authors
  1. Francis Jeffry Pelletier
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pelletier, F.J. Seventy-five problems for testing automatic theorem provers. J Autom Reasoning 2, 191–216 (1986). https://doi.org/10.1007/BF02432151

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation