{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:11Z","timestamp":1725663611761},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540544159"},{"type":"electronic","value":"9783540476177"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54415-1_67","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:46:54Z","timestamp":1330210014000},"page":"615-632","source":"Crossref","is-referenced-by-count":4,"title":["Efficient program synthesis: Semantics, logic, complexity"],"prefix":"10.1007","author":[{"given":"Max I.","family":"Kanovich","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,7]]},"reference":[{"key":"30_CR1","unstructured":"A.Aho, J.Hopcroft and J.Ullman, The Design and Analysis of Computer Algorithms, (1976)."},{"key":"30_CR2","unstructured":"H.Rogers, Theory of Recursive Functions and Effective Computability, (1967)."},{"key":"30_CR3","unstructured":"J.D.Ullman, Principles of Database Systems, (1980)."},{"key":"30_CR4","unstructured":"M.R.Garey and D.S.Johnson, Computers and Intractability, (1979)."},{"issue":"2\u20133","key":"30_CR5","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0743-1066(90)90039-8","volume":"9","author":"G.E. Mints","year":"1990","unstructured":"G.E. Mints and E.Kh. Tyugu, Propositional logic programming and the PRIZ system. J. Logic Programming, 9, N 2\u20133 (1990),179\u2013193.","journal-title":"J. Logic Programming"},{"key":"30_CR6","unstructured":"I.O.Babaev, S.S.Lavrov et al., Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 29\u201341. (Russian)"},{"key":"30_CR7","unstructured":"A.Ja.Dikovskii, Third Conf. Application of the Methods of Mathematical Logic, Tallinn, (1983), 42\u201351. (Russian)"},{"key":"30_CR8","first-page":"36","volume":"5","author":"A. Dikovskii","year":"1985","unstructured":"A.Ja. Dikovskii and M.I. Kanovich, Computational models with separable subtasks. Proceedings of Academy of Sci. of USSR, Technical Cybernetics, 5 (1985), 36\u201360. (Russian)","journal-title":"Proceedings of Academy of Sci. of USSR, Technical Cybernetics"},{"issue":"2","key":"30_CR9","first-page":"273","volume":"34","author":"M.I. Kanovich","year":"1987","unstructured":"M.I. Kanovich, Quasipolynmial algorithms for recognizing the satisfiability and derivability of propositional formulas. Soviet Mathematics Doklady, 34, N 2 (1987), 273\u2013277.","journal-title":"Soviet Mathematics Doklady"},{"issue":"2\u20133","key":"30_CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0743-1066(90)90038-7","volume":"9","author":"M.I. Kanovich","year":"1990","unstructured":"M.I. Kanovich, Efficient program synthesis in computational models. J. Logic Programming, 9, N 2\u20133 (1990), 159\u2013177.","journal-title":"J. Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54415-1_67.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:21:30Z","timestamp":1619572890000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54415-1_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540544159","9783540476177"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-54415-1_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}