{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:43:32Z","timestamp":1750308212997,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"59","license":[{"start":{"date-parts":[[1976,8,1]],"date-time":"1976-08-01T00:00:00Z","timestamp":207705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGART Bull."],"published-print":{"date-parts":[[1976,8]]},"abstract":"<jats:p>\n            A POP-2 package known as AL1 (\"Advice Language 1\") has been developed during the Spring semester by the CS397DM graduate class while the author was visiting the University of Illinois. The object was to facilitate the transfer of specialist knowledge about chess end-games into machine memory. The package comprises two main modules:\n            <jats:italic>An Advice module<\/jats:italic>\n            (input: a board-state; output: an advice-list). This module is partitioned into \"Advice Tables\" corresponding to a subdivision of the task domain into sub-domains.\n            <jats:italic>A Search module<\/jats:italic>\n            (inputs: a board-state and an advice-list; output: a \"forcing-tree strategy\" for securing specified goals). This module includes move-generation, the only part of the package which is specific to chess.For executing strategies, a tree-lookup routine generates play against an opponent. A Table-editor allows the user to display, modify, or extend the Tables. These are of two kinds: A single Master Table decides, on the basis of properties of the input board-state, to which of a \"committee of experts\" it should be referred. The \"experts\" themselves are the individual Advice Tables, each written for a specific sub-domain. A fully tested Table for the elementary sub-domain King and Rook versus King (elementary to play, not to program) showed an order-of-magnitude advantage over a conventional programming approach.\n          <\/jats:p>","DOI":"10.1145\/1045270.1045272","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"12-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["AL1"],"prefix":"10.1145","author":[{"given":"Donald","family":"Michie","sequence":"first","affiliation":[{"name":"University of Edinburgh, Scotland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[1976,8]]},"reference":[{"volume-title":"Thought and Choice in Chess","year":"1965","author":"de Groot A.","key":"e_1_2_1_1_1"},{"volume-title":"An exceptional talent for calculative thinking. Brit. J. Psychol., 53, 243--258","year":"1962","author":"Hunter I. M. L.","key":"e_1_2_1_3_1"},{"volume-title":"Measuring the knowledge content of programs. Report No. UIUCDCS-R-76-786","year":"1976","author":"Michie D.","key":"e_1_2_1_4_1"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/800027.808470"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/800168.811543"},{"volume-title":"Behavioral semantics of non-recursive control structures, Proc. Colloque sur la Programmation","year":"1974","author":"Hewitt C.","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/942582.807990"},{"volume-title":"MIT AI Memo No.","year":"1975","author":"Sussman G. J.","key":"e_1_2_1_10_1"}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045270.1045272","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1045270.1045272","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:06Z","timestamp":1750264266000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1045270.1045272"}},"subtitle":["a package for generating strategies from tables"],"short-title":[],"issued":{"date-parts":[[1976,8]]},"references-count":8,"journal-issue":{"issue":"59","published-print":{"date-parts":[[1976,8]]}},"alternative-id":["10.1145\/1045270.1045272"],"URL":"https:\/\/doi.org\/10.1145\/1045270.1045272","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1976,8]]},"assertion":[{"value":"1976-08-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}