Skip to main content
SpringerLink
Log in

An overview of automated reasoning and related fields

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

Abstract

This article provides an overview of automated reasoning and of the various fields for which it is relevant. It takes the form of a collection of articles, each covering some field and each written by an expert in that field. A field is introduced, its elements reviewed, the current state of the art given, the basic problems discussed, and the various goals listed. Although individually the goals of each field present a wide spectrum, collectively the fields share the interest of automating the process known as reasoning.

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. Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs (1984).

    Google Scholar 

  2. Wos, L., Carson, D., and Robinson, G., ‘Efficiency and completeness of the set-of-support strategy in theorem proving’, J. Assoc. Comput. Mach. 12, 536–541 (1965).

    Google Scholar 

  3. McCharen, J., Overbeek, R., and Wos, L., ‘Problems and experiments for and with automated theorem-proving programs’, IEEE Trans. Computers C-25, 773–782 (1976).

    Google Scholar 

  4. Wojciechowski, W. S. and Wojcik, A. S., ‘Automated design of multiple-valued logic circuits by automated theorem proving techniques’, IEEE Trans. Computers (September 1983).

  5. Wojcik, A. S., ‘Formal design verification of digital systems’, Proc. 20th Design Automation Conference, pp. 228–234 (1983).

  6. Lusk, E. and Overbeek, R. A., ‘Logic Machine Architecture; inference mechanisms-layer 2 user reference manual’, ANL-82-84, Argonne National Laboratory (December, 1982; revised 1984).

  7. Lusk, E. L., McCune, W., and Overbeek, R. A., ‘Logic Machine Architecture; kernel functions’, Proc. of the 6th International Conference on Automated Deduction, Lecture Notes in Computer Science (Ed. D. W. Loveland), Vol. 138, Springer-Verlag, pp. 70–84 (1982).

  8. Smith, B. T., ‘A reference manual for the environmental theorem prover, an incarnation of AURA’, to be published as an ANL technical report.

  9. Boyer, R. S. and Strother, Moore J., A Computational Logic, Academic Press, New York (1979).

    Google Scholar 

  10. Wos, L. and Winker, S., ‘Open questions solved with the assistance of AURA’, in Automated Theorem Proving: After 25 Years, Vol. 29 of Contemporary Mathematics (eds. W. W. Bledsoe and D. W. Loveland), AMS, Providence, Rhode Island, pp. 73–88 (1984).

    Google Scholar 

  11. Wos, L., ‘Solving open questions with an automated theorem-proving program’, Proc. of the 6th Conf. on Automated Deduction, Lecture Notes in Computer Science, Vol. 138 (ed. D. W. Loveland), Springer-Verlag, New York, pp. 1–31 (1982).

    Google Scholar 

  12. Winker, S., Wos, L., and Lusk, E., ‘Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem, I’, Math. Comp. 37 (156), 553–545 (1981).

    Google Scholar 

  13. Winker, S. and Wos, L., ‘Automated generation of models and counterexamples and its application to open questions in ternary Boolean algebra’, Proc. 6th International Symposium on Multiple-Valued Logic, Rosemont, Ill., IEEE and ACM, pp. 251–256 (1978).

  14. Shortliffe, E., ‘Consultation systems for physicians’, in Readings in Artificial Intelligence (eds. B. L. Webber and N. J. Nilsson), Tioga, Palo Alto, pp. 323–333 (1981).

    Google Scholar 

  15. Wos, L., Winker, S., Veroff, R., Smith, B., and Henschen, L., ‘Questions concerning possible shortest single axioms in equivalential calculus: an application of automated theorem proving to infinite domains’, Notre Dame J. Formal Logic 24, 205–223 (1983).

    Google Scholar 

  16. Wos, L., Winker, S., Veroff, R., Smith, B., and Henschen, L., ‘A new use of an automated reasoning assistant: open questions in equivalential calculus and the study of infinite domains’, Artificial Intelligence 22, 303–356 (1984).

    Google Scholar 

  17. Smullyan, R. M., First Order Predicate Calculus, Springer-Verlag, New York (1968).

    Google Scholar 

  18. Wos, L., Veroff, R., Smith, B., and McCune, W., ‘The linked inference principle, II: the user's viewpoint’, CADE/7, Proc. 7th International Conference on Automated Deduction, Lecture Notes in Computer Science (ed. R. E. Shostak), Vol. 170, Springer-Verlag, New York, pp. 316–332 (1984).

    Google Scholar 

  19. Wos, L., Carson, D., and Robinson, G., ‘The unit preference strategy in theory proving’, Proc. Fall Joint Computer Conference, Thompson Book Co., New York, pp. 615–621 (1964).

    Google Scholar 

  20. Lusk, E. and Overbeek, R., ‘A portable environment for research in automated reasoning’, CADE/7, Proc. 7th International Conference on Automated Deduction, Lecture Notes in Computer Science (ed. R. E. Shostak), Vol. 170, Springer-Verlag, New York, pp. 43–52 (1984).

    Google Scholar 

  21. Van Melle, W. J., System Aids in Constructing Consultation Programs, UMI Research Press, Ann Arbor, Michigan (1980).

    Google Scholar 

  22. Buchanan, B., Fiegenbaum, E., Webb, B. L., and Nilsson, N. J., ‘Dendral and Meta-Dendral: their application domain’, in Readings in Artificial Intelligence (eds. B. L. Webber and N. J. Nilsson), Tioga, Palo Alto, pp. 313–321 (1981).

    Google Scholar 

  23. Duda, R., Gaschnig, J., Hart, P., Webber, B. L. and Nilsson, N. J., ‘Model design in the PROSPECTOR consultant system for mineral exploration’, in Readings in Artificial Intelligence (eds. B. L. Webber and N. J. Nilsson), Tioga, Palo Alto, pp. 334–348 (1981).

    Google Scholar 

  24. Boyer, R. S. and Moore, J, ‘Proof checking the RSA public key encryption algorithm’, Amer. Math. Monthly 91, 181–189 (1984).

    Google Scholar 

  25. Clocksin, W. F. and Mellish, C. S., Programming in Prolog, Springer-Verlag, New York (1981).

    Google Scholar 

  26. Wos, L., Overbeek, R., and Henschen, L., ‘Hyperparamodulation: a refinement of paramodulation’, Proc. 5th Conf. on Automated Deduction, Lecture Notes in Computer Science (eds. R. Kowalski and W. Bibel), Vol. 87, Springer-Verlag, New York, pp. 208–219 (1980).

    Google Scholar 

  27. Wos, L. and Robinson, G. A., ‘Paramodulation and set of support’, Proc. IRIA Symposium on Automated Demonstration (Versailles, France), Springer-Verlag, New York, pp. 276–310 (1968).

    Google Scholar 

  28. Overbeek, R., McCharen, J., and Wos, L., ‘Complexity and related enhancements for automated theorem-proving programs’, Comput. Math. Appl. 2, 1–16 (1976).

    Google Scholar 

  29. Wos, L., Robinson, G., Carson, D. and Shalla, L., ‘The concept of demodulation in theorem proving’, J. Assoc. Comput. Mach. 14, 698–704 (1967).

    Google Scholar 

  30. Smith, M., Siebert, A., Divitto, B., and Good, D., ‘A verified encrypted packet interface’, SIGSOFT 6, 3 (1981).

    Google Scholar 

  31. Apt, K. R. and Van Emden, M. H., ‘Contributions to the theory of logic programming’, J. Assoc. Comput. Mach. 29, 841–862 (1982).

    Google Scholar 

  32. Clark, K. L., ‘Negation as Failure’, in Logic and Data Bases, Plenum Press, New York (1978).

    Google Scholar 

  33. Clark, K. and Gregory, S., PARLOG: ‘A parallel logic programming language’, Technical Report TR-83–5, Imperial College, London (1983).

    Google Scholar 

  34. Clark, K. L. and McCabe, F. G., ‘Prolog: a language for implementing expert systems’, in Machine Intelligence (eds. Hayes, Michie, and Pao), Vol. 10, Ellis Horwood, Chichester (1982).

    Google Scholar 

  35. Clark, K. L. and Tarnlund, S.-A., ‘A first order theory of data and programs’, Report TRITA-IBADB-1044, Department of Computer Science, University of Stockholm, Stockholm (1976).

    Google Scholar 

  36. Clocksin, W. F. and Mellish, C. S., Programming in Prolog, Springer-Verlag, Berlin (1981).

    Google Scholar 

  37. Colmerauer, A., ‘Metamorphosis grammars’, in Natural Language, Communications with Computers (ed. L. Bolc), Springer-Verlag, Berlin (1978). First appeared as ‘Les Grammaires de Metamorphose’, Groupe d'Intelligence Artificielle, Université de Marseille II, Nov. 1975.

    Google Scholar 

  38. Colmerauer, A., ‘Prolog and infinite trees’, Logic Programming, Academic Press, New York (1982).

    Google Scholar 

  39. Dahl, V., ‘Translating Spanish into logic through logic’, Amer. J. Comput. Ling. 7, 149–164 (1981).

    Google Scholar 

  40. Dershowitz, N., and Josephson, N. A., ‘Logic programming by completion’, Proc. Second International Logic Programming Conference, University of Uppsala, Uppsala, Sweden (1984).

    Google Scholar 

  41. Fuchi, K., ‘Aiming for Knowledge Information Processing Systems’, Fifth Generation Computer Systems (1981).

  42. Gallaire, H., and Minker, J. (eds.), Logic and Databases, Plenum Press, New York (1978).

    Google Scholar 

  43. Goguen, J. A. and Burstall, R. M., ‘Introducing institutions’, in Logics of Programs, Springer-Verlag, Heidelberg (1984).

    Google Scholar 

  44. Goguen, J. A. and Meseguer, J., ‘Equality, types, modules and generics for logic programming’, Proc. 2nd International Logic Programming Conference, University of Uppsala, 1984.

  45. Hammond, P., Logic programming for expert systems, Master Thesis, Imperial Coliege, London (1980).

  46. Haridi, S., Logic programming based on a natural deduction system, PhD Thesis, Royal Institute of Technology, Stockholm, Sweden (1981).

  47. Jaffar, J., Lassez, J.-L., and Lloyd, J. W., ‘Completeness of the negation as failure rule’, Proc. 8th IJCAI, Vol. 1, pp. 500–506 (1983).

  48. Kitakami, H., Kunifuji, S., Miyachi, T., and Furukawa, K., ‘A methodology for implementation of a knowledge acquisition system’, Proc. IEEE International Symposium on Logic Programming, Atlantic City, New Jersey (1984).

  49. Kornfeld, W. A., ‘Equality for Prolog’, Proc, 8th IJCAI, Vol. 1, pp. 514–519 (1983).

  50. Kowalski, R. A., ‘Algorithm=logic+control’, Comm. ACM 22, 424–436 (1979).

    Google Scholar 

  51. Kowalski, R. A., Logic for Problem Solving, North Holland, New York (1980).

    Google Scholar 

  52. Kowalski, R. A. and Kuehner, D., ‘Linear resolution with selection function’, Artificial Intelligence, 2, 227–260 (1970).

    Google Scholar 

  53. J. W., ‘Foundations of logic programming’, Technical Report 82/7, Department of Computer Science, University of Melbourne, Melbourne (1984).

    Google Scholar 

  54. Markusz, Z., ‘How to design variants of flats using the programming language PROLOG based on mathematical logic’, Proc. IFIP 77 North Holland, pp. 885–889 (1977).

  55. McCord, M. C., ‘Using slots and modifiers in logic grammars for natural language’, Artificial Intelligence 18, 327–367 (1982).

    Google Scholar 

  56. Mishra, P., ‘Towards a theory of types in Prolog’, 1984 International Symposium on Logic Programming, pp. 289–298 (1984).

  57. Parsaye, K., ‘Database management, knowledge base management and expert system development in Prolog’, Proc. 1983 ACM Database Week, ACM (1983).

  58. Pereira, F. C. N., ‘Can drawing be liberated from the von Neumann style’, Proc. 1983 ACM Database Week, ACM (1983).

  59. Pereira, F. C. M. and Warren, D. H. D., ‘Definite clause grammars for language analysis — a survey of the formalism and a comparison with augmented transition networks’, Artificial Intelligence 13, 231–279 (1980).

    Google Scholar 

  60. Robinson, J. A. and Sibert, E. E., ‘Logic Programming in LISP. 8–80’, School of Computer and Information Science, Syracuse University, Syracuse, New York (1980).

    Google Scholar 

  61. Shapiro, E. Y., ‘A subset of concurrent Prolog and its interpreter’, Technical Report TR-003, ICOT-Institute for New Generation Computer Technology, Tokyo (1983).

    Google Scholar 

  62. Stickel, M. E., ‘A Prolog technology theorem prover’, Proc. IEEE International Syposium on Logic Programming, Atlantic City, New Jersey (1984).

  63. Subrahmanyam, P. A. and You, J.-H., ‘Pattern driven lazy reduction: a unifying evaluation mechanism for functional and logic programs’, 11th Annual ACM Symposium on Principles of Programming Languages, ACM, Salt Lake City, Utah (1984).

  64. Swinson, P. S. G., ‘Logic programming — a computing tool for the architect of the future’, Computer-Aided Design 14, 2 (1982).

    Google Scholar 

  65. Tamura, N. and Kaneda, Y., ‘Implementing parallel Prolog on a multi-processor machine’, Proc. IEEE International Symposium on Logic Programming, Altantic City, New Jersey (1984).

  66. Van Amden, M. H. and Kowalski, R. A., ‘The semantics of predicate logic as a programming language’, J. Assoc. Comput. Mach. 23, 733–742 (1976).

    Google Scholar 

  67. Warren, D. H. D., ‘WARPLAN: A system for generating plans’, DCL Memo 76, Dept. of Artificial Intelligence, University of Edinburgh, Scotland (1974).

    Google Scholar 

  68. Warren, D. S., Ahamed, M., Debray, S., and Kale, L. V., ‘Executing distributed Prolog programs on a broadcast network’, Proc. IEEE International Symposium on Logic Programming, Atlantic City, New Jersey (1984).

  69. Warren, D. S., ‘Efficient Prolog memory management for flexible control strategies’, Proc. IEEE International Symposium on Logic Programming Atlantic City, New Jersey (1984).

  70. Warren, D. H. D., Pereira, L. M., and Pereira, F. C. N., ‘Prolog — the language and its implementation compared with LISP', SIGPLAN/SIGART Newsletter’, ACM Symposium on AI and Programming Languages (August 1977).

  71. Zaumen, W., ‘Computed-assisted circuit evaluation in Prolog for VLSI’, Proc. 1983 ACM Data-base Week, ACM (1983).

  72. Albus, James S., ‘Robotics: challenges to present-day technology’, IEEE Potentials 2, 24–27 (1983).

    Google Scholar 

  73. Plantier, M., Bodmer, R., et al. ‘Teleoperation and automation; a survey of European expertise applicable to docking and assembly in space’, ASTEC Contract No. 4402/80/NL/AK (SC), Geneva; EUROSTAT, S.A. (1981).

  74. Birk, J. R. and Kelley, R. B., ‘An overview of the basic research needed to advance the state of knowledge in robotics’, IEEE Trans. Sys. Man. Cybern, Vol. SMC-11, No. 8, pp. 575–579 (1983).

  75. Brady, Michael, ‘The state of the art in robotics’, MIT Artificial Intelligence Laboratory, Massachusetts Institute of Technology, The National Conference on Artificial Intelligence (AAII), invited lecture (1983).

  76. Brooks, Rodney A., Lozano-Perez, T., Mason, M. T., and Taylor, R. H., ‘AI research at AI Lab., MIT’, AI Magazine 4 44–48 (1983).

    Google Scholar 

  77. Nilsson, N. J., Principles of Artificial Intelligence, Tioga, Palo Alto, pp. 76–995.

  78. Brooks, R. A., ‘Model-based three-dimensional interpretation of two-dimensional images’, Proc. 7th International Joint Conf. on AI (IJCAI), pp. 619–623 (1981).

  79. Wilkins, D. E., ‘Representation in a domain-independent planner’, Proc. 7th International Joint Conf. on AI (IJCAI) pp. 733–740 (1983).

  80. Lozano-Perez, T., Mason, M. T., and Taylor, R. H., ‘Automatic synthesis of time-motion strategies for robots’, Int. J. Robotics Res. 3, 3–24 (1984).

    Google Scholar 

  81. Brooks, R. A., ‘Symbolic error analysis and robot planning’, Int. J. Robotics Res. 1, 29–68 (1982).

    Google Scholar 

  82. Brooks, R. A., ‘Planning collision-free motions for pick and place operations’, Int. J. Robotics Res. 2, 19–44 (1983).

    Google Scholar 

  83. Brady, M., Lozano-Perez, T., et al., Robot Motion, Planning and Control, MIT Press, Boston, Mass., pp. 473–498 (1982).

    Google Scholar 

  84. Lozano-Perez, T., ‘Robot programming’, Proc. IEEE 71, 821–842 (1983).

    Google Scholar 

  85. Moravec, H. P., ‘The Stanford Cart and the CMU Rover’, Proc. IEEE 71, 872–884 (1983).

    Google Scholar 

  86. Ballard, D. H. and Brown, C. M., Computer Vision, Prentice-Hall, Englewood Cliffs (1982).

    Google Scholar 

  87. Allen, J. F. and Koomen, J. A., ‘Planning using a temporal world model’, Proc. 8th International Joint Conf. on AI (IJCAI), pp. 741–747 (1983).

  88. Gini, M. and Gini, G., ‘Towards automatic error recovery in robot programs’, Proc. 8th International Joint Conf. on AI (IJCAI), pp. 821–823 (1983).

  89. Lee, M. H., Barnes, D. P., and Hardy, N. W., ‘Knowledge based error recovery in industrial robots’, Proc. 8th International Conf. on AI (IJCAI), pp. 824–826 (1983).

  90. Kirschbrown, R. H. and Dorf, R. C., ‘KARMA — a knowledge-based robot manipulation system: determining problem characteristics’, Proc. of ROBOTS 8 Conf., Vol. 2, pp. (20–36)-(20–46) (1984).

  91. Committee on Army Robotics and AI, Applications of Robotics and Artificial Intelligence to Reduce Risks and Improve Effectiveness, National Academy Press, Washington, D.C. (1983).

    Google Scholar 

  92. DARPA, Strategic Computing (1983).

  93. Gevarter, W. B., Robotics, Vol. 2, ‘An overview of artificial intelligence and robotics’, National Bureau of Standards, NASA CR. 168727 or NBSIR 82-2479 (1982).

  94. American National Standards Institute, Inc., ‘American National Standard Programming Language FORTRAN’, Tech. Rept. ANSI X3.9–1978, American National Standards Institute, Inc., 1430 Broadway, N. Y. 10018 (1978).

    Google Scholar 

  95. Aubin, R., ‘Mechanizing structural induction’, PhD Thesis, University of Edinburgh (1976).

  96. Backus, J., ‘Can programming be liberated from the von Neumann style? A functional style and its algebra of programs’, Comm. ACM 21, 616–641 (1978).

    Google Scholar 

  97. Bledsoe, W. W. and Bruell, P., ‘A man-machine theorem-proving system’, Advance Papers of Third International Joint Conference on Artificial Intelligence, 5–1 (Spring) (1974).

  98. Boyer, R. S. and Moore, J. S., A Computational Logic, Academic Press, New York (1979).

    Google Scholar 

  99. Boyer, R. S. and Moore, J. S., ‘A verification condition generator for FORTRAN’, in The Correctness Problem in Computer Science (eds. R. S. Boyer and J. S. Moore), Academic Press, London (1981).

    Google Scholar 

  100. Boyer, R. S. and Moore J. S., The Mechanical Verification of a FORTRAN Square Root Program, SRI International (1981).

  101. Boyer, R. S. and Moore, J. S., ‘Metafunctions: Proving them correct and using them efficiently as new proof procedures’, in The Correctness Problem in Computer Science (eds. R. S. Boyer and J. S. Moore), Academic Press, London (1981).

    Google Scholar 

  102. Boyer, R. S. and Moore, J S., ‘MJRTY — A Fast Majority Vote Algorithm’, Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin (1982).

  103. Boyer, R. S. and Moore, J. S., ‘A mechanical proof of the unsolvability of halting problem’, Technical Report ICSCA-CMP-28, University of Texas at Austin (1982). To appear in J. Assoc. Comput. Mach.

  104. Boyer, R. S. and Moore, J. S., ‘Proof checking the RSA public key encryption algorithm’, Amer. Math. Monthly 91, 181–189 (1984).

    Google Scholar 

  105. Boyer, R. S. and Moore, J. S., ‘A mechanical proof of the Turing completeness of pure LISP’, Technical Report ICSCA-CMP-37, Institute for Computing Science and Computer Applications, University of Texas at Austin (1983). Also in the Automated Theorem Proving: After 25 Years, Contemporary Mathematics, Vol. 29, American Mathematical Society, Providence, R.I., pp. 133–168 (1984).

  106. Boyer, R. S., Green, M. W., and Moore, J S., ‘The use of a formal simulator to verify a simple real time control program’, Tech. Rep. ICSA-CMP-29, University of Texas at Austin (1982).

  107. Brown, F., ‘An investigation into the goals of research in automatic theorem proving as related to mathematical reasoning’, Tech. Rept. 49, Department of Artificial Intelligence, University of Edinburgh (1977).

  108. Cartwright, R., ‘A practical formal semantic definition and verification system for typed LISP’, Tech. Rept. STAN-CS-771592, Computer Science Department, Stanford University (1976).

  109. Cartwright, R., ‘A constructive alternative to axiomatic data type definition’, Conference Record of the 1980 LISP Conference, P.O. Box 487, Redwood Estates, Ca. 95044, pp. 46–55 (1980).

  110. Cartwright, R. and McCarthy, J., ‘Recursive programs as functions in a first order theory’, Tech. Rept. STAN-CS-79-717, Computer Science Department, Stanford University (1979).

  111. Cohn, A. J., ‘The equivalence of two semantic definitions: a case study in LCF’, SIAM J. Comput. 12, 267–285 (1983).

    Google Scholar 

  112. Cohn, A. J. and Milner, R., ‘On using Edinburgh LCF to prove the correctness of a parsing algorithm’, Tech. Rept. CSR-112-82, University of Edinburgh (1982).

  113. Constable, R. L. and O'Donnell, M. J., A Programming Logic, Winthrop, Cambridge (1978).

    Google Scholar 

  114. Darlington, J., ‘An experimental program transformation and synthesis system’, Artificial Intelligence 16, 1 (1981).

    Google Scholar 

  115. Davis, M. and Schwartz, J., ‘Metamathematical extensibility for theorem verifiers and proofcheckers’, Tech. Rept. 12, Courant Institute of Mathematical Sciences (1977).

  116. Di Vito, Benedetto Lorenzo, ‘Verification of communications protocols and abstract process models’, PhD Thesis ICSCA-CMP-25, Institute for Computing Science and Computer Applications, University of Texas at Austin (1982).

  117. Feiertag, R. J., ‘A technique for proving specifications are multilevel secure’, Technical Report CSL-109, SRI International (1981).

  118. Floyd, R., ‘Assigning meanings to programs’ in Mathematical Aspects of Computer Science, Proceedings of Symposia in Applied Mathematics, AMS, Providence, Rhode Island, pp. 19–32 (1967).

  119. Gerhart, S., ‘AFFIRM type library’, USC Information Sciences Institute, 4676 Admiralty Way, Marina Del Rey, Ca. 90291 (1981).

  120. Goguen, J. A., ‘How to prove algebraic inductive hypotheses without induction’, in 5th Conference Automated Deduction, Lecture Notes in Computer Science (eds. W. Bibel and R. Kowalski), Springer-Verlag, New York, pp. 356–373 (1980).

    Google Scholar 

  121. Good, D. I., London, R. L., and Bledsoe, W. W., ‘An interactive program verification system’, Proceedings 1975 International Conference on Reliable Software (1975).

  122. Good, D. I., ‘The proof of a distributed system in Gypsy’, Tech. Rept. ICSCA-CMP-30, Institute for Computing Science and Computer Applications, University of Texas at Austin (1982).

  123. Good, D., et al., ‘Report on the language GYPSY Version 2.0’, Tech. Rept. ICSCA-CMP-10, Institute for Computing Science and Computer Applications, University of Texas at Austin (1978).

  124. Gordon, M., Milner, R., Morris, L. Newey, M., and Wadsworth, C., ‘A metalanguage for interactive proof in LCF’, Tech. Rept. CSR-16-77, Department of Computer Science, University of Edinburgh (1977).

  125. Henderson, P., Functional Programming, Prentice-Hall, London (1980).

    Google Scholar 

  126. Hoare, C. A. R., ‘An axiomatic basis for computer programming’, Comm. ACM 12, 576–583 (1969).

    Google Scholar 

  127. Hoare, C. A. R., ‘Communicating sequential processes’, Comm. ACM 21, 666–677 (1978).

    Google Scholar 

  128. Igarashi, S., London, R. L., and Luckham, D. C., ‘Automatic program verification I: a logical basis and its implementation’, Information Science Institute, USC, in Report ISI/RR-73-11 (1969).

  129. King, J. C., ‘A program verifier’, PhD Thesis, Carnegie-Mellon University (1969).

  130. Kowalski, R., Logic for Problem Solving, Elsevier North Holland, New York (1979).

    Google Scholar 

  131. Lamport, L., ‘Proving the correctness of multiprocess programs’, IEEE Trans. Soft. Engrg. SE 3, 125–143 (1977).

    Google Scholar 

  132. Lengauer, C., ‘On the mechanical transformation of program executions to derive concurrency’, Tech. Rept. TR-83-20, Department of Computer Sciences, University of Texas at Austin (1983).

  133. McCarthy, J., ‘A basis for a mathematical theory of computation’, in Computer Programming and Formal Systems (eds. P. Braffort and D. Hershberg), North Holland, Amsterdam (1963).

    Google Scholar 

  134. McHugh, J., ‘Towards the generation of efficient code from verified programs’, PhD Thesis, University of Texas (1984).

  135. Moore, J.S., ‘A mechanical proof of the termination of Takeuchi's function’, Information Processing Lett. 9, 176–181 (1979).

    Google Scholar 

  136. Musser, D., ‘On proving inductive properties of abstract data types’, Proceedings 17th ACM Symposium on Principles of Programming Languages, ACM SIGPLAN (1980).

  137. Nelson, G. and Oppen, D.C., ‘Simplification by cooperating decision procedures’, ACM Trans. Programming Languages 1, 245–257 (1979).

    Google Scholar 

  138. Owicki, S. and Gries, D., ‘Verifying properties of parallel programs: an axiomatic approach’, Comm. ACM 19, 5 (1976).

    Google Scholar 

  139. Paulson, L., ‘Verifying the unification algorithm in LCF’, Tech. Rept. 50, University of Cambridge Computer Laboratory (1984).

  140. Polak, W., Compiler Specification and Verification, Springer-Verlag, Berlin (1981).

    Google Scholar 

  141. Smith, M., Siebert, A., DiVitto, B., and Good, D., ‘A verified encrypted packet interface’, SIGSOFT 6, 3 (1981).

    Google Scholar 

  142. Stanat, D. F., Thomas, T. A., and Dunham, J. R., ‘Proceedings of a formal verification/design proof peer review’, Tech. Rept. RTI/2094/13–01F, Research Triangle Institute, P.O. Box 12194, Research Triangle Park, N.C., 27709 (1984).

    Google Scholar 

  143. Stoy, J. E., Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press, Cambridge, Massachusetts (1977).

    Google Scholar 

  144. Turner, D. A., ‘A new implementation technique for applicative languages’, Software—Practice and Experience 9, 31–49 (1979).

    Google Scholar 

  145. United States of America Standards Institute, ‘U.S.A. Standard FORTRAN’, Tech. Rept. USAS X3.9–1966, United States of America Standards Institute, 10 East 40th Street, New York, New York 10016 (1966).

    Google Scholar 

  146. Von Neumann, J., Collected Works, Volume V, Pergamon Press, Oxford (1961).

    Google Scholar 

  147. Wagner, T. J., ‘Hardware verification’, PhD Thesis, Stanford University (1977).

  148. Weyhrauch, R. W., ‘Prolegomena to a theory of mechanized formal reasoning’, Artificial Intelligence 13, 133–171 (1980).

    Google Scholar 

  149. Weyharauch, R. W., and Thomas, A. J., ‘FOL: A proof checker for first order logic’, Tech. Rept. AIM-235, Stanford University, Computer Science Department, Artificial Intelligence Laboratory (1974).

  150. Gordon, M., ‘Proving a computer correct’, Tech. Rept. 42, Computer Laboratory, University of Cambridge (1984).

  151. Davis, M., ‘The prehistory and early history of automated deduction’, in Automation of Reasoning: Classical Papers on Computational Logic 1957–70 (eds. J. Siekmann and Wrightson), Vol. 1, Springer-Verlag, New York, pp. 1–28 (1983).

    Google Scholar 

  152. Henschen, L. and Wos, L., ‘Automated theorem proving: 1965–1970’, in Automation of Reasoning: Classical Papers on Computational Logic 1957–70 (eds. J. Siekmann and Wrightson), Vol. 12, Springer-Verlag, New York, pp. 1–24 (1983).

    Google Scholar 

  153. Loveland, D., ‘Automated theorem proving: a quarter century review’, in Automated Theorem Proving: After 25 Years American Mathematical Society Contemporary Mathematical Series (eds. Bledsoe and Loveland), to appear in 1984.

  154. Chang, C.-L. and Lee, R. C.-T., Symbolic Logic and Mechanical Theorem Proving, Academic Press, New York (1971).

    Google Scholar 

  155. Loveland, D., Automated Theorem Proving, North Holland, Amsterdam (1978).

    Google Scholar 

  156. Wos, L., Overbeek, R., Lusk, E., and Boyle, J., Automated Reasoning: Introduction and Applications, Prentice-Hall, Englewood Cliffs (1984).

    Google Scholar 

  157. Buchanan, B. G. and Shortliffe, E. H., Rule-Based Expert Systems: The MYCIN Experiments, Addison-Wesley, New York (1984).

    Google Scholar 

  158. Feigenbaum, E. A., Buchanan, B. G., and Lederberg, J., ‘On generality and problem solving: a case study using the DENDRAL program’, Machine Intelligence 6, 165–190 (1971).

    Google Scholar 

  159. Gardner, Martin, Logic Machines and Diagrams, McGraw-Hill, New York (1958).

    Google Scholar 

  160. Hayes-Roth, F., Waterman, D., and Lenat, D. (eds.), Building Expert Systems, Addison-Wesley, New York (1983).

    Google Scholar 

  161. Lindsay, R. K., Buchanan, B. G., Feigenbaum, E. A., and Lederberg, J., Applications of Artificial Intelligence for Organic Chemistry: The DENDRAL Project, McGraw-Hill, New York (1980).

    Google Scholar 

  162. McCarthy, J., ‘Some expert systems need common sense’, Invited presentation for the New York Academy of Sciences Science Week Symposium on Computer Culture, April 5–8, 1983, Annals of the New York Academy of Science (to appear).

  163. Moses, J., ‘Symbolic integration: The stormy decade’, Comm. ACM 8, 548–560 (1971).

    Google Scholar 

  164. Newell, A., ‘Foreword’, in Rule-Based Expert Systems (eds. B. G. Buchanan and E. H. Shortliffe), Addison-Wesley, Reading, Mass., pp. xi-xvi (1984).

    Google Scholar 

  165. Polya, G., Mathematics and Plausible Reasoning, Princeton University Press, Princeton, N.J. (1954).

    Google Scholar 

  166. Schank, R. C., ‘The current state of AI: one man's opinion’, AI Magazine IV, D Winter-Spring (1983).

  167. Bledsoe, W. W. and Henschen, L. J., ‘What is automated theorem proving?’, J. Automated Reasoning 1, 23–28 (1985) (this article).

    Google Scholar 

  168. Biermann, A., Guiho, G., and Kodratoff, Y. (eds.), Automatic Programming Construction Techniques, Macmillan, New York (1984).

    Google Scholar 

  169. Partsch, H. and Steinbruggen, R., ‘Program transformation systems’, ACM Comput. Surveys 15 (3) (September 1983).

  170. Green, C., Luckham, D., Balzer, R., Cheatham, T., and Rich, C., ‘Report on a knowledge-based software assistant’, Kestrel Institute Report KES.U. 83.2 (1984). Also published as RADC Report No. TR 83-195.

  171. Manna, Z. and Waldinger, R., ‘A deductive approach to program synthesis’, Automatic Programming Construction Techniques (eds. A. Biermann, G. Guiho and Y. Kodratoff), Macmillan, New York, pp. 33–68 (1984).

    Google Scholar 

  172. Freudenberger, S., Schwartz, J., and Sharir, M., ‘Experience with the SETL optimizer’, ACM Transactions on Programming Languages and Systems 5 (1), 26–45 (1983).

    Google Scholar 

  173. Smith, D., ‘A problem reduction approach to program synthesis’, IJCAI-83 Proc., Vol. 1, pp. 32–36 (1983).

  174. Jullig, R. and Pressburger, T., ‘Knowledge-based tools for software’, Kestrel Institute Report KES.U.84.5 (1984).

  175. Barr, A. and Feigenbaum, E. A. (eds.), ‘Automatic programming’, Handbook of Artificial Intelligence, Vol. 2, Section X, William Kaufmann, Inc., Los Altos (1982).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Mathematics and Computer Science Division, Argonne National Laboratory, 60439, Argonne, IL, USA

    L. Wos

  2. Artificial Intelligence Center, SRI International, 94025, Menlo Park, CA, USA

    Fernando Pereira

  3. Crumman Aerospace Corporation, 11714, Bethpage, NY, USA

    Robert Hong

  4. Computer Science Department, University of Texas, 78712, Austin, TX, USA

    Robert S. Boyer & J Strother Moore

  5. Department of Mathematics, University of Texas, 78712, Austin, TX, USA

    W. W. Bledsoe

  6. Department of Electrical Engineering and Computer Science, Northwestern University, 60201, Evanston, IL, USA

    L. J. Henschen

  7. Computer Science Department, Stanford University, 94305, Stanford, CA, USA

    Bruce G. Buchanan

  8. Department of Computer Science, Victoria University, Wellington, New Zealand

    Graham Wrightson

  9. Kestrel Institute, 94304, Palo Alto, CA, USA

    Cordell Green

Authors
  1. L. Wos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fernando Pereira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Robert Hong
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Robert S. Boyer
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. J Strother Moore
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. W. W. Bledsoe
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. L. J. Henschen
    View author publications

    You can also search for this author in PubMed Google Scholar

  8. Bruce G. Buchanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  9. Graham Wrightson
    View author publications

    You can also search for this author in PubMed Google Scholar

  10. Cordell Green
    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

Wos, L., Pereira, F., Hong, R. et al. An overview of automated reasoning and related fields. J Autom Reasoning 1, 5–48 (1985). https://doi.org/10.1007/BF00244288

Download citation

  • Received:

  • Issue Date:

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

Key words

Search

Navigation