{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:56:46Z","timestamp":1750309006632,"version":"3.41.0"},"reference-count":4,"publisher":"Association for Computing Machinery (ACM)","issue":"81","license":[{"start":{"date-parts":[[1982,7,1]],"date-time":"1982-07-01T00:00:00Z","timestamp":394329600000},"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":[[1982,7]]},"abstract":"<jats:p>Completeness is endangered by the combination in connection graph of subsumption deletion rules and the run time pure literal rule. With some care we can restore completeness.<\/jats:p>","DOI":"10.1145\/1056803.1056804","type":"journal-article","created":{"date-parts":[[2007,1,17]],"date-time":"2007-01-17T18:32:02Z","timestamp":1169058722000},"page":"15-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A note on resolution, connection graphs, and subsumption"],"prefix":"10.1145","author":[{"given":"Dennis","family":"de Champeaux","sequence":"first","affiliation":[{"name":"University of Amsterdam, Jodenbreestr, NH Amsterdam"}]}],"member":"320","published-online":{"date-parts":[[1982,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/322276.322277"},{"key":"e_1_2_1_2_1","first-page":"480","volume-title":"of the 7th International Joint Conference in Artificial Intelligence","author":"Eisinger N.","year":"1981","unstructured":"Eisinger , N. , \"Subsumption and connection graphs,\" Proc. of the 7th International Joint Conference in Artificial Intelligence , University of B .C., Vancouver, Aug. 1981 . pp. 480 -- 486 . Eisinger, N., \"Subsumption and connection graphs,\" Proc. of the 7th International Joint Conference in Artificial Intelligence, University of B.C., Vancouver, Aug. 1981. pp. 480--486."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321919"},{"key":"e_1_2_1_4_1","volume-title":"Completeness and soundness of the connection graph procedure,\" Int. Ber. 7\/76","author":"Stephen W.","year":"1976","unstructured":"Stephen , W. and J. Siekmann , \" Completeness and soundness of the connection graph procedure,\" Int. Ber. 7\/76 , Institut fur Informatik, Univ. Karlsruhe , 1976 . Stephen, W. and J. Siekmann, \"Completeness and soundness of the connection graph procedure,\" Int. Ber. 7\/76, Institut fur Informatik, Univ. Karlsruhe, 1976."}],"container-title":["ACM SIGART Bulletin"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056803.1056804","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1056803.1056804","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:41:38Z","timestamp":1750282898000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1056803.1056804"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,7]]},"references-count":4,"journal-issue":{"issue":"81","published-print":{"date-parts":[[1982,7]]}},"alternative-id":["10.1145\/1056803.1056804"],"URL":"https:\/\/doi.org\/10.1145\/1056803.1056804","relation":{},"ISSN":["0163-5719"],"issn-type":[{"type":"print","value":"0163-5719"}],"subject":[],"published":{"date-parts":[[1982,7]]},"assertion":[{"value":"1982-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}