Abstract
A relational production system (rps) is a mathematical model for information processing in which computer programs and artificial intelligence plans have a common representation. Annth order composition theorem for relational productions is presented which specifies the net effect of a sequence of actions, providing a unified, operational, mathematical solution to the following problems: (1) formation of compound artificial intelligence operators; (2) closed-form representation of loop semantics for plans; (3) composition of program statements; (4) closed-form representation of loop semantics for programs. This leads to a composition-based verification method, in which structured data are treated by the same methods as unstructured data. This approach seems especially promising in the verification of programs with structured data, which the orthodox inductive assertion technique accommodates only after major transfusions of additional theory.
Similar content being viewed by others
References
Emil L. Post, “Formal reductions of the general combinatorial decision problem,”Am. J. Math. 65:197–268 (1943).
N. Chomsky, “On certain formal properties of grammars,”Inf. Control 2:137–167 (1959).
J. L. Pfaltz and A. Rosenfeld, “Web Grammars,”Proceedings of the International Joint Conference on Artificial Intelligence, pp. 609–619 (1969).
E. F. Codd, “Further Normalization of the Data Base Relational Model,” inData Base Systems, Courant Computer Science Symposia Series, Vol. 6 (Prentice-Hall, Englewood Cliffs, N.J., 1972).
C. Hewitt, “Description and Theoretical Analysis (Using Schemata) of Planner,” Artificial Intelligence Laboratory, AI-TR-258, Massachusetts Institute of Technology (April 1972).
R. E. Fikeset al., “Learning and executing generalized robot plans,”Artif. Intell. 3:251–288 (1972).
B. Raphael, “The Frame Problem in Problem-Solving Systems,” inArtificial Intelligence and Heuristic Programming, N. V. Findler and B. Meltzer, eds. (American Elsevier, New York, 1971), pp. 159–169.
S. A. Vere, “Relational production systems,”Artif. Intell. 8:47–68 (1977).
B. Elspas et al. “An assessment of techniques for proving program correctness,”Comput. Surv. 4:97–147 (June 1972).
R. M. Burstall, “Some Techniques for Proving Correctness of Programs which Alter Data Structures,” inMachine Intelligence, Vol. 7, Meltzer and Michie, eds. (Wiley, New York, 1972), pp. 23–50.
D. Luckham and N. Suzuki, “Automatic Program Verification V: Verification-Oriented Proof Rules for Arrays, Records and Pointers,” Stanford AI Laboratory Memo AIM-278 (March 1976).
Z. Manna, “The correctness of programs,”J. Comput. Syst. Sci. 3:119–127 (May 1969).
R. M. Burstall, “Program Proving as Hand Simulation with a Little Induction,”IFIP-74, pp. 308–312.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Vere, S.A. Composition of relational productions for plans and programs. International Journal of Computer and Information Sciences 8, 149–179 (1979). https://doi.org/10.1007/BF00989669
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00989669