{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T19:57:47Z","timestamp":1759694267456},"reference-count":13,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1976,1,1]],"date-time":"1976-01-01T00:00:00Z","timestamp":189302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1976]]},"DOI":"10.1016\/0004-3702(76)90006-0","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T13:02:52Z","timestamp":1047646972000},"page":"243-259","source":"Crossref","is-referenced-by-count":38,"title":["Generalized and\/or graphs"],"prefix":"10.1016","volume":"7","author":[{"given":"Giorgio","family":"Levi","sequence":"first","affiliation":[]},{"given":"Franco","family":"Sirovich","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(76)90006-0_BIB1","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0004-3702(71)90006-3","article-title":"An admissible and optimal algorithm for searching AND\/OR graphs","volume":"2","author":"Chang","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(76)90006-0_BIB2","series-title":"Proc. 2nd International Joint Conference on Artificial Intelligence","first-page":"608","article-title":"STRIPS: A new approach to the application of theorem proving to problem solving","author":"Fikes","year":"1971"},{"key":"10.1016\/0004-3702(76)90006-0_BIB3","doi-asserted-by":"crossref","first-page":"444","DOI":"10.1145\/362280.362302","article-title":"Equivalence between AND\/OR graphs and context-free grammars","volume":"16","author":"Hall","year":"1973","journal-title":"Comm. ACM"},{"key":"10.1016\/0004-3702(76)90006-0_BIB4","first-page":"100","article-title":"A formal basis for the heuristic determination of minimum cost paths","volume":"SCC4","author":"Hart","year":"1968","journal-title":"IEEE Trans."},{"key":"10.1016\/0004-3702(76)90006-0_BIB5","article-title":"Description and theoretical analysis (using schemata) of PLANNER: A language for proving theorems and manipulating models in a robot","author":"Hewitt","year":"1972","journal-title":"A1 Memo No. 251, MIT Project MAC"},{"key":"10.1016\/0004-3702(76)90006-0_BIB6","series-title":"IEI Internal Report B73-12","article-title":"Some remarks on the equivalence between AND\/OR graphs and context-free grammars","author":"Levi","year":"1973"},{"key":"10.1016\/0004-3702(76)90006-0_BIB7","series-title":"Proc. 4th International Joint Conference on Artificial Intelligence","first-page":"340","article-title":"A problem-reduction model for non-independent subproblems","author":"Levi","year":"1975"},{"key":"10.1016\/0004-3702(76)90006-0_BIB8","series-title":"Proc. 3rd International Joint Conference on Artificial Intelligence","first-page":"1","article-title":"Additive AND\/OR graphs","author":"Martelli","year":"1973"},{"key":"10.1016\/0004-3702(76)90006-0_BIB9","series-title":"Nota Interna B74-37","article-title":"Two-level control structures for nondeterministic programming","author":"Montangero","year":"1974"},{"key":"10.1016\/0004-3702(76)90006-0_BIB10","series-title":"Proc. IFIP Congress","first-page":"125","article-title":"Searching problem-solving and game-playing trees for minimal cost solutions","author":"Nilsson","year":"1968"},{"key":"10.1016\/0004-3702(76)90006-0_BIB11","series-title":"Problem Solving Methods in Artificial Intelligence","author":"Nilsson","year":"1971"},{"key":"10.1016\/0004-3702(76)90006-0_BIB12","article-title":"qa4, a procedural calculus for intuitive reasoning","author":"Rulifson","year":"1972","journal-title":"SRI AI Center Technical Note 73"},{"key":"10.1016\/0004-3702(76)90006-0_BIB13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1145\/360666.360672","article-title":"State-space, problem-reduction and theorem proving\u2014Some relationships","volume":"18","author":"VanderBrug","year":"1975","journal-title":"Comm. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370276900060?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0004370276900060?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T23:25:37Z","timestamp":1553642737000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0004370276900060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1976]]},"references-count":13,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1976]]}},"alternative-id":["0004370276900060"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(76)90006-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1976]]}}}