{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:16:32Z","timestamp":1725491792726},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540748267"},{"type":"electronic","value":"9783540748274"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-74827-4_107","type":"book-chapter","created":{"date-parts":[[2007,9,11]],"date-time":"2007-09-11T23:35:16Z","timestamp":1189553716000},"page":"852-860","source":"Crossref","is-referenced-by-count":2,"title":["A Logic Grammar for Circuit Analysis"],"prefix":"10.1007","author":[{"given":"Takushi","family":"Tanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"107_CR1","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/321250.321254","volume":"12","author":"S.A. Greibach","year":"1965","unstructured":"Greibach, S.A.: A New Normal Form Theorem for Context-Free Phrase Structure Grammars. JACM\u00a012, 42\u201352 (1965)","journal-title":"JACM"},{"key":"107_CR2","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0004-3702(80)90003-X","volume":"13","author":"F.C.N. Pereira","year":"1980","unstructured":"Pereira, F.C.N., Warren, D.H.D.: Definite Clause Grammars for Language Analysis. Artificial Intell.\u00a013, 231\u2013278 (1980)","journal-title":"Artificial Intell."},{"key":"107_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0743-1066(91)90002-7","volume":"10","author":"T. Tanaka","year":"1991","unstructured":"Tanaka, T.: Definite Clause Set Grammars: A Formalism for Problem Solving. J. Logic Programming\u00a010, 1\u201317 (1991)","journal-title":"J. Logic Programming"},{"issue":"2","key":"107_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/69.219732","volume":"5","author":"T. Tanaka","year":"1993","unstructured":"Tanaka, T.: Parsing Circuit Topology in A Logic Grammar. IEEE-Trans. Knowledge and Data Eng.\u00a05(2), 225\u2013239 (1993)","journal-title":"IEEE-Trans. Knowledge and Data Eng."},{"key":"107_CR5","unstructured":"Tanaka, T., Bartenstein, O.: DCSG-Converters in Yacc\/Lex and Prolog. In: Proc. 12th International Conference on Applications of Prolog, pp. 44\u201349 (1999)"},{"key":"107_CR6","unstructured":"101 Analog IC Designs: Interdesign Inc., Sunnyvale, CA (1976)"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74827-4_107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T13:36:44Z","timestamp":1550929004000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74827-4_107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540748267","9783540748274"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74827-4_107","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}