ANL, Argonne National Laboratory Problem Library, Available by anonymous ftp from info.msc.anl.gov, Maths and Computer Science Division, Argonne National Laboratory, Argonne, IL..
Alexander G. (1995), Proving First-Order Equality Theorems with Hyper-Linking, PhD thesis, University of North Carolina at Chapel Hill, Chapel Hill, USA.
Alexander G. (1995), Email to G. Sutcliffe.
Allen J.F., Kautz H.A., Pelavin R.N., Tenenberg J.D. (1991), Reasoning about Plans, Morgan Kaufmann Publishers.
Anantharaman S., Bonacina M.P. (1990), An Application of the Theorem Prover SBR3 to Many-Valued Logic, Okada M. Kaplan S., Proceedings of the 2nd International Workshop on Conditional and Typed Rewriting Systems (Montreal, Canada), pp.156-161, Lecture Notes in Computer Science 516, Springer-Verlag.
Anantharaman S., Hsiang J. (1990), Automated Proofs of the Moufang Identities in Alternative Rings, Journal of Automated Reasoning 6(1), pp.79-110.
Andrews P.B. (1994), Email to G. Sutcliffe.
Andrews P.B. (1986), An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Academic Press.
Angshuman G., Zhang H. (1989), Andrews' Challenge Problem: Clause Conversion and Solutions, AAR Newsletter 14, pp.5-8.
Astrachan O.L. (1992), METEOR: Exploring Model Elimination Theorem Proving, CS-1992-22, Department of Computer Science, Duke University, Durham, USA.
Avenhaus J., Denzinger J., Fuchs M. (1995), DISCOUNT: A System for Distributed Equational Deduction, Hsiang J., Proceedings of the 6th International Conference on Rewriting Techniques and Applications (Kaiserslautern, Germany), pp.397-402, Springer-Verlag.
Barendregt H.P. (1981), The Lambda Calculus: Its Syntax and Semantics, North-Holland.
Barta J. (2003), Email to G. Sutcliffe.
Baumgartner P. (1999), FTP'2000 - Problem Sets, ftp://ftphost.uni-koblenz.de/outgoing/agki/FTP2000/ProblemSets/index.html.
Baumgartner P. (1996), Linear and Unit-Resulting Refutations for Horn Theories, Journal of Automated Reasoning 16(3), pp.241-319.
Baumgartner P. (1994), Refinements of Theory Model Elimination and a Variant without Contrapositives, Cohn A.G., Proceedings of the 11th European Conference on Artificial Intelligence , pp.90-94, Wiley and Sons.
Baumgartner P., Furbach U. (1994), PROTEIN: A PROver with a Theory Extension INterface, Bundy A., Proceedings of the 12th International Conference on Automated Deduction (Nancy, France), pp.769-773, Lecture Notes in Artificial Intelligence 814, Springer-Verlag.
Baumgartner P., Furbach U. (1994), Model Elimination without Contrapositives and its Application to PTTP, Journal of Automated Reasoning 13(3), pp.339-359.
Baumgartner P., Furbach U., Stolzenburg F. (1997), Computing Answers with Model Elimination, Artificial Intelligence 90, pp.135-176.
Baumgartner P., Furbach U., Stolzenburg F. (1995), Model Elimination, Logic Programming and Computing Answers, Mellish C.S., Proceedings of the 14th International Joint Conference on Artificial Intelligence, pp.335-340, Morgan Kaufmann.
Bechhofer S. (2003), Email to G. Sutcliffe.
Beckert B., Posegga J. (1995), leanTAP: Lean, Tableau-based Deduction, Journal of Automated Reasoning 15(3), pp.339-358.
Belinfante J.G.F. (1997), On Quaife's Development of Class Theory, AAR Newsletter 37, pp.1-4.
Benanav D. (1992), Recognising Unnecessary Clauses in Resolution Based Systems, Journal of Automated Reasoning 9(1), pp.43-76.
Bennett F.E. (1989), Quasigroup Identities and Mendelsohn Designs, Canadian Journal of Mathematics 41(2), pp.341-368.
Bennett F.E., Zhu L. (1992), Conjugate-Orthogonal Latin Squares and Related Structures, Dinitz J.H., Douglas R.S., Contemporary Design Theory: A Collection of Surveys, pp.41-96, Wiley and Sons.
Benzmüller C., Cheikhrouhou L., Fehrer D., Fiedler A., Huang X., Kerber M., Kohlhase M., Konrad K., Meier A., Melis E., Schaarschmidt W., Siekmann J., Sorge V. (1997), OMEGA: Towards a Mathematical Assistant, McCune W.W., Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), pp.252-255, Lecture Notes in Artificial Intelligence 1249, Springer-Verlag.
Birkhoff G., Bartee T. (1970), Modern Applied Algebra, McGraw-Hill.
Birkhoff G., MacLane S. (1965), A Survey of Modern Algebra, Macmillan.
Bledsoe W.W. (1992), Email to G. Sutcliffe.
Bledsoe W.W. (1990), Challenge Problems in Elementary Calculus, Journal of Automated Reasoning 6(3), pp.341-359.
Bledsoe W.W. (1977), Non-resolution Theorem Proving, Artificial Intelligence 9, pp.1-35.
Bledsoe W.W., Boyer R.S., Henneman W.H. (1972), Computer Proofs of Limit Theorems, Artificial Intelligence 3, pp.27-60.
Blyth I.S., Varlet I.C. (1994), Ockham Algebras, Oxford Science Publications.
Bonacina M.P. (1991), Problems in Lukasiewicz Logic, AAR Newsletter 18, pp.5-12.
Bos J. (2000), Applied Theorem Proving - Natural Language Testsuite, http://www.coli.uni-sb.de/~bos/atp/.
Bos J. (2000), DORIS: Discourse Oriented Representation and Inference System, http://www.coli.uni-sb.de/~bos/atp/doris.html.
Bourbaki N. (1989), Algebra I - Chapters 1-3, Springer Verlag.
Bourely C., Caferra R., Peltier N. (1994), A Method for Building Models Automatically. Experiments with an Extension of Otter, Bundy A., Proceedings of the 12th International Conference on Automated Deduction (Nancy, France), pp.72-86, Lecture Notes in Artificial Intelligence 814, Springer-Verlag.
Boyer R., Lusk E.L., McCune W.W., Overbeek R., Stickel M.E., Wos L. (1986), Set Theory in First-Order Logic: Clauses for Godel's Axioms, Journal of Automated Reasoning 2(3), pp.287-327.
Brushi M. (1991), The Halting Problem, AAR Newsletter 17, pp.7-12.
Buch A., Hillenbrand T. (1996), Waldmeister: Development of a High Performance Completion-Based Theorem Prover, SEKI-Report SR-96-01, AG Effiziente Algorithmen, Universität Kaiserslautern, Kaiserslautern, Germany.
Buch A., Hillenbrand T., Fettig R. (1996), Waldmeister: High Performance Equational Theorem Proving, Calmet J., Limongelli C., Proceedings of the International Symposium on Design and Implementation of Symbolic Computation Systems (Karlsruhe, Germany), pp.63-64, Lecture Notes in Computer Science 1128, Springer-Verlag.
Bumcroft R. (1965), , Proceedings of the Glasgow Mathematical Association 7(1).
Bundy A. (1983), The Computer Modelling of Mathematical Reasoning, Academic Press.
Burkholder L. (1987), A 76th Automated Theorem Proving Problem, AAR Newsletter 8, pp.6-7.
Burkholder L. (1987), The Halting Problem, SIGCSE bulletin.
Carroll G.R., Hannan M.T. (2000), The Demography of Corporations and Industries, Princeton University Press.
Carroll L. (1986), Lewis Carroll's Symbolic Logic, C.N. Potter.
Chang C-L. (1970), The Unit Proof and the Input Proof in Theorem Proving, Journal of the ACM 17(4), pp.698-707.
Chang C-L., Lee R.C-T. (1973), Symbolic Logic and Mechanical Theorem Proving, Academic Press.
Chellas B.F. (1980), Modal Logic, Cambridge University Press.
Chu H., Plaisted D. (1994), Semantically Guided First-order Theorem Proving using Hyper-linking, Bundy A., Proceedings of the 12th International Conference on Automated Deduction (Nancy, France), pp.192-206, Lecture Notes in Artificial Intelligence 814, Springer-Verlag.
Church A. (1956), Introduction to Mathematical Logic I, Princeton University Press.
Claessen K. (2003), Email to G. Sutcliffe.
Claessen K., Hähnle R., M{\aa}rtensson J. (2002), Verification of Hardware Systems with First-Order Logic, Sutcliffe G., Pelletier J., Suttner C., Proceedings of the CADE-18 Workshop - Problem and Problem Sets for ATP (Copenhagen, Denmark), Department of Computer Science, University of Copenhagen, Technical Report 02/10.
Colton S. (2001), Email to G. Sutcliffe.
Comaromi J.P., Beall J., Matthews W.E., New G.R. (1989), Dewey Decimal Classification and Relative Index, Forest Press.
Cook S., Reckhow R. (1979), The Relative Efficiency of Propositional Proof Systems, Journal of Symbolic Logic 44, pp.36-50.
Curry H.B., Feys R. (1958), Combinatory Logic I, North Holland, Amsterdam.
Curry H.B., Hindley J.R., Seldin J.P. (1972), Combinatory Logic II, North Holland, Amsterdam.
Dafa L. (1994), The Formulation of the Halting Problem Is Not Suitable for Describing the Halting Problem, AAR Newsletter 27, pp.1-7.
Dahn B.I. (1995), Email to G. Sutcliffe.
DeChampeaux D. (1979), Sub-problem Finder and Instance Checker: Two Co-operating Preprocessors for Theorem Provers, Proceedings of the 6th International Joint Conference on Artificial Intelligence, pp.191-196, Morgan Kaufmann.
DeChampeaux D. (1972), Sub-problem Finder and Instance Checker: Two Co-operating Preprocessors for Theorem Provers, Journal of the ACM 33, pp.633-657.
Denzinger J., Kronenburg M., Schulz S. (1997), DISCOUNT: A Distributed and Learning Equational Prover, Journal of Automated Reasoning 18(2), pp.189-198.
Denzinger J., Schulz S. (1996), Learning Domain Knowledge to Improve Theorem Proving, McRobbie M., Slaney J.K., Proceedings of the 13th International Conference on Automated Deduction (New Brunswick, USA), pp.62-76, Lecture Notes in Artificial Intelligence 1104, Springer-Verlag.
Denzinger J., Schulz S. (1996), Recording and Analysing Knowledge-Based Distributed Deduction Processes, Journal of Symbolic Computation 21, pp.523-541.
Draeger J. (1993), Anwendung des Theorembeweisers SETHEO auf angeordnete Körper, FKI-186-93, Technische Universität München, München, Germany.
Ernst Z. (2002), Completions from TV-> to H->, Bulletin of the Section of Logic.
Ernst Z., Fitelson B., Harris K., McCune W., Padmanabhan R., Veroff R., Wos L. (2002), More First-order Test Problems in Math and Logic, Sutcliffe G., Pelletier J., Suttner C., Proceedings of the CADE-18 Workshop - Problem and Problem Sets for ATP (Copenhagen, Denmark), Department of Computer Science, University of Copenhagen, Technical Report 02/10.
Ernst Z., Fitelson B., Harris K., Wos L. (2001), A Concise Axiomatization of RM->, Bulletin of the Section of Logic 30(4), pp.191-194.
Eschenbach C., Habel C., Kulik L. (1999), Representing Simple Trajectories as Oriented Curves, Russell I., Kumar A., Proceedings of the 12th Florida Artificial Intelligence Research Symposium (Orlando, USA), pp.431-436, AAAI Press.
Fermüller C. (1994), Email to G. Sutcliffe.
Fermüller C., Leitsch A., Tammet T., Zamov N. (1993), Resolution Methods for the Decision Problem, Lecture Notes in Computer Science 679, Springer-Verlag.
Fitelson B., Harris K. (2001), Distributivity in LN0 and other Sentential Logics, Journal of Automated Reasoning 27(2), pp.141-156.
Fitelson B., Wos L. (2001), Missing Proofs Found, Journal of Automated Reasoning 27(2), pp.201-225.
Fleisig S., Loveland D.W., Smiley A.K., Yarmush D.L. (1974), An Implementation of the Model Elimination Proof Procedure, Journal of the ACM 21(1), pp.124-139.
Font J.M., Rodriguez A.J., Torrens A. (1984), Wajsberg Algebras, Stochastica 8(1), pp.5-31.
Friedman J. (1963), A Semi-Decision Procedure for the Functional Calculus, Journal of the ACM 10(1), pp.1-24.
Fuchs M. (1994), The Application of Goal-Orientated Heuristics for Proving Equational Theorems via the Unfailing Knuth-Bendix Completion Procedure. A case study: lattice ordered groups, SEKI-Report SR-94-02, Universität Kaiserslautern, Kaiserslautern, Germany.
Fujita M., Hasegawa R., Koshimura M., Fujita H. (1992), Model Generation Theorem Provers on a Parallel Inference Machine, Proceedings of the International Conference on Fifth Generation Computer Systems, pp.357-375.
Fujita M., Slaney J.K., Bennett F. (1993), Automatic Generation of Some Results in Finite Algebra, Bajcsy R., Proceedings of the 13th International Joint Conference on Artificial Intelligence (Chambery, France), pp.52-57, Morgan Kaufmann.
Ganzinger H. (1998), Email to G. Sutcliffe.
Geisler T. (1996), Email to G. Sutcliffe.
Geisler T. (1995), Email to C. Suttner.
Genesereth M.R., Fikes R.E. (1992), Knowledge Interchange Format, Version 3.0 Reference Manual, Logic-92-1, Computer Science Department, Stanford University.
Glickfield B., Overbeek R. (1986), A Foray into Combinatory Logic, Journal of Automated Reasoning 2(4), pp.419-431.
Goller C. (1993), Anwendung des Theorembeweisers SETHEO auf die Theorie der Halbgruppen und Gruppen, FKI-174-93, Technische Universität München, München, Germany.
Gow J., Walsh T., Colton S., Sorge V. (2003), Proceedings of the Workshop on Challenges and Novel Applications for Automated Reasoning, 19th International Conference on Automated Reasoning.
Guard J.R., Oglesby F.C., Bennett J.H., Settle L.G. (1969), Semi-Automated Mathematics, Journal of the ACM 16(1), pp.49-62.
Hannan M.T. (1998), Rethinking Age Dependence in Organizational Mortality: Logical Formalizations, American Journal of Sociology 104, pp.126-164.
Harary F. (1969), Graph Theory, Addison-Wesley.
Hardy G.H., Wright E.M. (1992), An Introduction to the Theory of Numbers, Oxford UP.
Harrison J. (2001), Email to G. Sutcliffe.
Harrison J. (1995), Email to G. Sutcliffe.
Hayes J.P. (1993), Introduction to Digital Logic Circuit Design, Addison Wesley.
He L. (2001), I-SATCHMO: An Improvement of SATCHMO, Journal of Automated Reasoning 27(3), pp.313-322.
He L., Chao Y., Shimajiri Y., Seki H., Itoh H. (1998), A-SATCHMORE: SATCHMORE with Availability Checking, New Generation Computing 16, pp.55-74.
Henkin L. (1950), Completeness in the Theory of Types, Journal of Symbolic Logic 15, pp.81-91.
Henkin L., Monk J., Tarski A. (1971), Cylindrical Algebras, North-Holland.
Higman G., Neumann B.H. (1952), Groups as Groupoids with One Law, Publicationes Mathematicae Debrecen 2, pp.215-227.
Hillenbrand T., Buch A., Fettig R. (1996), On Gaining Efficiency in Completion-Based Theorem Proving, Ganzinger H., Proceedings of the 7th International Conference on Rewriting Techniques and Applications (New Brunswick, USA), pp.432-435, Lecture Notes in Computer Science 1103, Springer-Verlag.
Hillenbrand T., Buch A., Vogt R., Löchner B. (1997), Waldmeister: High Performance Equational Deduction, Journal of Automated Reasoning 18(2), pp.265-270.
Hillenbrand T., Jaeger A., Löchner B. (1999), Waldmeister - Improvements in Performance and Ease of Use, Ganzinger H., Proceedings of the 16th International Conference on Automated Deduction (Trento, Italy), pp.232-236, Lecture Notes in Artificial Intelligence 1632, Springer-Verlag.
Hoepman J-H. (1994), Uniform Deterministic Self-Stabilizing Ring-Orientation on Odd-Length Rings, Tel G., Vitanyi P., Proceedings of the 8th International Workshop on Distributed Algorithms (Terschelling, The Netherlands), pp.265-279, Lecture Notes in Computer Science 857, Springer-Verlag.
Howson A.G. (1972), A Handbook of Terms used in Algebra and Analysis, Cambrige University Press.
Huang G. (1996), Using OTTER and Prolog to Solve TopSpin, AAR Newsletter 33, pp.3-4.
Huang G., Myers D. (1998), Subgoal Strategies for Solving Board Puzzles, Journal of Automated Reasoning 20(3), pp.215-253.
Hustadt U., Schmidt R.A. (1997), On Evaluating Decision Procedures for Modal Logics, Pollack M.E., Proceedings of the 15th International Joint Conference on Artificial Intelligence (Nagoya, Japan), pp.202-207, Morgan Kaufmann.
Hähnle R. (1994), Email to G. Sutcliffe.
Hähnle R., Beckert B., Gerberding S. (1994), The Many-Valued Tableau-Based Theorem Prover 3TAP, TR 30/94, Fakultät für Informatik, Universät Karlsruhe, Karlsruhe, Germany.
Hähnle R., Kerber M., Weidenbach C. (1996), Common Syntax of the DFG-Schwerpunktprogramm Deduction, TR 10/96, Fakultät für Informatik, Universät Karlsruhe, Karlsruhe, Germany.
ICOT (1992), Model Generation Theorem Prover, MGTP, FGCS'92 - International Conference on Fifth Generation Computer Systems, Demonstrations, pp.63-74.
Iwanuma K. (1997), Lemma Matching for a PTTP-based Top-down Theorem Prover, McCune W.W., Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), pp.146-160, Lecture Notes in Artificial Intelligence 1249, Springer-Verlag.
Jech T. (2002), Email to G. Sutcliffe.
Jech T. (1995), Otter Experiments in a System of Combinatory Logic, Journal of Automated Reasoning 14(3), pp.413-426.
Jech T. (1993), LD-Algebras, Association for Automated Reasoning Newsletter 22, pp.9-12.
Jones R. (1993), Little Problem, Solved by Otter, HOL mailing list http://lal.cs.byu.edu/lal/holdoc/info-hol/15xx/1572.html.
Kalish D., Montegue R. (1964), Logic: Techniques of Formal Reasoning, World, Harcourt and Brace.
Kamps J. (2000), Email to G. Sutcliffe.
Kamps J. (1995), Email to G. Sutcliffe.
Kamps J. (1994), Email to G. Sutcliffe.
Kautz H., Selman B. (1996), Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search, Clancey W., Weld D., Proceedings of the 13th National Conference on Artificial Intelligence (Portland, USA), pp.1194-1201.
Kautz H., Selman B. (1992), Planning as Satisfiability, Neumann B., Proceedings of the 10th European Conference on Artificial Intelligence (Vienna, Austria).
Kelley J.L. (1955), General Topology, D. Van Nostrand.
Kohlhase M. (URL), OMDoc: A Standard for Open Mathematical Documents, http://www.mathweb.org/omdoc/.
Konev B. (2003), Email to G. Sutcliffe.
Kulik L., Eschenbach C. (1999), A Geometry of Oriented Curves, Report from the project: Axiomatics of Spatial Concepts, Department for Informatics, University of Hamburg, Hamburg, USA.
Kunen K. (1992), Single Axioms for Groups, Journal of Automated Reasoning 9(3), pp.291-308.
Kurosh A.G. (1956), The Theory of Groups, pp.99-100, Chelsea.
Lawrence J.D., Starkey J.D. (1974), Experimental Tests of Resolution Based Theorem-proving Strategies., Computer Science Department, Washington State University, Pullman, USA.
Leblanc H. (1983), Alternatives to Standard First-Order Semantics, Gabbay D., Guenther F., Handbook of Philosophical Logic, pp.189-274, D. Reidel.
Lee S-J. (1992), Email to G. Sutcliffe.
Lee S-J. (1990), CLIN: An Automated Reasoning System Using Clause Linking, PhD thesis, University of North-Carolina at Chapel Hill, Chapel Hill, USA.
Lee S-J., Plaisted D.A. (1992), Eliminating Duplication with the Hyper-Linking Strategy, Journal of Automated Reasoning 9(1), pp.25-42.
Letz R. (1997), LINUS: A Link Instantiation Prover with Unit Support, Journal of Automated Reasoning 18(2), pp.205-210.
Letz R., Mayr K., Goller C. (1994), Controlled Integration of the Cut Rule into Connection Tableau Calculi, Journal of Automated Reasoning 13(3), pp.297-337.
Letz R., Schumann J., Bayerl S., Bibel W. (1992), SETHEO: A High-Performance Theorem Prover, Journal of Automated Reasoning 8(2), pp.183-212.
Lifschitz V. (1989), What is the Inverse Method?, Journal of Automated Reasoning 5(1), pp.1-24.
Loveland D.W. (1969), Theorem-provers Combining Model Elimination and Resolution, Machine Intelligence 4, pp.73-86.
Loveland D.W. (1968), Mechanical Theorem Proving by Model Elimination, Journal of the ACM 15(2), pp.236-251.
Luckham D. (1968), Some Tree-paring Strategies for Theorem Proving, Machine Intelligence 3, pp.95-112.
Lukasiewicz J. (1963), Elements of Mathematical Logic, Pergamon Press.
Lukasiewicz J. (1948), The Shortest Axiom of the Implicational Calculus of Propositions, Proceedings of the Royal Irish Academy 52(3), pp.25-33.
Lusk E.L., McCune W.W. (1993), Uniform Strategies: The CADE-11 Theorem Proving Contest, Journal of Automated Reasoning 11(3), pp.317-331.
Lusk E.L., McCune W.W. (1992), Experiments with ROO, a Parallel Automated Deduction System, Fronhofer B., Wrightson G., Parallelization in Inference Systems, pp.139-162.
Lusk E.L., Overbeek R. (1985), Non-Horn Problems, Journal of Automated Reasoning 1(1), pp.103-114.
Lusk E.L., Overbeek R. (1985), Reasoning about Equality, Journal of Automated Reasoning 1(2), pp.209-228.
Lusk E.L., Wos L. (1992), Benchmark Problems in Which Equality Plays the Major Role, Kapur D., Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, USA), pp.781-785, Lecture Notes in Artificial Intelligence 607, Springer-Verlag.
Lusk E.L., Wos L. (1991), Benchmark Problems in Which Equality Plays the Major Role, MCS-P275-1191, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA.
MacLane S. (1971), Categories for the Working Mathematician, Springer Verlag.
Manthey R., Bry F. (1988), SATCHMO: A Theorem Prover Implemented in Prolog, Lusk E. Overbeek R., Proceedings of the 9th International Conference on Automated Deduction (Argonne, USA), pp.415-434, Lecture Notes in Computer Science 310, Springer-Verlag.
Martensson J. (2002), Email to G. Sutcliffe.
McCharen J.D., Overbeek R.A., Wos L.A. (1976), Problems and Experiments for and with Automated Theorem-Proving Programs, IEEE Transactions on Computers C-25(8), pp.773-782.
McCune W.W. (URL), EQP: Equational Prover, http://www-unix.mcs.anl.gov/AR/eqp/.
McCune W.W. (URL), Otter: An Automated Deduction System, http://www-unix.mcs.anl.gov/AR/otter/.
McCune W.W. (2003), Mace4 Reference Manual and Guide, ANL/MCS-TM-264, Argonne National Laboratory, Argonne, USA.
McCune W.W. (1998), Automatic Proofs and Counterexamples for some Ortholattice Identities, Information Processing Letters 65.
McCune W.W. (1998), Email to G. Sutcliffe.
McCune W.W. (1995), Four Challenge Problems in Equational Logic, AAR Newsletter 28, pp.9-10.
McCune W.W. (1994), Otter 3.0 Reference Manual and Guide, ANL-94/6, Argonne National Laboratory, Argonne, USA.
McCune W.W. (1993), Single Axioms for Groups and Abelian Groups with Various Operations, Journal of Automated Reasoning 10(1), pp.1-13.
McCune W.W. (1992), Automated Discovery of New Axiomatisations of the Left Group and Right Group Calculi, Journal of Automated Reasoning 9(1), pp.1-24.
McCune W.W. (1992), Email to G. Sutcliffe.
McCune W.W. (1988), Challenge Equality Problems in Lattice Theory, Proceedings of the 9th International Conference on Automated Deduction - Argonne Ilinois, USA, May 1988 (Berlin), pp.704-709, Springer.
McCune W.W., Lusk E. (1992), A Challenging Theorem of Levi, AAR Newsletter 21, pp.8.
McCune W.W., Padmanabhan R. (1996), Automated Deduction in Equational Logic and Cubic Curves, Lecture Notes in Artificial Intelligence, Springer-Verlag.
McCune W.W., Rose M., Veroff R. (URL), Sheffer Stroke Bases for Ortholattices, http://www.mcs.anl.gov/~mccune/papers/olsax/.
McCune W.W., Veroff R., Fitelson B., Harris K., Feist A., Wos L. (2002), Short Single Axioms for Boolean Algebra, Journal of Automated Reasoning 29(1), pp.1-16.
McCune W.W., Wos L. (1992), Experiments in Automated Deduction with Condensed Detachment, Kapur D., Proceedings of the 11th International Conference on Automated Deduction (Saratoga Springs, USA), pp.209-223, Lecture Notes in Artificial Intelligence 607, Springer-Verlag.
McCune W.W., Wos L. (1988), Some Fixed Point Problems in Combinatory Logic, AAR Newsletter 10, pp.7-8.
McCune W.W., Wos L. (1987), A Case Study in Automated Theorem Proving: Finding Sages in Combinatory Logic, Journal of Automated Reasoning 3(1), pp.91-107.
Megill N., Pavicic M. (2000), Equations and State and Lattice Properties that hold in Infinite Dimensional Hilber Space, International Journal of Theoretical Physics 39, pp.2337-2379.
Meredith C.A. (1953), Single Axioms for the Systems (C,N), (C,0), and (A,N) of the Two-valued Propositional Calculus, Journal of Computing Systems 1, pp.155-164.
Meredith C.A., Prior A.N. (1968), Equational Logic, Notre Dame Journal of Formal Logic 9, pp.212-226.
Michie D., Ross R., Shannan G.J. (1972), G-deduction, Machine Intelligence 7, pp.141-165.
Mitchell B. (1967), Theory of Categories, Pure and Applied Mathematics, Academic Press.
Montegue R. (1955), On the Paradox of Grounded Classes, Journal of Symbolic Logic 20, pp.140.
Morgan C. (1984), Logic Problems, AAR Newsletter 3, pp.5-5.
Munkres J.R. (1975), Topology: A First Course, Prentice-Hall.
Neugebauer G. (1994), XTPTP-An X Window Interface for the TPTP Library, IMN, HTWK Leipzig, Leipzig, Germany.
Neumann B.H. (1986), Yet Another Single Law for Groups, Illinois Journal of Mathematics 30(2), pp.295-300.
Neumann B.H. (1981), Another Single Law for Groups, Bulletin of the Australian Maths Society 23, pp.81-102.
Neumann J. von (1925), Eine Axiomatisierung der Mengenlehre, Journal für die reine und angewandte Mathematik 154, pp.219-240.
Newell A., Shaw J.C., Simon H.A. (1963), Empirical Explorations with the Logic Theory Machine: A Case Study in Heuristics, Feigenbaum E.A. Feldman J., Computers and Thought, pp.109-133, McGraw-Hill.
Newell A., Simon H. (1972), Human Problem Solving, Prentice-Hall.
Nieuwenhuis R., Rivero J.M., Vallejo M.A. (1997), Dedam: A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses, McCune W.W., Proceedings of the 14th International Conference on Automated Deduction (Townsville, Australia), Lecture Notes in Artificial Intelligence 1249, Springer-Verlag.
Nonnengart A., Rock G., Weidenbach C. (1998), On Generating Small Clause Normal Forms, Kirchner C., Kirchner H., Proceedings of the 15th International Conference on Automated Deduction (Lindau, Germany), pp.397-411, Lecture Notes in Artificial Intelligence 1421, Springer-Verlag.
O'Rourke P. (1989), LT Revisited: Explanation-Based Learning and the Logic of Principia Mathematica, Machine Learning 4, pp.117-159.
Ohlbach H.J. (1985), Predicate Logic Hacker Tricks, Journal of Automated Reasoning 1(4), pp.435-440.
Ohlbach H.J., Schmidt R.A. (1995), Functional Translation and Second-Order Frame Properties of Modal Logics, MPI-I-95-2-002, Max-Planck-Institut für Informatik, Saarbrücken, Germany.
Ohlbach H.J., Schmidt-Schauss M. (1985), The Lion and the Unicorn, Journal of Automated Reasoning 1(3), pp.327-332.
Otter, The problem collection distributed with the Otter ATP system [McC90].
Overbeek R. (1993), The CADE-11 Competitions: A Personal View, Journal of Automated Reasoning 11(3), pp.315-316.
Overbeek R. (1990), ATP competition announced at CADE-10.
Overbeek R., McCharen J., Wos L. (1976), Complexity and Related Enhancements for Automated Theorem-Proving Programs, Computers and Mathematics with Applications 2, pp.1-16.
Padmanabhan R., Penner P. (2000), A Hyperbase for Binary Lattice Hyperidentities, Journal of Automated Reasoning 24(3), pp.365-370.
Paramasivam M., Plaisted D. (1995), Automated Deduction Techniques for Classification in Concept Languages.
Pastre D. (1999), Email to G. Sutcliffe.
Peli G., Bruggeman J., Masuch M., O Nuallain B. (1994), A Logical Approach to Formalizing Organizational Ecology: Formalizing the Inertia-Fragment in First-Order Logic, American Sociological Review 59(2).
Peli G., Bruggeman J., Masuch M., O Nuallain B. (1992), A Logical Approach to Formalizing Organizational Ecology: Formalizing the Inertia-Fragment in First-Order Logic, CCSOM Preprint 92-74, Department of Statustics and Methodology, University of Amsterdam.
Peli G., Masuch M. (1994), The Logic of Propogation Strategies: Axiomatizing a Fragment of Organization Ecology in First-Order Logic, Moore D.P., Academy Of Management: Best Papers Proceedings 1994, pp.218-222.
Peli G., Masuch M. (1993), The Logic of Propogation Strategies: Axiomatizing a Fragment of Organizational Ecology in First-Order Logic, CCSOM Report 93-100, Department of Statustics and Methodology, University of Amsterdam.
Pelletier F.J. (1995), Email to G. Sutcliffe.
Pelletier F.J. (1988), Errata, Journal of Automated Reasoning 4(2), pp.235-236.
Pelletier F.J. (1987), Further Developments in THINKER, and Automated Theorem Prover, TR-ARP-16/87, Automated Reasoning Project, Australian National University, Canberra, Australia.
Pelletier F.J. (1986), Seventy-five Problems for Testing Automatic Theorem Provers, Journal of Automated Reasoning 2(2), pp.191-216.
Pelletier F.J. (1982), Completely Non-clausal, Completely Heuristically Driven Automatic Theorem Proving, TR82-7, Department of Computer Science, Edmonton, Alberta.
Pelletier F.J., Rudnicki P. (1986), Non-Obviousness, Association for Automated Reasoning Newsletter, pp.4-5.
Peltier N. (1998), A New Method for Automated Finite Model Building Exploiting Failures and Symmetries, Journal of Logic and Computation 8(4), pp.511-543.
Peterson G., Stickel M.E. (1981), Complete Sets of Reductions for Some Equational Theories, Journal of the ACM 28(8), pp.233-264.
Pfenning F. (1988), Single Axioms in the Implicational Propositional Calculus, Lusk E. Overbeek R., Proceedings of the 9th International Conference on Automated Deduction (Argonne, USA), pp.710 - 713, Lecture Notes in Computer Science 310, Springer-Verlag.
Plaisted D.A. (1994), The Search Efficiency of Theorem Proving Strategies, Bundy A., Proceedings of the 12th International Conference on Automated Deduction (Nancy, France), pp.57-71, Lecture Notes in Artificial Intelligence 814, Springer-Verlag.
Plaisted D.A. (1988), Non-Horn Clause Logic Programming Without Contrapositives, Journal of Automated Reasoning 4(3), pp.287-325.
Plaisted D.A. (1982), A Simplified Problem Reduction Format, Artificial Intelligence 18, pp.227-261.
Plaisted D.A. (1981), Theorem Proving with Abstraction, Artificial Intelligence 16, pp.47-108.
Pollock J.L. (1990), Interest Driven Suppositional Reasoning, Journal of Automated Reasoning 6(4), pp.419-461.
Popplestone R.J. (1970), Freddy, Things and Sets.
Prasetya W. (1993), How to get FAUST?, HOL mailing list http://lal.cs.byu.edu/lal/holdoc/info-hol/15xx/1515.html.
Quaife A. (1992), Automated Development of Fundamental Mathematical Theories, Kluwer Academic Publishers.
Quaife A. (1992), Email to G. Sutcliffe.
Quaife A. (1992), Automated Deduction in von Neumann-Bernays-Godel Set Theory, Journal of Automated Reasoning 8(1), pp.91-147.
Quaife A. (1992), Problems based on NBG Set Theory.
Quaife A. (1990), Andrews' Challenge Problem Revisited, AAR Newsletter 15, pp.3-7.
Quaife A. (1989), Automated Development of Tarski's Geometry, Journal of Automated Reasoning 5(1), pp.97-118.
Quaife A. (1989), Email to L. Wos.
Quine W.V. (1969), Set Theory and its Logic, Harvard University Press.
Raptis D. (1995), Email to G. Sutcliffe.
Reboh R., Raphael B., Yates R.A., Kling R.E., Velarde C. (1972), Study of automatic theorem proving programs, Technical Note 72, Artificial Intelligence Center, SRI International, Menlo Park, CA.
Robinson J.A. (1963), Theorem Proving on the Computer, Jounal of the ACM 10(2), pp.163-174.
Rose M., Wilkinson K. (2001), Application of Model Search to Lattice Theory, Association for Automated Reasoning Newsletter 52.
Ross K.A. (1990), Elementary Analysis: The Theory of Calculus, Springer.
Rudnicki P. (1993), Email to G. Sutcliffe.
Russell S.J., Norvig P. (1995), Artificial Intelligence: a modern approach, Prentice-Hall.
SETHEO, AR Research Group, Technische Universität München, Problem Library, No longer available.
SPRFN, The problem collection distributed with the SPRFN ATP system.
Schulz S. (2001), Email to G. Sutcliffe.
Schulz S. (1999), Email to G. Sutcliffe.
Schulz S. (1995), Explanation Based Learning for Distributed Equational Deduction, MSc thesis, Universität Kaiserslautern.
Schwabbauser W., Szmielew W., Tarski A. (1983), Metamathematische Methoden in der Geometrie, Springer-Verlag.
Scott D. (1979), Identity and Existence in Intuitionist Logic, Fournam M.P., Durham Proceedings Applications of Sheaves, pp.660-696, Lecture Notes in Mathematics Volume 753, Springer.
Segre A., Elkan C. (1994), A High-Performance Explanation-Based Learning Algorithm, Artificial Intelligence 69(NEED), pp.1-50.
Shostak R.E. (1976), Refutation Graphs, Artificial Intelligence 7, pp.51-64.
Siklossy L., Rich A., Marinov V. (1973), Breadth First Search: Some Surprising {R}esults, Artificial Intelligence 4, pp.1-27.
Slagle J.R. (1967), Automatic Theorem Proving with Renamable and Semantic Resolution, Journal of the ACM 14(4), pp.687-697.
Slaney J.K. (2003), Email to G. Sutcliffe.
Slaney J.K. (2002), More Proofs of an Axiom of Lukasiewicz, Journal of Automated Reasoning 29(1), pp.59-66.
Slaney J.K. (1993), SCOTT: A Model-Guided Theorem Prover, Bajcsy R., Proceedings of the 13th International Conference on Artificial Intelligence (Chambery, France), pp.109-114, Morgan-Kaufmann.
Slaney J.K. (1993), Email to G. Sutcliffe.
Slaney J.K. (1992), FINDER (Finite Domain Enumerator): Notes and Guide, TR-ARP-1/92, Automated Reasoning Project, Australian National University, Canberra, Australia.
Slaney J.K., Fujita M., Stickel M.E. (1995), Automated Reasoning and Exhaustive Search: Quasigroup Existence Problems, Computers and Mathematics with Applications 29(2), pp.115-132.
Slaney J.K., Hodgson K. (1997), Extending SCOTT to use Multiple Models, Pollack M.E., Proceedings of the 15th International Joint Conference on Artificial Intelligence (Nagoya, Japan), pp.???-???, Morgan Kaufmann.
Slaney J.K., Lusk E., McCune W.W. (1994), SCOTT: Semantically Constrained Otter, System Description, Bundy A., Proceedings of the 12th International Conference on Automated Deduction (Nancy, France), pp.764-768, Lecture Notes in Artificial Intelligence 814, Springer-Verlag.
Smullyan R.M. (1987), Forever Undecided - A Puzzle Guide to Godel, Knopf.
Smullyan R.M. (1978), What is the Name of This Book? The Riddle of Dracula and Other Logical Puzzles, Prentice-Hall.
Smullyan R.M. (1978), To Mock a Mocking Bird and Other Logic Puzzles, Knopf.
Socher-Ambrosius R. (1992), How to Avoid the Derivation of Redundant Clauses in Reasoning Systems`, Journal of Automated Reasoning 9(1), pp.77-97.
Sterling L., Shapiro E. (1986), The Art of Prolog, MIT Press.
Stevens R.L. (1992), Unpublished Note.
Stevens R.L. (1988), Challenge Problems from Nonassociative Rings for Theorem Provers, Lusk E. Overbeek R., Proceedings of the 9th International Conference on Automated Deduction (Argonne, USA), pp.730-734, Lecture Notes in Computer Science 310, Springer-Verlag.
Stevens R.L. (1987), Some Experiments in Nonassociative Ring Theory with an Automated Theorem Prover, Journal of Automated Reasoning 3(2), pp.211-221.
Stickel M.E. (1994), Upside-Down Meta-Interpretation of the Model Elimination Theorem-Proving Procedure for Deduction and Abduction, Journal of Automated Reasoning 13(2), pp.189-210.
Stickel M.E. (1993), Email to G. Sutcliffe.
Stickel M.E. (1986), Schubert's Steamroller Problem: Formulations and Solutions, Journal of Automated Reasoning 2(1), pp.89-101.
Stickel M.E. (1984), A Prolog Technology Theorem Prover, New Generation Computing 2(4), pp.371-383.
Stolzenburg F. (1995), Email to Geoff Sutcliffe..
Sussman G.J. (1973), A Computational Model of Skill Acquisition, 297, MIT Artificial Intelligence Laboratory.
Sutcliffe G., Gao Y., Colton S. (2003), A Grand Challenge of Theorem Discovery, Gow J., Walsh T., Colton S., Sorge V., Proceedings of the Workshop on Challenges and Novel Applications for Automated Reasoning, 19th International Conference on Automated Reasoning (Miami, USA), pp.1-11.
Sutcliffe G., Melville S. (1996), The Practice of Clausification in Automatic Theorem Proving, South African Computer Journal 18, pp.57-68.
Sutcliffe G., Suttner C.B. (1998), The TPTP Problem Library: CNF Release v1.2.1, Journal of Automated Reasoning 21(2), pp.177-203.
Sutcliffe G., Zimmer J., Schulz S. (2003), Communication Standards for Automated Theorem Proving Tools, Sorge V., Colton S., Fisher M., Gow J., Proceedings of the Workshop on Agents and Automated Reasoning, 18th International Joint Conference on Artificial Intelligence (Acapulco, Mexico), pp.52-57.
Suttner C.B. (1995), Parallelization of Search-based Systems by Static Partitioning with Slackness, PhD thesis, Institut für Informatik, Technische Universität München, Munich, Germany, and Dissertationen zur künstlichen Intelligenz 101, Infix-Verlag.
Tammet T. (1994), Email to Geoff Sutcliffe..
Tarski A. (1959), What is Elementary Geometry?, Henkin L., Proceedings of an International Symposium. The axiomatic method with special reference to geometry and physics.
Tarski A. (1951), A Decision Method for Elementary Algebra and Geometry, University of California Press.
Tarski A. (1938), Ein Beitrag zur Axiomatik der Abelschen Gruppe n, Fundamenta Mathematicae 30, pp.253-256.
The ILF Group (URL), The ILF System: A Tool for the Integration of Logical Functions, http://www-irm.mathematik.hu-berlin.de/~ilf/.
Trybulec A. (1989), Tarski Grothendieck Set Theory, Journal of Formalized Mathematics Axiomatics.
Trybulec Z., Swieczkowska H. (1989), Boolean Properties of Sets, Journal of Formalized Mathematics 1.
Tseitin G.S. (1983), On the Complexity of Derivations in Propositional Calculus, Siekmann J., Wrightson G., The Automation of Reasoning, Springer-Verlag.
Urquart A. (1987), Hard Problems for Resolution, Journal of the ACM 34(1), pp.209-219.
Veroff R. (2001), A Strategy for Proving Theorems in Many-Valued Logic, AAR Newsletter 53.
Veroff R. (1994), Problem Set, AAR Newsletter 24, pp.8.
Veroff R. (1993), Email to G. Sutcliffe.
Veroff R. (1992), Email to G. Sutcliffe.
Wang H. (1965), Formalization and Automatic Theorem-Proving, Kalenich W.A., Proceedings of the IFIP Congress (NEED), pp.51-58, Spartan Books.
Wang T-C. (1985), Designing Examples for Semantically Guided Hierarchical Deduction, Joshi A., Proceedings of the 9th International Joint Conference on Artificial Intelligence (Los Angeles, USA), pp.1201-1207.
Wang T-C., Bledsoe W.W. (1987), Hierarchical Deduction, Journal of Automated Reasoning 3(1), pp.35-77.
Weibel C. (1994), An Introduction to Homological Algebra, Cambridge University Press.
Weidenbach C. (2001), Combining Superposition, Sorts and Splitting, Robinson A., Voronkov A., Handbook of Automated Reasoning, pp.1965-2011, Elsevier Science.
Weidenbach C. (1999), Towards and Automatic Analysis of Security Protocols in First Order Logic, Ganzinger H., Proceedings of the 16th International Conference on Automated Deduction (Trento, Italy), pp.314-328, Lecture Notes in Artificial Intelligence 1632, Springer-Verlag.
Weidenbach C. (1997), Email to G. Sutcliffe.
Weidenbach C. (1994), Email to G. Sutcliffe.
Weidenbach C. (1993), Extending the Resolution Method with Sorts, Bajcsy R., Proceedings of the 13th International Joint Conference on Artificial Intelligence (Chambery, France), pp.60-65, Morgan Kaufmann.
Weidenbach C., Gaede B., Rock G. (1996), SPASS and FLOTTER, McRobbie M., Slaney J.K., Proceedings of the 13th International Conference on Automated Deduction (New Brunswick, USA), pp.141-145, Lecture Notes in Artificial Intelligence 1104, Springer-Verlag.
Whitehead A.N., Russell B. (1927), Principia Mathematica, Cambridge United Press.
Whitesitt J.E. (1961), Boolean Algebra and Its Applications, Addison-Wesley.
Wick C., McCune W.W. (1989), Automated Reasoning about Elementary Point-Set Topology, Journal of Automated Reasoning 5, pp.239 - 255.
Wilson D.S., Loveland D.W. (1989), Incorporating Relevancy Testing in SATCHMO, CS-1989-24, Department of Computer Science, Duke University, Durham, USA.
Wilson G.A., Minker J. (1976), Resolution, Refinements, and Search Strategies: A Comparative Study, IEEE Transactions on Computers C-25(8), pp.782-801.
Winker S. (1990), Robbins Algebra: Conditions that make a Near-Boolean Algebra Boolean, Journal of Automated Reasoning 6(4), pp.465-489.
Winker S. (1982), Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions, Journal of the ACM 29(2), pp.273-284.
Wojciechowski W.S., Wojcik A.S. (1983), Automated Design of Multi-valued Logic Circuits by Automated Theorem Proving Techniques, IEEE Transactions on Computers C-32(8), pp.785-798.
Wojcik A.S. (1983), Formal Design Verification of Digital Systems, Proceedings of the 20th Design Automation Conference.
Woronowicz E. (1989), Relations Defined on Sets, Journal of Formalized Mathematics 1.
Wos L. (1998), Automating the Search for Elegant Proofs, Journal of Automated Reasoning 21(2), pp.135-175.
Wos L. (1996), The Automation of Reasoning: An Experimenter's Notebook with OTTER Tutorial, Academic Press.
Wos L. (1996), The Power of Combining Resonance with Heat, Journal of Automated Reasoning 17(1), pp.23-81.
Wos L. (1996), OTTER and the Moufang Identity Problem, Journal of Automated Reasoning 17(2), pp.215-257.
Wos L. (1995), Searching for Circles of Pure Proofs, Journal of Automated Reasoning 15(3), pp.279-315.
Wos L. (1994), Challenge in Group Theory, AAR Newsletter 26, pp.3-5.
Wos L. (1994), Two Challenge Problems, AAR Newsletter 27, pp.9.
Wos L. (1993), The Kernel Strategy and Its Use for the Study of Combinatory Logic, Journal of Automated Reasoning 10(3), pp.287-344.
Wos L. (1992), An Opportunity to Test Your Skills, and the Power of Your Automated Reasoning Program, AAR Newsletter 21, pp.10-11.
Wos L. (1989), A Challenge Problem and a Recent Workshop, AAR Newsletter 13, pp.2-8.
Wos L. (1988), Automated Reasoning - 33 Basic Research Problems, Prentice-Hall.
Wos L. (1965), Unpublished Note, NEED, Argonne National Laboratory, Argonne, USA.
Wos L., McCune W.W. (1988), Challenge Problems Focusing on Equality and Combinatory Logic: Evaluating Automated Theorem-Proving Programs, Lusk E. Overbeek R., Proceedings of the 9th International Conference on Automated Deduction (Argonne, USA), pp.714-729, Lecture Notes in Computer Science 310, Springer-Verlag.
Wos L., McCune W.W. (1988), Searching for a Fixed Point Combinators by Using Automated Theorem Proving: A Preliminary Report, ANL-88-10, Argonne National Laboratory, Argonne, USA.
Wos L., Overbeek R., Lusk E.L., Boyle J. (1992), Automated Reasoning: Introduction and Applications, McGraw-Hill.
Wos L., Overbeek R., Lusk E.L., Boyle J. (1984), Automated Reasoning: Introduction and Applications, Prentice-Hall.
Wos L., Winker S., McCune W.W., Overbeek R., Lusk E.L., Stevens R. (1990), Automated Reasoning Contributes to Mathemetics and Logic, Stickel M.E., Proceedings of the 10th International Conference on Automated Deduction (Kaiserslautern, Germany), pp.485-499, Lecture Notes in Artificial Intelligence 449, Springer-Verlag.
Wos L., Winker S., Veroff R., Smith B., Henschen L. (1983), Questions Concerning Possible Shortest Single Axioms in Equivalential Calculus: An Application of Automated Theorem Proving to infinite Domains, Notre Dame Journal of Formnal Logic 24(2), pp.205-223.
Wu C.H., Lee S.J. (2001), Parallelization of a Hyper-Linking-Based Theorem Prover, Journal of Automated Reasoning 26(1), pp.67-106.
Zhang H. (1994), Email to G. Sutcliffe.
Zhang H. (1993), Automated Proofs of Equality Problems in Overbeek's Competition, Journal of Automated Reasoning 11(3), pp.333-351.
Zhang J. (2000), Test Problem and Perl Scripts for Finite Model Searching, Association for Automated Reasoning Newsletter.
Zhang J. (1998), Showing the Independence of An Axiom for Temporal Intervals by Model Generation, AAR Newsletter 40.
Zhang J. (1995), Email to G. Sutcliffe.
Zhang J. (1994), Solution to Another Open Question in Combinatory Logic, AAR Newsletter 25, pp.8-10.
Zhang J. (1992), Solution to an Open Question in Combinatory Logic, AAR Newsletter 21, pp.12.
de Nivelle H. (URL), Bliksem Resolution Prover, http://www.mpi-sb.mpg.de/~nivelle.
de Nivelle H. (2000), Email to G. Sutcliffe.