{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:03:51Z","timestamp":1725663831629},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540554608"},{"type":"electronic","value":"9783540470830"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55460-2_30","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T10:06:45Z","timestamp":1330250805000},"page":"407-414","source":"Crossref","is-referenced-by-count":0,"title":["Logic Programming with Pseudo-Resolution"],"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,27]]},"reference":[{"key":"30_CR1","volume-title":"Doctoral Dissertation, SEKI Report SR-88-07","author":"N. Eisinger","year":"1988","unstructured":"Norbert Eisinger, \u201cCompleteness, Confluence and Related Properties of Clause Graph Resolution\u201d, Doctoral Dissertation, SEKI Report SR-88-07, FB Informatik, University of Kaiserslautern FRG (1988)"},{"key":"30_CR2","doi-asserted-by":"publisher","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 self-resolution.\u201d, Information Processing Letters 31, pp323\u2013326 (1989)","journal-title":"Information Processing Letters"},{"key":"30_CR3","unstructured":"Robert Kowalski, \u201cLogic for Problem Solving\u201d, North Holland (1979)"},{"key":"30_CR4","unstructured":"David M. W. Powers, Lazaro Davila and Graham Wrightson, \u201cImplementing Connectiong Graphs for Logic Programming\u201d, Cybernetics and Systems '88 (R. Trappl, Ed), Kluwer (April 1988)"},{"key":"30_CR5","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\u201d, SEKI Report SR-90-16, University of Kaiserslautern FRG (1990)."},{"key":"30_CR6","volume-title":"SEKI Report SR-90-17","author":"David M. M. W. W. Powers","year":"1990","unstructured":"David M. W. Powers, \u201cCompartmentalized Connection Graphs for Concurrent Logic Programming II: Parallelism, Indexing and Unification\u201d, SEKI Report SR-90-17, University of Kaiserslautern FRG (1990)."},{"key":"30_CR7","unstructured":"Michael J. Wise, David M. W. Powers, \u201cIndexing PROLOG Clauses via Superimposed Code Words and Field Encoded Words\u201d, Proc. International Symposium on Logic Programming, IEEE Computer Society, pp.203\u2013210 (February 1984)."}],"container-title":["Lecture Notes in Computer Science","Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55460-2_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:31:18Z","timestamp":1619573478000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55460-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540554608","9783540470830"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-55460-2_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1992]]}}}