{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T16:35:31Z","timestamp":1726072531294},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030431198"},{"type":"electronic","value":"9783030431204"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-43120-4_13","type":"book-chapter","created":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T00:13:56Z","timestamp":1584490436000},"page":"153-168","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Automatic Synthesis of Merging and Inserting Algorithms on Binary Trees Using Multisets in Theorema"],"prefix":"10.1007","author":[{"given":"Isabela","family":"Dr\u0103mnesc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tudor","family":"Jebelean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,3,18]]},"reference":[{"issue":"1","key":"13_CR1","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","volume":"30","author":"WD Blizard","year":"1989","unstructured":"Blizard, W.D.: Multiset theory. Notre Dame J. Formal Logic 30(1), 36\u201366 (1989). https:\/\/doi.org\/10.1305\/ndjfl\/1093634995","journal-title":"Notre Dame J. Formal Logic"},{"issue":"2","key":"13_CR2","first-page":"9","volume":"XXXVII","author":"B Buchberger","year":"2000","unstructured":"Buchberger, B.: Theory exploration with theorema. Analele Universitatii Din Timisoara, Seria Matematica-Informatica XXXVII(2), 9\u201332 (2000)","journal-title":"Analele Universitatii Din Timisoara, Seria Matematica-Informatica"},{"key":"13_CR3","first-page":"41","volume":"XLI","author":"B Buchberger","year":"2003","unstructured":"Buchberger, B.: Algorithm invention and verification by lazy thinking. Analele Universitatii din Timisoara, Seria Matematica - Informatica XLI, 41\u201370 (2003)","journal-title":"Analele Universitatii din Timisoara, Seria Matematica - Informatica"},{"key":"13_CR4","unstructured":"Buchberger, B., Craciun, A.: Algorithm synthesis by lazy thinking: using problem schemes. In: Proceedings of SYNASC, pp. 90\u2013106 (2004)"},{"key":"13_CR5","unstructured":"Buchberger, B., et al.: The theorema project: a progress report. In: Calculemus 2000, pp. 98\u2013113. A.K. Peters, Natick (2000)"},{"issue":"1","key":"13_CR6","doi-asserted-by":"publisher","first-page":"149","DOI":"10.6092\/issn.1972-5787\/4568","volume":"9","author":"B Buchberger","year":"2016","unstructured":"Buchberger, B., Jebelean, T., Kutsia, T., Maletzky, A., Windsteiger, W.: Theorema 2.0: computer-assisted natural-style mathematics. J. Formal. Reason. 9(1), 149\u2013185 (2016). https:\/\/doi.org\/10.6092\/issn.1972-5787\/4568","journal-title":"J. Formal. Reason."},{"key":"13_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.entcs.2005.08.003","volume":"153","author":"A Bundy","year":"2006","unstructured":"Bundy, A., Dixon, L., Gow, J., Fleuriot, J.: Constructing induction rules for deductive synthesis proofs. Electron. Notes Theor. Comput. Sci. 153, 3\u201321 (2006). https:\/\/doi.org\/10.1016\/j.entcs.2005.08.003","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.jsc.2014.09.030","volume":"68","author":"I Dramnesc","year":"2015","unstructured":"Dramnesc, I., Jebelean, T.: Synthesis of list algorithms by mechanical proving. J. Symb. Comput. 68, 61\u201392 (2015). https:\/\/doi.org\/10.1016\/j.jsc.2014.09.030","journal-title":"J. Symb. Comput."},{"key":"13_CR9","doi-asserted-by":"crossref","unstructured":"Dramnesc, I., Jebelean, T.: Case studies on algorithm discovery from proofs: the delete function on lists and binary trees using multisets. In: SISY 2019, pp. 213\u2013220. IEEE Xplore (2019)","DOI":"10.1109\/SISY47553.2019.9111483"},{"key":"13_CR10","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T.: Proof-based synthesis of sorting algorithms using multisets in theorema. In: FROM 2019, EPTCS 303, pp. 76\u201391 (2019). https:\/\/doi.org\/10.4204\/EPTCS.303.6","DOI":"10.4204\/EPTCS.303.6"},{"key":"13_CR11","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: Combinatorial techniques for proof-based synthesis of sorting algorithms. In: SYNASC 2015, pp. 137\u2013144 (2015). https:\/\/doi.org\/10.1109\/SYNASC.2015.30","DOI":"10.1109\/SYNASC.2015.30"},{"key":"13_CR12","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: Theory exploration of binary trees. In: SISY 2015, pp. 139\u2013144. IEEE (2015). https:\/\/doi.org\/10.1109\/SISY.2015.7325367","DOI":"10.1109\/SISY.2015.7325367"},{"key":"13_CR13","doi-asserted-by":"publisher","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: A case study on algorithm discovery from proofs: the insert function on binary trees. In: SACI 2016, pp. 231\u2013236. IEEE (2016). https:\/\/doi.org\/10.1109\/SACI.2016.7507376","DOI":"10.1109\/SACI.2016.7507376"},{"key":"13_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-319-30000-9_43","volume-title":"Language and Automata Theory and Applications","author":"I Dr\u0103mnesc","year":"2016","unstructured":"Dr\u0103mnesc, I., Jebelean, T., Stratulat, S.: Proof\u2013based synthesis of sorting algorithms for trees. In: Dediu, A.-H., Janou\u0161ek, J., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2016. LNCS, vol. 9618, pp. 562\u2013575. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-30000-9_43"},{"key":"13_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jsc.2018.04.002","volume":"90","author":"I Dramnesc","year":"2019","unstructured":"Dramnesc, I., Jebelean, T., Stratulat, S.: Mechanical synthesis of sorting algorithms for binary trees by logic and combinatorial techniques. J. Symb. Comput. 90, 3\u201341 (2019). https:\/\/doi.org\/10.1016\/j.jsc.2018.04.002","journal-title":"J. Symb. Comput."},{"key":"13_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1012065","volume-title":"The Art of Computer Programming, Volume 2: Seminumerical Algorithms","author":"DE Knuth","year":"1998","unstructured":"Knuth, D.E.: The Art of Computer Programming, Volume 2: Seminumerical Algorithms, 3rd edn. Addison-Wesley, Boston (1998). https:\/\/doi.org\/10.1137\/1012065","edition":"3"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/11853886_21","volume-title":"Logics in Artificial Intelligence","author":"Y Korukhova","year":"2006","unstructured":"Korukhova, Y.: Automatic deductive synthesis of lisp programs in the system ALISA. In: Fisher, M., van der Hoek, W., Konev, B., Lisitsa, A. (eds.) JELIA 2006. LNCS (LNAI), vol. 4160, pp. 242\u2013252. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11853886_21"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z Manna","year":"1980","unstructured":"Manna, Z., Waldinger, R.: A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst. 2(1), 90\u2013121 (1980). https:\/\/doi.org\/10.1145\/357084.357090","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"13_CR19","doi-asserted-by":"publisher","DOI":"10.2307\/2275898","volume-title":"The Logical Basis for Computer Programming, vol. 1: Deductive Reasoning","author":"Z Manna","year":"1985","unstructured":"Manna, Z., Waldinger, R.: The Logical Basis for Computer Programming, vol. 1: Deductive Reasoning. Addison-Wesley, Boston (1985). https:\/\/doi.org\/10.2307\/2275898"},{"issue":"8","key":"13_CR20","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1109\/32.153379","volume":"18","author":"Z Manna","year":"1992","unstructured":"Manna, Z., Waldinger, R.: Fundamentals of deductive program synthesis. IEEE Trans. Softw. Eng. 18(8), 674\u2013704 (1992). https:\/\/doi.org\/10.1109\/32.153379","journal-title":"IEEE Trans. Softw. Eng."},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Radoaca, A.: Properties of multisets compared to sets. In: SYNASC 2015, pp. 187\u2013188 (2015). https:\/\/doi.org\/10.1109\/SYNASC.2015.37","DOI":"10.1109\/SYNASC.2015.37"},{"issue":"9","key":"13_CR22","doi-asserted-by":"publisher","first-page":"1024","DOI":"10.1109\/32.578788","volume":"16","author":"DR Smith","year":"1990","unstructured":"Smith, D.R.: Kids: a semiautomatic program development system. IEEE Trans. Softw. Eng. 16(9), 1024\u20131043 (1990). https:\/\/doi.org\/10.1109\/32.578788","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"6","key":"13_CR23","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/S0747-7171(89)80040-9","volume":"7","author":"J Traugott","year":"1989","unstructured":"Traugott, J.: Deductive synthesis of sorting programs. J. Symb. Comput. 7(6), 533\u2013572 (1989). https:\/\/doi.org\/10.1016\/S0747-7171(89)80040-9","journal-title":"J. Symb. Comput."},{"key":"13_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-662-44199-2_9","volume-title":"Mathematical Software \u2013 ICMS 2014","author":"W Windsteiger","year":"2014","unstructured":"Windsteiger, W.: Theorema 2.0: a system for mathematical theory exploration. In: Hong, H., Yap, C. (eds.) ICMS 2014. LNCS, vol. 8592, pp. 49\u201352. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-44199-2_9"}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-43120-4_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,4]],"date-time":"2021-03-04T20:19:19Z","timestamp":1614889159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-43120-4_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030431198","9783030431204"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-43120-4_13","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":"18 March 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Mathematical Aspects of Computer and Information Sciences","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Gebze","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turkey","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icmacis2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/macis2019.gtu.edu.tr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"66","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":"22","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":"14","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":"33% - 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":"2,1","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":"5,8","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)"}}]}}