{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,21]],"date-time":"2025-05-21T23:05:12Z","timestamp":1747868712875},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540677970"},{"type":"electronic","value":"9783540449577"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44957-4_55","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T05:24:41Z","timestamp":1180675481000},"page":"822-836","source":"Crossref","is-referenced-by-count":7,"title":["Wire Routing and Satisfiability Planning"],"prefix":"10.1007","author":[{"given":"Esra","family":"Erdem","sequence":"first","affiliation":[]},{"given":"Vladimir","family":"Lifschitz","sequence":"additional","affiliation":[]},{"given":"Martin D. F.","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,12,15]]},"reference":[{"key":"55_CR1","unstructured":"Roberto Bayardo and Robert Schrag. Using CSP look-back techniques to solve real-world SAT instances. In Proc. IJCAI-97, pages 203\u2013208, 1997."},{"key":"55_CR2","unstructured":"Hector Geffner. Causal theories for nonmonotonic reasoning. In Proc. AAAI-90, pages 524\u2013530. AAAI Press, 1990."},{"key":"55_CR3","doi-asserted-by":"crossref","unstructured":"Michael Gelfond and Vladimir Lifschitz. Action languages. Electronic Transactions on AI, 3, 1998. http:\/\/www.ep.liu.se\/ea\/cis\/1998\/016 .","DOI":"10.1088\/1126-6708\/1998\/10\/016"},{"key":"55_CR4","unstructured":"Enrico Giunchiglia and Vladimir Lifschitz. An action language based on causal explanation: Preliminary report. In Proc. AAAI-98, pages 623\u2013630. AAAI Press, 1998."},{"key":"55_CR5","unstructured":"Henry Kautz and Bart Selman. Planning as satisfiability. In Proc. ECAI-92, pages 359\u2013363, 1992."},{"key":"55_CR6","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1109\/TEC.1961.5219222","volume":"EC-10","author":"C. Y. Lee","year":"1961","unstructured":"C. Y. Lee. An algorithm for path connections and its application. IRE Transactions on Electronic Computers, EC-10:346\u2013365, 1961.","journal-title":"IRE Transactions on Electronic Computers"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial Algorithms for Integrated Circuit Design. John Wiley & Sons, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"55_CR8","unstructured":"Vladimir Lifschitz. Missionaries and cannibals in the causal calculator. In Principles of Knowledge Representation and Reasoning: Proc. Seventh Int\u2019l Conf., pages 85\u201396, 2000."},{"key":"55_CR9","unstructured":"Norman McCain and Hudson Turner. Causal theories of action and change. In Proc. AAAI-97, pages 460\u2013465, 1997."},{"key":"55_CR10","unstructured":"John McCarthy. Elaboration tolerance. In progress, 1999. http:\/\/www-formal.stanford.edu\/jmc\/elaboration.html ."},{"key":"55_CR11","unstructured":"T. Ohtsuki. Maze-running and line-search algorithms. In T. Ohtsuki, editor, Layout Design and Verification, chapter 3. Elsevier Science Publishers, 1986."},{"key":"55_CR12","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(80)90014-4","volume":"13","author":"R. Reiter","year":"1980","unstructured":"Raymond Reiter. A logic for default reasoning. Artificial Intelligence, 13:81\u2013132, 1980.","journal-title":"Artificial Intelligence"},{"key":"55_CR13","unstructured":"Semiconductor Industry Association. The national roadmap for semiconductors, 1997."},{"issue":"1","key":"55_CR14","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1109\/TCAD.1985.1270096","volume":"4","author":"T. G. Szymanski","year":"1985","unstructured":"T. G. Szymanski. Dogleg channel routing is NP-complete. IEEE Transactions on Computer-Aided Design, 4(1):31\u201341, 1985.","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0743-1066(96)00125-2","volume":"31","author":"H. Turner","year":"1997","unstructured":"Hudson Turner. Representing actions in logic programs and default theories: a situation calculus approach. Journal of Logic Programming, 31:245\u2013298, 1997.","journal-title":"Journal of Logic Programming"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Hantao Zhang. An efficient propositional prover. In Proc. CADE-97, 1997.","DOI":"10.1007\/3-540-63104-6_28"}],"container-title":["Lecture Notes in Computer Science","Computational Logic \u2014 CL 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44957-4_55","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,22]],"date-time":"2020-04-22T16:28:02Z","timestamp":1587572882000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44957-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540677970","9783540449577"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44957-4_55","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}