{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:51Z","timestamp":1725663771041},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544876"},{"type":"electronic","value":"9783540384014"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54487-9_58","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:53:39Z","timestamp":1330210419000},"page":"156-173","source":"Crossref","is-referenced-by-count":4,"title":["Algorithmic proof with diminishing resources part 1"],"prefix":"10.1007","author":[{"given":"DM","family":"Gabbay","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,3]]},"reference":[{"key":"10_CR1","unstructured":"J Hudelmaier,\u2019 Decision Procedure for Propositional N-Prolog', in Extensions of Logic Programming, (Ed) P Schr\u00f6eder Heister, Springer Verlag 1990."},{"key":"10_CR2","unstructured":"D M Gabbay, Theory of Algorithmic Proof, A chapter in Handbook of Logic in Theoretical Computer Science, Volume 1, S Abramsky, D M Gabbay and T S E Maibaum (Eds), Oxford University Press, to appear."},{"key":"10_CR3","unstructured":"D M Gabbay, Labelled Deductive Systems, Oxford University Press, 1992, in preparation."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"1","author":"D. M. Gabbay","year":"1984","unstructured":"D M Gabbay, U Reyle, N-Prolog I, Journal of Logic Programming, Vol 1, 1984, pp 319\u2013355.","journal-title":"Journal of Logic Programming"},{"key":"10_CR5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0743-1066(85)80003-0","volume":"2","author":"D. M. Gabbay","year":"1985","unstructured":"D M Gabbay, N-Prolog, Part II, Journal of Logic Programming, Vol 2, 1985, pp 251\u2013283.","journal-title":"Journal of Logic Programming"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J-Y Girard","year":"1987","unstructured":"J-Y Girard, Linear Logic, Theoretical Computer Science 50, 1987, pp 1\u2013102.","journal-title":"Theoretical Computer Science"},{"key":"10_CR7","unstructured":"D M Gabbay, F Kriwaczek, A family of goal directed theorem provers based on conjunction and implication, to appear in Journal of Automated Reasoning."}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54487-9_58.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:22:18Z","timestamp":1619572938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54487-9_58"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544876","9783540384014"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/3-540-54487-9_58","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}