{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:29Z","timestamp":1725663869848},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554257"},{"type":"electronic","value":"9783540470663"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55425-4_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:58:51Z","timestamp":1330250331000},"page":"210-233","source":"Crossref","is-referenced-by-count":0,"title":["Parallel and efficient implementation of the compartmentalized connection graph proof procedure: Resolution to unification"],"prefix":"10.1007","author":[{"given":"David M. W.","family":"Powers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"10_CR1","volume-title":"doctoral dissertation","author":"J. Barklund","year":"1990","unstructured":"Jonas Barklund, \u201cParallel Unification\u210d, doctoral dissertation], UPMAIL, Uppsala University, Sweden (October 1990)."},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0743-1066(84)90022-0","volume":"1","author":"C. Dwork","year":"1984","unstructured":"C. Dwork, P.C. Kanellakis and J. Mitchell, \u201cOn the Sequential Nature of Unification\u210d, J. Logic Programming 1, pp35\u201350 (1984).","journal-title":"J. Logic Programming"},{"key":"10_CR3","series-title":"SEKI Report SR-88-07, FB Informatik","volume-title":"Doctoral Dissertation","author":"N. Eisinger","year":"1988","unstructured":"Norbert Eisinger, \u201cCompleteness, Confluence and Related Properties of Clause Graph Resolution\u210d, Doctoral Dissertation, SEKI Report SR-88-07, FB Informatik, University of Kaiserslautern FRG (1988)"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0020-0190(89)90096-3","volume":"31","author":"N. Eisinger","year":"1989","unstructured":"Norbert Eisinger, \u201cA Note on the completeness of resolution without selfresolution.\u210d, Information Processing Letters 31, pp323\u2013326 (1989)","journal-title":"Information Processing Letters"},{"key":"10_CR5","unstructured":"Robert Kowalski, \u201cLogic for Problem Solving\u210d, North Holland (1979)"},{"key":"10_CR6","volume-title":"doctoral dissertation, UPMAIL","author":"H. Millroth","year":"1990","unstructured":"H\u00e5kan Millroth, \u201cReforming Compilation of Logic Programs\u210d, doctoral dissertation, UPMAIL, Uppsala University, Sweden (October 1990)."},{"key":"10_CR7","volume-title":"Proceedings of AIMSA 1990","author":"H. Ohlbach","year":"1990","unstructured":"Hans-J\u00fcrgen Ohlbach, \u201cCompilation of Recursive Two-Literal Clauses into Unification Algorithms\u210d, Proceedings of AIMSA 1990, Albena, Bulgaria, (Wiley 1990)."},{"key":"10_CR8","unstructured":"David M. W. Powers, Lazaro Davila and Graham Wrightson, \u201cImplementing Connection Graphs for Logic Programming\u210d, Cybernetics and Systems '88 (R. Trappl, Ed), Kluwer (April 1988)"},{"key":"10_CR9","unstructured":"David M. W. Powers, \u201cParallelized QuickSort with Optimal Speedup\u210d, submitted. An expanded version is available as SEKI Report-90-09, University of Kaiserslautern FRG."},{"key":"10_CR10","volume-title":"SEKI Report SR-90-16","author":"David M. M. W. W. Powers","year":"1990","unstructured":"David M. W. Powers, \u201cCompartmentalized Connection Graphs for Concurrent Logic Programming I: Compartmentalization, Transformation and Examples\u210d, SEKI Report SR-90-16, University of Kaiserslautern FRG (1990)."},{"key":"10_CR11","unstructured":"David M. W. Powers, \u201cOptimal Parallel Speedup of QuickSort and RadixSort both in situ and in Lists\u210d, to be submitted. An earlier version is available as SEKI Report-90-09, University of Kaiserslautern FRG."},{"key":"10_CR12","unstructured":"Michael J. Wise and David M. W. Powers, \u201cIndexing PROLOG Clauses via Superimposed Code Words and Field Encode Words\u210d, Proc. Int'l Symp. on Logic Programming, IEE Computer Society, pp203\u2013210 (1984)."}],"container-title":["Lecture Notes in Computer Science","Parallelization in Inference Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55425-4_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:02Z","timestamp":1619573462000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55425-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554257","9783540470663"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-55425-4_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}