{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:18:51Z","timestamp":1725664731373},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540609834"},{"type":"electronic","value":"9783540497516"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/3-540-60983-0_10","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:09:22Z","timestamp":1330272562000},"page":"153-159","source":"Crossref","is-referenced-by-count":0,"title":["On the computational complexity of propositional logic programs with nested implications"],"prefix":"10.1007","author":[{"given":"J\u00f6rg","family":"Hudelmaier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0743-1066(84)90029-3","volume":"2","author":"D.M. Gabbay","year":"1984","unstructured":"Gabbay, D.M. & U. Reyle: N-Prolog. Part 1. Journal of Logic Programming 2 (1984) 319\u2013355","journal-title":"Journal of Logic Programming"},{"key":"10_CR2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0304-3975(79)90006-9","volume":"9","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Intuitionistic logic is polynomial-space complete. Theoretical Computer Science 9 (1979), 67\u201372","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"L.J. Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial time hierarchy. Theoretical Computer Science 3 (1976) 1\u201322","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","doi-asserted-by":"crossref","first-page":"2263","DOI":"10.1007\/BF01629434","volume":"20","author":"A.A. Babaev","year":"1982","unstructured":"Babaev, A.A. & S.V. Soloviev: Coherence theorem for canonical morphisms in cartesian closed categories. Journal of Soviet Mathematics 20 (1982) 2263\u20132282","journal-title":"Journal of Soviet Mathematics"}],"container-title":["Lecture Notes in Computer Science","Extensions of Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-60983-0_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:28:39Z","timestamp":1619558919000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60983-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540609834","9783540497516"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/3-540-60983-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1996]]}}}