{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:20:54Z","timestamp":1648916454457},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1979,4,1]],"date-time":"1979-04-01T00:00:00Z","timestamp":291772800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1979,4]]},"DOI":"10.1007\/bf00989669","type":"journal-article","created":{"date-parts":[[2005,1,14]],"date-time":"2005-01-14T17:10:08Z","timestamp":1105722608000},"page":"149-179","source":"Crossref","is-referenced-by-count":0,"title":["Composition of relational productions for plans and programs"],"prefix":"10.1007","volume":"8","author":[{"given":"Steven A.","family":"Vere","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"197","DOI":"10.2307\/2371809","volume":"65","author":"Emil L. Post","year":"1943","unstructured":"Emil L. Post, ?Formal reductions of the general combinatorial decision problem,?Am. J. Math. 65:197?268 (1943).","journal-title":"Am. J. Math."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/S0019-9958(59)90362-6","volume":"2","author":"N. Chomsky","year":"1959","unstructured":"N. Chomsky, ?On certain formal properties of grammars,?Inf. Control 2:137?167 (1959).","journal-title":"Inf. Control"},{"key":"CR3","unstructured":"J. L. Pfaltz and A. Rosenfeld, ?Web Grammars,?Proceedings of the International Joint Conference on Artificial Intelligence, pp. 609?619 (1969)."},{"key":"CR4","series-title":"Courant Computer Science Symposia Series","volume-title":"Data Base Systems","author":"E. F. Codd","year":"1972","unstructured":"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)."},{"key":"CR5","unstructured":"C. Hewitt, ?Description and Theoretical Analysis (Using Schemata) of Planner,? Artificial Intelligence Laboratory, AI-TR-258, Massachusetts Institute of Technology (April 1972)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0004-3702(72)90051-3","volume":"3","author":"R. E. Fikes","year":"1972","unstructured":"R. E. Fikeset al., ?Learning and executing generalized robot plans,?Artif. Intell. 3:251?288 (1972).","journal-title":"Artif. Intell."},{"key":"CR7","first-page":"159","volume-title":"Artificial Intelligence and Heuristic Programming","author":"B. Raphael","year":"1971","unstructured":"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."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0004-3702(77)90004-2","volume":"8","author":"S. A. Vere","year":"1977","unstructured":"S. A. Vere, ?Relational production systems,?Artif. Intell. 8:47?68 (1977).","journal-title":"Artif. Intell."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/356599.356602","volume":"4","author":"B. Elspas","year":"1972","unstructured":"B. Elspas et al. ?An assessment of techniques for proving program correctness,?Comput. Surv. 4:97?147 (June 1972).","journal-title":"Comput. Surv."},{"key":"CR10","first-page":"23","volume-title":"Machine Intelligence, Vol. 7","author":"R. M. Burstall","year":"1972","unstructured":"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."},{"key":"CR11","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.21236\/ADA027455"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0022-0000(69)80009-7","volume":"3","author":"Z. Manna","year":"1969","unstructured":"Z. Manna, ?The correctness of programs,?J. Comput. Syst. Sci. 3:119?127 (May 1969).","journal-title":"J. Comput. Syst. Sci."},{"key":"CR13","unstructured":"R. M. Burstall, ?Program Proving as Hand Simulation with a Little Induction,?IFIP-74, pp. 308?312."}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00989669.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00989669\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00989669","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T09:47:24Z","timestamp":1586080044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00989669"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979,4]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979,4]]}},"alternative-id":["BF00989669"],"URL":"https:\/\/doi.org\/10.1007\/bf00989669","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1979,4]]}}}