{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:08:44Z","timestamp":1742911724495,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030810962"},{"type":"electronic","value":"9783030810979"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-81097-9_14","type":"book-chapter","created":{"date-parts":[[2021,7,19]],"date-time":"2021-07-19T23:04:38Z","timestamp":1626735878000},"page":"167-184","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to Solve Geometric Construction Problems from Images"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6938-4776","authenticated-orcid":false,"given":"Jaroslav","family":"Macke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4704-3388","authenticated-orcid":false,"given":"Jiri","family":"Sedlar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9361-1921","authenticated-orcid":false,"given":"Miroslav","family":"Olsak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1384-1613","authenticated-orcid":false,"given":"Josef","family":"Urban","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2554-5301","authenticated-orcid":false,"given":"Josef","family":"Sivic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,7,20]]},"reference":[{"key":"14_CR1","unstructured":"Project webpage. https:\/\/data.ciirc.cvut.cz\/public\/projects\/2021GeometryReasoning"},{"key":"14_CR2","unstructured":"Euclidea. https:\/\/www.euclidea.xyz"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"He K., Gkioxari G., Doll\u00e1r P., Girshick, R.: Mask R-CNN. In: 2017 IEEE International Conference on Computer Vision (ICCV) (2017)","DOI":"10.1109\/ICCV.2017.322"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Seo, M.J., Hajishirzi, H., Farhadi, A., Etzioni, O.: Diagram understanding in geometry questions. In: American Association for Artificial Intelligence (2014)","DOI":"10.1609\/aaai.v28i1.9146"},{"key":"14_CR5","doi-asserted-by":"crossref","unstructured":"Seo, M., Hajishirzi, H., Farhadi, A., Etzioni, O., Malcolm, C.: Solving geometry problems: combining text and diagram interpretation. Association for Computational Linguistics (2015)","DOI":"10.18653\/v1\/D15-1171"},{"key":"14_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25070-5_10","volume-title":"Thousands of Geometric Problems for Geometric Theorem Provers (TGTP)","author":"P Quaresma","year":"2011","unstructured":"Quaresma, P.: Thousands of Geometric Problems for Geometric Theorem Provers (TGTP). Springer, Heidelberg (2011)"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Vesna, M.: ArgoTriCS \u2013 automated triangle construction solver. J. Exper. Theor. Artif. Intell. 29(2), 247\u2013271 (2017)","DOI":"10.1080\/0952813X.2015.1132271"},{"key":"14_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-59340-3_14","volume-title":"Affine Geometry of Collinearity and Conditional Term Rewriting","author":"P Balbiani","year":"1995","unstructured":"Balbiani, P., Cerro, L.F.: Affine Geometry of Collinearity and Conditional Term Rewriting. Springer, Heidelberg (1995)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1023\/A:1006171315513","volume":"25","author":"SC Chou","year":"2000","unstructured":"Chou, S.C., Gao, X.S., Zhang, J.Z.: A deductive database approach to automated geometry theorem proving and discovering. J. Autom. Reasoning 25, 219\u2013246 (2000)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/BF00244356","volume":"6","author":"X Gao","year":"1990","unstructured":"Gao, X.: Transcendental functions and mechanical theorem proving in elementary geometries. J. Autom. Reasoning 6, 403\u2013417 (1990)","journal-title":"J. Autom. Reasoning"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/S0747-7171(86)80007-4","volume":"2","author":"K Deepak","year":"1986","unstructured":"Deepak, K.: Using Gr\u00f6bner bases to reason about geometry problems. J. Symbolic Comput. 2(4), 399\u2013408 (1986)","journal-title":"J. Symbolic Comput."},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Chou, S.C., Gao, X.S., Zhang, J.: Machine Proofs in Geometry: Automated Production of Readable Proofs for Geometry Theorems (1994)","DOI":"10.1142\/2196"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1005843632307","volume":"18","author":"W McCune","year":"1997","unstructured":"McCune, W., Wos, L.: Otter: the CADE-13 competition incarnations. J. Autom. Reasoning 18(2), 211\u2013220 (1997)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR14","unstructured":"McCune, W.: Prover9 and Mace4. http:\/\/www.cs.unm.edu\/~mccune\/prover9\/"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s10817-016-9392-2","volume":"58","author":"M Beeson","year":"2017","unstructured":"Beeson, M., Wos, L.: Finding proofs in Tarskian geometry. J. Autom. Reasoning 58(1), 201\u2013207 (2017)","journal-title":"J. Autom. Reasoning"},{"issue":"3\u20134","key":"14_CR16","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10472-014-9443-5","volume":"74","author":"SS Durdevic","year":"2015","unstructured":"Durdevic, S.S., Narboux, J., Janicic, P.: Automated generation of machine verifiable and readable proofs: a case study of Tarski\u2019s geometry. Ann. Math. Artif. Intell. 74(3\u20134), 249\u2013269 (2015)","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR17","volume-title":"Automated Development of Fundamental Mathematical Theories","author":"A Quaife","year":"1992","unstructured":"Quaife, A.: Automated Development of Fundamental Mathematical Theories. Kluwer Academic Publishers, Dordrecht (1992)"},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s10472-018-9606-x","volume":"85","author":"M Beeson","year":"2019","unstructured":"Beeson, M., Narboux, J., Wiedijk, F.: Proof-checking Euclid. Ann. Math. Artif. Intell. 85, 213\u2013257 (2019). https:\/\/doi.org\/10.1007\/s10472-018-9606-x","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-030-51054-1_29","volume-title":"Automated Reasoning","author":"J Jakub\u016fv","year":"2020","unstructured":"Jakub\u016fv, J., Chvalovsk\u00fd, K., Ol\u0161\u00e1k, M., Piotrowski, B., Suda, M., Urban, J.: ENIGMA anonymous: symbol-independent inference guiding\u00a0machine (System Description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 448\u2013463. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51054-1_29"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10817-020-09580-x","volume":"65","author":"T Gauthier","year":"2021","unstructured":"Gauthier, T., Kaliszyk, C., Urban, J., Kumar, R., Norrish, M.: TacticToe: learning to prove with tactics. J. Autom. Reasoning 65(2), 257\u2013286 (2021)","journal-title":"J. Autom. Reasoning"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Hosang, J., Benenson, R., Schiele, B.: Learning non-maximum suppression. In: Conference on Computer Vision and Pattern Recognition (CVPR) (2017)","DOI":"10.1109\/CVPR.2017.685"}],"container-title":["Lecture Notes in Computer Science","Intelligent Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-81097-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T22:54:51Z","timestamp":1672872891000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-81097-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030810962","9783030810979"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-81097-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"20 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CICM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Intelligent Computer Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Timisoara","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Romania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mkm2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cicm-conference.org\/2021\/cicm.php","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":"38","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":"12","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":"8","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":"32% - 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":"3,5","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)"}}]}}