{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:19:15Z","timestamp":1773656355558,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1979,1,1]],"date-time":"1979-01-01T00:00:00Z","timestamp":283996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12616,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1979]]},"DOI":"10.1016\/0304-3975(79)90045-8","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:48:55Z","timestamp":1027640935000},"page":"203-225","source":"Crossref","is-referenced-by-count":12,"title":["Complexity in mechanized hypothesis formation"],"prefix":"10.1016","volume":"8","author":[{"given":"Pavel","family":"Pudl\u00e1k","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.N.","family":"Springsteel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(79)90045-8_BIB1","series-title":"The design and Analysis of Computer Algorithms","author":"Aho","year":"1974"},{"key":"10.1016\/0304-3975(79)90045-8_BIB2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/800157.805047","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971","journal-title":"Proc. Third Annu. ACM Symposium on Theory of Computing"},{"key":"10.1016\/0304-3975(79)90045-8_BIB3_1","first-page":"187","article-title":"Automatic listing of important observational statements I","volume":"9","author":"H\u00e1jek","year":"1973","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(79)90045-8_BIB3_2","first-page":"251","article-title":"Automatic listing of important observational statements II","volume":"9","author":"H\u00e1jek","year":"1973","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(79)90045-8_BIB3_3","first-page":"95","article-title":"Automatic listing of important observational statements III","volume":"10","author":"H\u00e1jek","year":"1974","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(79)90045-8_BIB4","first-page":"85","article-title":"Some logical problems of automated research","author":"H\u00e1jek","year":"1973","journal-title":"Proc. Symp. on Mathematical Foundations of Computer Science, High Tatras, Czechoslovakia"},{"key":"10.1016\/0304-3975(79)90045-8_BIB5","series-title":"Mathematical Foundations of Computer Science 1975, Proceedings 1975","first-page":"30","article-title":"On logics of discovery","volume":"32","author":"H\u00e1jek","year":"1975"},{"key":"10.1016\/0304-3975(79)90045-8_BIB6","first-page":"421","article-title":"The GUHA method and the three-valued logic","volume":"7","author":"H\u00e1jek","year":"1971","journal-title":"Kybernetika"},{"key":"10.1016\/0304-3975(79)90045-8_BIB7","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF02345483","article-title":"The GUHA method of automated hypotheses determination","volume":"1","author":"H\u00e1jek","year":"1966","journal-title":"Computing"},{"key":"10.1016\/0304-3975(79)90045-8_BIB8","series-title":"Mechanized Hypothesis Formation: Mathematical Foundations for a General Theory","author":"H\u00e1jek","year":"1978"},{"key":"10.1016\/0304-3975(79)90045-8_BIB9","series-title":"Mathematical Foundations of Computer Science 1975, Proceedings 1975","first-page":"258","article-title":"The approximation problem in computational statistics","volume":"32","author":"Havr\u00e1nek","year":"1975"},{"key":"10.1016\/0304-3975(79)90045-8_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF00169108","article-title":"Statistical quantifiers in observational calculi: an application in GUHA methods","volume":"6","author":"Havr\u00e1nek","year":"1975","journal-title":"Theory and Decision"},{"key":"10.1016\/0304-3975(79)90045-8_BIB11","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0304-3975(79)90045-8_BIB12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1145\/321864.321877","article-title":"On the structure of polynomial time reducibility","volume":"22","author":"Ladner","year":"1975","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1016\/0304-3975(79)90045-8_BIB13","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/0304-3975(75)90016-X","article-title":"A comparison on polynomial time reducibilities","volume":"1","author":"Ladner","year":"1975","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(79)90045-8_BIB14","series-title":"Mathematical Foundations of Computer Sciences 1975, Proceedings 1975","first-page":"358","article-title":"Polynomially complete problems in the logic of automated research","volume":"32","author":"Pudl\u00e1k","year":"1975"},{"key":"10.1016\/0304-3975(79)90045-8_BIB15","unstructured":"F. Springsteel, Complexity of hypothesis-inference problems, in: P. H\u00e1jek, T. Havr\u00e1nek and X. Chytil, Eds., Hypotheses, Inference and Computation (tentative title), Theory and Decision Library (Reidel Publ., in preparation)."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900458?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397579900458?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T23:23:21Z","timestamp":1555111401000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397579900458"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1979]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1979]]}},"alternative-id":["0304397579900458"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(79)90045-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1979]]}}}