{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T18:50:31Z","timestamp":1762023031214,"version":"build-2065373602"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T00:00:00Z","timestamp":1567296000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1109\/sisy47553.2019.9111483","type":"proceedings-article","created":{"date-parts":[[2020,6,9]],"date-time":"2020-06-09T17:53:05Z","timestamp":1591725185000},"page":"000213-000220","source":"Crossref","is-referenced-by-count":2,"title":["Case Studies on Algorithm Discovery from Proofs: The Delete Function on Lists and Binary Trees using Multisets"],"prefix":"10.1109","author":[{"given":"Isabela","family":"Dr\u0103mnesc","sequence":"first","affiliation":[{"name":"West University,Department of Computer Science,Timişoara,Romania"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tudor","family":"Jebelean","sequence":"additional","affiliation":[{"name":"Research Institute for Symbolic Computation, Johannes Kepler University,Linz,Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2018.04.002"},{"key":"ref11","article-title":"The Art of Computer Programming","volume":"2","author":"knuth","year":"1998","journal-title":"Seminumerical Algorithms"},{"key":"ref12","article-title":"The Logical Basis for Computer Programming","volume":"1","author":"manna","year":"1985","journal-title":"Deductive Reasoning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2015.37"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2011.23"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2005.08.003"},{"key":"ref6","first-page":"421","article-title":"Theory Exploration in Theorema","author":"dramnesc","year":"2012","journal-title":"Case Study on Lists In SACI 2012"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/SYNASC.2012.43"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2014.09.030"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/SISY.2014.6923579"},{"key":"ref2","first-page":"149","article-title":"Theorema 2.0: Computer-Assisted Natural-Style Mathematics","volume":"9","author":"buchberger","year":"2016","journal-title":"Journal of Formalized Reasoning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1093634995"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/SISY.2015.7325367"}],"event":{"name":"2019 IEEE 17th International Symposium on Intelligent Systems and Informatics (SISY)","start":{"date-parts":[[2019,9,12]]},"location":"Subotica, Serbia","end":{"date-parts":[[2019,9,14]]}},"container-title":["2019 IEEE 17th International Symposium on Intelligent Systems and Informatics (SISY)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9107937\/9111475\/09111483.pdf?arnumber=9111483","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T18:28:30Z","timestamp":1755800910000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9111483\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,9]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/sisy47553.2019.9111483","relation":{},"subject":[],"published":{"date-parts":[[2019,9]]}}}