{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T17:20:43Z","timestamp":1725902443250},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319616599"},{"type":"electronic","value":"9783319616605"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-61660-5_25","type":"book-chapter","created":{"date-parts":[[2017,6,27]],"date-time":"2017-06-27T05:22:22Z","timestamp":1498540942000},"page":"279-285","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Synthesis of Optimal-Size Concentrators by Answer Set Programming"],"prefix":"10.1007","author":[{"given":"Marc","family":"Dahlem","sequence":"first","affiliation":[]},{"given":"Tripti","family":"Jain","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Schneider","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Gillmann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,28]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Batcher, K.: Sorting networks and their applications. In: AFIPS Spring Joint Computer Conference, vol. 32, pp. 307\u2013314 (1968)","DOI":"10.1145\/1468075.1468121"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.jcss.2016.09.004","volume":"84","author":"D Bundala","year":"2017","unstructured":"Bundala, D., Codish, M., Cruz-Filipe, L., Schneider-Kamp, P., Z\u00e1vodn\u00fd, J.: Optimal-depth sorting networks. J. Comput. Syst. Sci. 84, 185\u2013204 (2017)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1007\/978-3-319-04921-2_19","volume-title":"Language and Automata Theory and Applications","author":"D Bundala","year":"2014","unstructured":"Bundala, D., Z\u00e1vodn\u00fd, J.: Optimal sorting networks. In: Dediu, A.-H., Mart\u00edn-Vide, C., Sierra-Rodr\u00edguez, J.-L., Truthe, B. (eds.) LATA 2014. LNCS, vol. 8370, pp. 236\u2013247. Springer, Cham (2014). doi: 10.1007\/978-3-319-04921-2_19"},{"key":"25_CR4","unstructured":"Calimeri, F., Faber, W., Gebser, M., Ianni, G., Kaminski, R., Krennwallner, T., Leone, N., Ricca, F., Schaub, T.: ASP-Core-2 input language format, ASP Standardization Working Group, March 2013"},{"issue":"8","key":"25_CR5","doi-asserted-by":"crossref","first-page":"1765","DOI":"10.1002\/j.1538-7305.1979.tb02972.x","volume":"58","author":"F Chung","year":"1978","unstructured":"Chung, F.: On concentrators, superconcentrators, generalizers, and nonblocking networks. Bell Syst. Tech. J. 58(8), 1765\u20131777 (1978)","journal-title":"Bell Syst. Tech. J."},{"key":"25_CR6","unstructured":"Codish, M., Cruz-Filipe, L., Ehlers, T., M\u00fcller, M., Schneider-Kamp, P.: Sorting networks: to the end and back again. Cornell University, July 2015. arXiv Report arXiv:1507.01428v1"},{"key":"25_CR7","doi-asserted-by":"crossref","unstructured":"Ehlers, T., M\u00fcller, M.: New bounds on optimal sorting networks. Cornell University Library, January 2015. arXiv Report arXiv:1501.06946v1","DOI":"10.1007\/978-3-319-20028-6_17"},{"key":"25_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-03754-2_2","volume-title":"Reasoning Web. Semantic Technologies for Information Systems","author":"T Eiter","year":"2009","unstructured":"Eiter, T., Ianni, G., Krennwallner, T.: Answer set programming: a primer. In: Tessaris, S., Franconi, E., Eiter, T., Gutierrez, C., Handschuh, S., Rousset, M.-C., Schmidt, R.A. (eds.) Reasoning Web 2009. LNCS, vol. 5689, pp. 40\u2013110. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-03754-2_2"},{"issue":"3","key":"25_CR9","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","volume":"22","author":"O Gabber","year":"1981","unstructured":"Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. J. Comput. Syst. Sci. 22(3), 407\u2013420 (1981)","journal-title":"J. Comput. Syst. Sci."},{"key":"25_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1007\/978-3-540-72200-7_23","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: clasp: a conflict-driven answer set solver. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 260\u2013265. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72200-7_23"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-72200-7_13","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"M Gebser","year":"2007","unstructured":"Gebser, M., Kaufmann, B., Neumann, A., Schaub, T.: Conflict-driven answer set enumeration. In: Baral, C., Brewka, G., Schlipf, J. (eds.) LPNMR 2007. LNCS (LNAI), vol. 4483, pp. 136\u2013148. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-72200-7_13"},{"key":"25_CR12","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: Kowalski, R., Bowen, K. (eds.) Logic Programming, Seattle, Washington, USA, pp. 1070\u20131080. MIT Press (1988)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Jain, T., Schneider, K.: Verifying the concentration property of permutation networks by BDDs. In: Leonard, E., Schneider, K. (eds.) Formal Methods and Models for Codesign (MEMOCODE), Kanpur, India, pp. 43\u201353. IEEE Computer Society (2016)","DOI":"10.1109\/MEMCOD.2016.7797744"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/3-540-45757-7_50","volume-title":"Logics in Artificial Intelligence","author":"N Leone","year":"2002","unstructured":"Leone, N., Pfeifer, G., Faber, W., Calimeri, F., Dell\u2019Armi, T., Eiter, T., Gottlob, G., Ianni, G., Ielpa, G., Koch, C., Perri, S., Polleres, A.: The DLV system. In: Flesca, S., Greco, S., Ianni, G., Leone, N. (eds.) JELIA 2002. LNCS (LNAI), vol. 2424, pp. 537\u2013540. Springer, Heidelberg (2002). doi: 10.1007\/3-540-45757-7_50"},{"key":"25_CR15","unstructured":"Morgenstern, A., Schneider, K.: Synthesis of parallel sorting networks using SAT solvers. In: Methoden und Beschreibungssprachen zur Modellierung und Verifikation von Schaltungen und Systemen (MBMV), Oldenburg, Germany, pp. 71\u201380 (2011)"},{"issue":"2\u20133","key":"25_CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1142\/S0129626492000337","volume":"2","author":"I Parberry","year":"1992","unstructured":"Parberry, I.: The pairwise sorting network. Par. Proc. Lett. (PPL) 2(2\u20133), 205\u2013211 (1992)","journal-title":"Par. Proc. Lett. (PPL)"},{"key":"25_CR17","unstructured":"Pinsker, M.: On the complexity of a concentrator. In: International Teletraffic Conference (ITC), Stockholm, Sweden, pp. 318:1\u2013318:4 (1973)"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Quinton, B., Wilton, S.: Concentrator access networks for programmable logic cores on SoCs. In: International Symposium on Circuits and Systems (ISCAS), Kobe, Japan, vol. 1, pp. 45\u201348. IEEE Computer Society (2005)","DOI":"10.1109\/ISCAS.2005.1464520"},{"issue":"4","key":"25_CR19","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1016\/j.ipl.2006.01.006","volume":"98","author":"U Sch\u00f6ning","year":"2006","unstructured":"Sch\u00f6ning, U.: Smaller superconcentrators of density 28. Inf. Process. Lett. (IPL) 98(4), 127\u2013129 (2006)","journal-title":"Inf. Process. Lett. (IPL)"}],"container-title":["Lecture Notes in Computer Science","Logic Programming and Nonmonotonic Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-61660-5_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,27]],"date-time":"2019-09-27T01:37:32Z","timestamp":1569548252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-61660-5_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319616599","9783319616605"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-61660-5_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}