{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T21:37:50Z","timestamp":1743025070132,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518240"},{"type":"electronic","value":"9783030518257"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-51825-7_33","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"481-491","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits"],"prefix":"10.1007","author":[{"given":"Milan","family":"\u010ce\u0161ka","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ji\u0159\u00ed","family":"Maty\u00e1\u0161","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vojtech","family":"Mrazek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom\u00e1\u0161","family":"Vojnar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","first-page":"1840001","DOI":"10.1142\/S0218213018400018","volume":"27","author":"G Audemard","year":"2018","unstructured":"Audemard, G., Simon, L.: On the glucose SAT solver. Int. J. Artif. Intell. Tools 27, 1840001 (2018)","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"33_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-540-70545-1_28","volume-title":"Computer Aided Verification","author":"R Bruttomesso","year":"2008","unstructured":"Bruttomesso, R., Cimatti, A., Franz\u00e9n, A., Griggio, A., Sebastiani, R.: The MathSAT\u00a04 SMT Solver. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol. 5123, pp. 299\u2013303. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-70545-1_28"},{"key":"33_CR3","doi-asserted-by":"crossref","unstructured":"\u010ce\u0161ka, M., Maty\u00e1\u0161, J., et al.: Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. In: International Conference on Computer Aided Design (ICCAD\u20192017), pp. 416\u2013423. IEEE (2017)","DOI":"10.1109\/ICCAD.2017.8203807"},{"key":"33_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1007\/978-3-319-96145-3_35","volume-title":"Computer Aided Verification","author":"M \u010ce\u0161ka","year":"2018","unstructured":"\u010ce\u0161ka, M., Maty\u00e1\u0161, J., Mrazek, V., Sekanina, L., Vasicek, Zdenek, Vojnar, Tom\u00e1\u0161: ADAC: Automated design of approximate circuits. In: Chockler, H., Weissenbacher, G. (eds.) CAV 2018. LNCS, vol. 10981, pp. 612\u2013620. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-96145-3_35"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chandrasekharan, A., Soeken, M., et al.: Precise error determination of approximated components in sequential circuits with model checking. In: Design Automation Conference (DAC\u20192016), pp. 129:1\u2013129:6. ACM (2016)","DOI":"10.1145\/2897937.2898069"},{"key":"33_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"33_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Froehlich, S., Gro\u00dfe, D., Drechsler, R.: One method - all error-metrics: a three-stage approach for error-metric evaluation in approximate computing. In: Design, Automation Test in Europe Conference Exhibition (2019)","DOI":"10.23919\/DATE.2019.8715138"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Froehlich, S., Grosse, D., Drechsler, R.: Approximate hardware generation using symbolic computer algebra employing grobner basis. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192018), pp. 889\u2013892. IEEE (2018)","DOI":"10.23919\/DATE.2018.8342133"},{"issue":"1","key":"33_CR10","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1109\/TCAD.2012.2217962","volume":"32","author":"V Gupta","year":"2013","unstructured":"Gupta, V., Mohapatra, D., et al.: Low-power digital signal processing using approximate adders. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 32(1), 124\u2013137 (2013)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"Haaswijk, W., Soeken, M., et al.: SAT based exact synthesis using DAG topology families. In: Design Automation Conference (DAC\u20192018), pp. 1\u20136 (2018)","DOI":"10.1109\/DAC.2018.8465888"},{"key":"33_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-030-17462-0_3","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MJH Heule","year":"2019","unstructured":"Heule, M.J.H., Kiesl, B., Biere, A.: Encoding redundancy for satisfaction-driven clause learning. In: Vojnar, T., Zhang, L. (eds.) TACAS 2019. LNCS, vol. 11427, pp. 41\u201358. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17462-0_3"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"Lotfi, A., Rahimi, A., et al.: Grater: an approximation workflow for exploiting data-level parallelism in FPGA acceleration. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192016), pp. 1279\u20131284. EDA Consortium (2016)","DOI":"10.3850\/9783981537079_0805"},{"issue":"4","key":"33_CR14","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1109\/TCSI.2009.2027626","volume":"57","author":"HR Mahdiani","year":"2010","unstructured":"Mahdiani, H.R., Ahmadi, A., et al.: Bio-inspired imprecise computational blocks for efficient VLSI implementation of soft-computing applications. IEEE Trans. Circuits Syst. I Regul. Pap. 57(4), 850\u2013862 (2010)","journal-title":"IEEE Trans. Circuits Syst. I Regul. Pap."},{"key":"33_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-540-46239-2_9","volume-title":"Genetic Programming","author":"JF Miller","year":"2000","unstructured":"Miller, J.F., Thomson, P.: Cartesian genetic programming. In: Poli, R., Banzhaf, W., Langdon, W.B., Miller, J., Nordin, P., Fogarty, T.C. (eds.) EuroGP 2000. LNCS, vol. 1802, pp. 121\u2013132. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/978-3-540-46239-2_9"},{"key":"33_CR16","doi-asserted-by":"crossref","unstructured":"Mrazek, V., Hrbacek, R., et al.: EvoApprox8b: library of approximate adders and multipliers for circuit design and benchmarking of approximation methods. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192017) (2017)","DOI":"10.23919\/DATE.2017.7926993"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Mrazek, V., Sarwar, S.S., et al.: Design of power-efficient approximate multipliers for approximate artificial neural networks. In: International Conference on Computer Aided Design (ICCAD\u20192016), pp. 811\u2013817. ACM (2016)","DOI":"10.1145\/2966986.2967021"},{"key":"33_CR18","unstructured":"Nepal, K., Hashemi, S., et al.: Automated high-level generation of low-power approximate computing circuits. IEEE Trans. Emerg. Top. Comput. 7, 18\u201330 (2018)"},{"key":"33_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-99322-5","volume-title":"Approximate Circuits","year":"2019","unstructured":"Reda, S., Shafique, M. (eds.): Approximate Circuits. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-99322-5"},{"key":"33_CR20","first-page":"91","volume":"15","author":"A Riazanov","year":"2002","unstructured":"Riazanov, A., Voronkov, A.: The design and implementation of vampire. AI Commun. 15, 91\u2013110 (2002)","journal-title":"AI Commun."},{"key":"33_CR21","unstructured":"Soeken, M.: Cirkit (version 3). https:\/\/github.com\/msoeken\/cirkit (2019)"},{"issue":"11","key":"33_CR22","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1109\/TCAD.2017.2664059","volume":"36","author":"M Soeken","year":"2017","unstructured":"Soeken, M., Amar\u00f9, L.G., et al.: Exact synthesis of majority-inverter graphs and its applications. IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst. 36(11), 1842\u20131855 (2017)","journal-title":"IEEE Trans. Comput. -Aided Des. Integr. Circuits Syst."},{"key":"33_CR23","doi-asserted-by":"crossref","unstructured":"Soeken, M., De Micheli, G., Mishchenko, A.: Busy man\u2019s synthesis: combinational delay optimization with sat. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192017), pp. 830\u2013835 (2017)","DOI":"10.23919\/DATE.2017.7927103"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Soeken, M., Haaswijk, W., et al.: Practical exact synthesis. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192018), pp. 309\u2013314 (2018)","DOI":"10.23919\/DATE.2018.8342027"},{"key":"33_CR25","doi-asserted-by":"crossref","unstructured":"Vasicek, Z., Mrazek, V.: Towards low power approximate DCT architecture for HEVC standard. In: Design, Automation Test in Europe Conference Exhibition (DATE\u20192017) (2017)","DOI":"10.23919\/DATE.2017.7927241"},{"issue":"3","key":"33_CR26","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1109\/TEVC.2014.2336175","volume":"19","author":"Z Vasicek","year":"2015","unstructured":"Vasicek, Z., Sekanina, L.: Evolutionary approach to approximate digital circuits design. IEEE Trans. Evol. Comput. 19(3), 432\u2013444 (2015)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"33_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-29139-5_23","volume-title":"Genetic Programming","author":"Z Va\u0161\u00ed\u010dek","year":"2012","unstructured":"Va\u0161\u00ed\u010dek, Z., Slan\u00fd, K.: Efficient phenotype evaluation in cartesian genetic programming. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, Carlos (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 266\u2013278. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29139-5_23"},{"key":"33_CR28","doi-asserted-by":"crossref","unstructured":"Venkatesan, R., Agarwal, A., et al.: MACACO: Modeling and analysis of circuits for approximate computing. In: International Conference on Computer Aided Design (ICCAD\u20192011), pp. 667\u2013673. ACM(2011)","DOI":"10.1109\/ICCAD.2011.6105401"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51825-7_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,22]],"date-time":"2021-03-22T14:30:54Z","timestamp":1616423454000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"26 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alghero","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2020.idea-researchlab.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"69","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}