{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T17:24:03Z","timestamp":1743009843319,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642045912"},{"type":"electronic","value":"9783642045929"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04592-9_41","type":"book-chapter","created":{"date-parts":[[2009,9,28]],"date-time":"2009-09-28T06:41:21Z","timestamp":1254120081000},"page":"325-332","source":"Crossref","is-referenced-by-count":1,"title":["Deriving Electrical Dependencies from Circuit Topologies Using Logic Grammar"],"prefix":"10.1007","author":[{"given":"Takushi","family":"Tanaka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"41_CR1","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":"41_CR2","unstructured":"de Kleer, J.: Causal and Teleological Reasoning in Circuit Recognition. MIT, AI-TR-529 (1979)"},{"key":"41_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"},{"key":"41_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, 225\u2013239 (1993)","journal-title":"IEEE-Trans. Knowledge and Data Eng."},{"key":"41_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1007\/978-3-540-74827-4_107","volume-title":"Knowledge-Based Intelligent Information and Engineering Systems","author":"T. Tanaka","year":"2007","unstructured":"Tanaka, T.: A Logic Grammar for Circuit Analysis - Problems of Recursive Definition. In: Apolloni, B., et al. (eds.) KES 2007, Part II. LNCS (LNAI), vol.\u00a04693, pp. 852\u2013860. Springer, Heidelberg (2007)"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04592-9_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T20:14:56Z","timestamp":1552162496000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04592-9_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642045912","9783642045929"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04592-9_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}