Seventy-five problems for testing automatic theorem provers
KeywordsPropositional Logic Predicate Logic Automate Reasoning Automatic Theorem Prove Clause Form
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- DeChampeauxD. (1979) ‘Sub-problem finder and instance checker: two cooperating preprocessors for theorem provers’IJCAI 6, 191–196.Google Scholar
- Kalish, D. & Montague, R. (1964)Logic: Techniques of Formal Reasoning, World, Harcourt & Brace,Google Scholar
- McCuneW. (1985) ‘Schubert's Steamroller Problem with linked UR-resolution’Assoc. Automated Reasoning Newsletter,4, 4–6.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
- 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’.Google Scholar
- Urquhart, A. (unpublished b) ‘Hard examples for resolution’.Google Scholar
- WhiteheadA. and RussellB. (1910)Principia Mathematica, Vol. I. (Cambridge UP, Cambridge).Google Scholar
© D. Reidel Publishing Company 1986