{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:48:22Z","timestamp":1725662902383},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540073895"},{"type":"electronic","value":"9783540375852"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1975]]},"DOI":"10.1007\/3-540-07389-2_221","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T10:55:28Z","timestamp":1330167328000},"page":"358-361","source":"Crossref","is-referenced-by-count":2,"title":["Polynomially complete problems in the logic of automate discovery"],"prefix":"10.1007","author":[{"given":"Pavel","family":"Pudl\u00e1k","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,21]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Cook, S.A., The Complexity of Theorem-proving Procedures, Proc. Third Annual ACM Symposium on Theory of Computing, May, 1971, p. 151\u2013158.","DOI":"10.1145\/800157.805047"},{"key":"44_CR2","doi-asserted-by":"crossref","unstructured":"H\u00e1jek, P., On Logics of Discovery, this volume pp. 30\u201345.","DOI":"10.1007\/3-540-07389-2_180"},{"key":"44_CR3","first-page":"187","volume":"9","author":"P. H\u00e1jek","year":"1973","unstructured":"H\u00e1jek, P., Automatic Listing of Important Observational Statements I, II, III, Kybernetika 9 (1973), 187\u2013205, 251\u2013270 and 10(1974), 95\u2013124.","journal-title":"Kybernetika"},{"key":"44_CR4","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF02345483","volume":"1","author":"P. H\u00e1jek","year":"1966","unstructured":"H\u00e1jek, P., Havel, I. and Chytil, M., The GUHA Method of Automated Hypotheses Determination, Computing 1 (1966), 293\u2013308.","journal-title":"Computing"},{"key":"44_CR5","unstructured":"H\u00e1jek, P. and Havr\u00e1nek, T., A Logic of Automated Discovery, book in preparation."},{"key":"44_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M., Reducibility among Combinatorial Problems, Complexity of Computer Computations, Plenum Press, NY 1972, 85\u2013104."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1975 4th Symposium, Mari\u00e1nsk\u00e9 L\u00e1zn\u011b, September 1\u20135, 1975"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-07389-2_221.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:57:26Z","timestamp":1605625046000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-07389-2_221"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975]]},"ISBN":["9783540073895","9783540375852"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/3-540-07389-2_221","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1975]]}}}