D-Script: A Computational Theory of Descriptions

This paper describes D-Script, a language for representing knowledge in artificial intelligence (AI) programs. D-Script contains a powerful formalism for descriptions, which permits the representation of statements that are problematical for other systems. Particular attention is paid to problems of opaque contexts, time contexts, and knowledge about knowledge. The design of a deductive system for this language is also considered.

[1]  John B. Johnston,et al.  The contour model of block structured processes , 1971, SIGP.

[2]  Terry Winograd,et al.  Procedures As A Representation For Data In A Computer Program For Understanding Natural Language , 1971 .

[3]  Drew McDermott,et al.  Assimilation of New Information by a Natural Language Understanding System , 1974 .

[4]  Robert Fenichel.  On implementation of label, variables , 1971, CACM.

[5]  W. H. Burge.  Some examples of the use of function-producing functions , 1971, SYMSAC '71.

[6]  John McCarthy,et al.  Programs with common sense , 1960 .

[7]  Charles J. Prenner,et al.  An implementation of backtracking for programming languages , 1972, SIGP.

[8]  Joel Moses.  The function of FUNCTION in LISP or why the FUNARG problem should be called the environment problem , 1970, SIGS.

[9]  C. Hewitt.  Planner: a language for manipulating models and proving theorems in a robot" ijcai-69 , 1970 .

[10]  John McCarthy,et al.  LISP 1.5 Programmer's Manual , 1962 .

[11]  Gerald Jay Sussman,et al.  Teaching of Procedures-Progress Report , 1972 .

[12]  Richard J. Waldinger,et al.  A Language for Writing Problem-Solving Programs , 1971, IFIP Congress.

[13]  Drew McDermott,et al.  From PLANNER to CONNIVER: a genetic approach , 1972, AFIPS '72 (Fall, part II).

[14]  Solomon W. Golomb,et al.  Backtrack Programming , 1965, JACM.

[15]  John C. Reynolds,et al.  GEDANKEN—a simple typeless language based on the principle of completeness and the reference concept , 1970, Commun. ACM.

[16]  Ben Wegbreit.  Studies in Extensible Programming Languages , 1970, Outstanding Dissertations in the Computer Sciences.

[17]  Richard J. Waldinger,et al.  QA4: A Procedural Calculus for Intuitive Reasoning. , 1972 .

[18]  Jay Earley,et al.  Toward an understanding of data structures , 1971, SIGFIDET '70.

[19]  Roger C. Schank,et al.  A conceptural dependency representation for a computer-oriented semantics , 1969 .

[20]  Carl Hewitt,et al.  Description and Theoretical Analysis (Using Schemata) of Planner: A Language for Proving Theorems and Manipulating Models in a Robot , 1972 .

[21]  B. J. Mailloux,et al.  Report of Algorithmic Language ALGOL 68 , 1969 .

[22]  Ole-Johan Dahl,et al.  Coroutine sequencing in a block structured environment , 1971 .

[23]  Daniel G. Bobrow,et al.  A model and stack implementation of multiple environments , 1973, CACM.

[24]  Gerald Jay Sussman,et al.  Why Conniving is Better than Planning , 1972 .

[25]  Erik Sandewall,et al.  Formal Methods in the Design of Question-Answering Systems , 1971, Artif. Intell..

[26]  Ben Wegbreit.  The ECL programming system , 1972, AFIPS '71 (Fall).

[27]  Peter Wegner.  Data structure models for programming languages , 1971, SIGP.

[28]  Daniel G. Bobrow,et al.  Requirements for advanced programming systems for list processing , 1972, CACM.

[29]  Allen Newell,et al.  Some Problems Of Basic Organization In Problem-Solving Programs , 1962 .