GOL(ID:7700/)

Extension to LISP for predicate calculus 

for Goal-Oriented Language

"GOL is a nondeterministic programming language obtained by extending LISP to encompass a modal predicate calculus"

The fundamental nature of GOL informed the system that became known initially as DIALOG, then INTERNIST, then CAUDCEUS. Considered a milestone in AI expert systems
Related languages
LISP 1.5 => GOL   Extension of
References:
  • Pople, Harry E, Jr. "GOL: A Goal Oriented Language for the Computer" PhD Thesis, Carnegie-Mellon University, 1969 view details
  • Pople, H. E. and G. Werner "An information processing approach to theory formation in biomedical research" view details
          in [AFIPS] Proceedings of the 1972 Spring Joint Computer Conference SJCC 40 view details
  • Pople, Harry E., Jr. "A goal-oriented language for the computer" in Representation and meaning -- experiments with information processing systems, H. A. Simon and L. Siklossy (Eds.), Prentice-Hall, Englesvood Cliffs, N. J., 1972, pp331-413 view details
          in [AFIPS] Proceedings of the 1972 Spring Joint Computer Conference SJCC 40 view details
  • Gibbons, G. D. review of Pople view details Abstract: GOL is a nondeterministic programming language obtained by extending LISP to encompass a modal predicate calculus. Elementary Wary predicates are represented as sets of n-tuples, and new predicates may be defined linguistically in terms of previous predicates. A predicate P may be used either to generate n-tuples x such that P(x), or to test n-tuples x to determine the truth of P(x). The author gives GOL programs that define the heuristic processes used in an Advice Taker task, the Mater program of Baylor and Simon, the Logic Theorist, and GPS. The GOL compiler accepts modal logic expressions and generates procedures that verify the expressions in extension, i.e., by examining a given model.

    The author presents a good discussion comparing semantic methods (such as GOL uses to generate its state space) with deductive, or syntactic, methods. While one of the stated goals of his work is the synthesis of semantic and syntactic methods, GOL depends primarily on semantic methods.

    This paper should be read by persons interested in the developing area of nondeterministic programming languages. GOL has not been included in discussions of nondeterministic languages, in spite of the fact that it was described as early as 1969. GOL is a true nondeterministic programming language, similar to PLANNER in that it is an extension of LISP to a logical calculus, and different mainly in its use of semantic methods rather than syntactic methods. While GOL might be considered a problemsolving system, it is basically a programming system in which heuristic processes may be conveniently stated.

          in ACM Computing Reviews 14(05) May 1973 view details
  • Pople, H. E., Jr. "On the Mechanization of Abductive Logic" view details
          in Proceedings of the Third International Joint Conference on Artificial Intelligence IJCAI-73, Stanford, CA: Stanford University 1973 view details
  • Leavenworth, Burt M.; Sammet, Jean E. "An overview of nonprocedural languages" pp1-12 view details Abstract: This paper attempts to describe some of the basic characteristics and issues involving the class of programming languages commonly referred to as ?nonprocedural? or ?very high level?. The paper discusses major issues such as terminology, relativeness, and arbitrary sequencing. Five features of nonprocedural languages are described, and a number of specific languages are discussed briefly. A short history of the subject is included.
    Extract: GOL
    GOL is a LISP extension for nondeterministic programming and is similar to PLANNER in some respects, except that GOL uses semantic methods to generate its state space, rather than syntactic, or deductive methods.
          in Proceedings of the ACM SIGPLAN symposium on Very high level languages, March 28-29, 1974, Santa Monica, California, United States view details
  • Pople, H. E. J. "Artificial intelligence approaches to computer-based medical" Proc IEEE Intercon Conference, 1975 view details
          in Proceedings of the ACM SIGPLAN symposium on Very high level languages, March 28-29, 1974, Santa Monica, California, United States view details
  • Pople, H. E., Jr., Myers, J. D., and Miller, R. A. "DIALOG INTERNIST: A Model of Diagnostic Logic for Internal" view details
          in IJCAI-75 Proceedings of the 4th International Joint Conference on Artificial Intelligence, 1975 Tbilisi, USSR view details
  • Pople, H. E. J. "Presentation of the INTERNIST System" Proc. A.I.M. Workshop, Rutgers Research Resource on Computers in Biomedicine, 1976 view details
          in IJCAI-75 Proceedings of the 4th International Joint Conference on Artificial Intelligence, 1975 Tbilisi, USSR view details
  • Pople, H. E. "The Formation of Composite Hypotheses in Diagnostic Problem-solving: An Exercise in Synthetic Reasoning" view details
          in Proceedings of the 5th International Joint Conference on Artificial Intelligence IJCAI-77, MIT, Cambridge, Mass., August, 1977 view details
  • Pople, H. E., Myers, J.D. and Miller, R.A. "DIALOG: a model of diagnostic logic for internal medicine" view details
          in Proceedings of the 5th International Joint Conference on Artificial Intelligence IJCAI-77, MIT, Cambridge, Mass., August, 1977 view details
  • Pople, H. E., Jr. "Heuristic methods for imposing structure on ill-structured problems: the structuring of medical diagnostics"Artificial Intelligence In Medicine. P. Szolovits, Westview Press, 1982 pp119-190. view details
          in Proceedings of the 5th International Joint Conference on Artificial Intelligence IJCAI-77, MIT, Cambridge, Mass., August, 1977 view details