{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T22:13:44Z","timestamp":1761948824554,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031417238"},{"type":"electronic","value":"9783031417245"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-41724-5_3","type":"book-chapter","created":{"date-parts":[[2023,8,23]],"date-time":"2023-08-23T07:02:38Z","timestamp":1692774158000},"page":"39-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["How to\u00a0Automatise Proofs of\u00a0Operator Statements: Moore\u2013Penrose Inverse; A Case Study"],"prefix":"10.1007","author":[{"given":"Klara","family":"Bernauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Hofstadler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Regensburger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,8,24]]},"reference":[{"key":"3_CR1","unstructured":"Bernauer, K.: Algebraic and automated proofs for Moore-Penrose inverses. Bachelor\u2019s thesis, Johannes Kepler University Linz, Austria (2021)"},{"issue":"251","key":"3_CR2","first-page":"323","volume":"1","author":"MA Borges","year":"1998","unstructured":"Borges, M.A., Borges, M.: Groebner bases property on elimination ideal in the noncommutative case. London Math. Soc. Leture Note Ser. 1(251), 323\u2013327 (1998)","journal-title":"London Math. Soc. Leture Note Ser."},{"key":"3_CR3","unstructured":"Buchberger, B.: Ein Algorithmus zum Auffinden der Basiselemente des Restklassenringes nach einem nulldimensionalen Polynomideal. Ph.D. thesis, University of Innsbruck, Austria (1965)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-60178-3_85","volume-title":"Logic and Computational Complexity","author":"SR Buss","year":"1995","unstructured":"Buss, S.R.: On Herbrand\u2019s theorem. In: Leivant, D. (ed.) LCC 1994. LNCS, vol. 960, pp. 195\u2013209. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/3-540-60178-3_85"},{"key":"3_CR5","volume":"409","author":"DS Cvetkovi\u0107-Ili\u0107","year":"2021","unstructured":"Cvetkovi\u0107-Ili\u0107, D.S., Hofstadler, C., Hossein Poor, J., Milo\u0161evi\u0107, J., Raab, C.G., Regensburger, G.: Algebraic proof methods for identities of matrices and operators: improvements of Hartwig\u2019s triple reverse order law. Appl. Math. Comput. 409, 126357 (2021)","journal-title":"Appl. Math. Comput."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1016\/j.jmaa.2009.08.056","volume":"361","author":"DS Djordjevi\u0107","year":"2010","unstructured":"Djordjevi\u0107, D.S., Din\u010di\u0107, N.\u010c: Reverse order law for the Moore-Penrose inverse. J. Math. Anal. Appl. 361(1), 252\u2013261 (2010)","journal-title":"J. Math. Anal. Appl."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1090\/S0002-9939-1966-0203464-1","volume":"17","author":"RG Douglas","year":"1966","unstructured":"Douglas, R.G.: On majorization, factorization, and range inclusion of operators on Hilbert space. Proc. Am. Math. Soc. 17(2), 413\u2013415 (1966)","journal-title":"Proc. Am. Math. Soc."},{"issue":"4","key":"3_CR8","first-page":"243","volume":"46","author":"WD Garraway","year":"2005","unstructured":"Garraway, W.D.: Sheaves for an involutive quantaloid. Cah. Topol. G\u00e9om. Diff\u00e9r. Cat\u00e9g. 46(4), 243\u2013274 (2005)","journal-title":"Cah. Topol. G\u00e9om. Diff\u00e9r. Cat\u00e9g."},{"issue":"1","key":"3_CR9","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1147\/rd.41.0028","volume":"4","author":"PC Gilmore","year":"1960","unstructured":"Gilmore, P.C.: A proof method for quantification theory: its justification and realization. IBM J. Res. Dev. 4(1), 28\u201335 (1960)","journal-title":"IBM J. Res. Dev."},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/0024-3795(86)90226-0","volume":"76","author":"RE Hartwig","year":"1986","unstructured":"Hartwig, R.E.: The reverse order law revisited. Linear Algebra Appl. 76, 241\u2013246 (1986)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"3_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1006\/jfan.1998.3249","volume":"161","author":"JW Helton","year":"1999","unstructured":"Helton, J.W., Stankus, M.: Computer assistance for \u201cdiscovering\u2019\u2019 formulas in system engineering and operator theory. J. Funct. Anal. 161(2), 289\u2013363 (1999)","journal-title":"J. Funct. Anal."},{"issue":"3","key":"3_CR12","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1109\/9.661584","volume":"43","author":"JW Helton","year":"1998","unstructured":"Helton, J.W., Stankus, M., Wavrik, J.J.: Computer simplification of formulas in linear systems theory. IEEE Trans. Automat. Control 43(3), 302\u2013314 (1998)","journal-title":"IEEE Trans. Automat. Control"},{"key":"3_CR13","series-title":"Operator Theory: Advances and Applications","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/978-3-0348-8522-5_12","volume-title":"Nonselfadjoint Operators and Related Topics","author":"JW Helton","year":"1994","unstructured":"Helton, J.W., Wavrik, J.J.: Rules for computer simplification of the formulas in operator model theory and linear systems. In: Feintuch, A., Gohberg, I. (eds.) Nonselfadjoint Operators and Related Topics. OT, vol. 73, pp. 325\u2013354. Springer, Cham (1994). https:\/\/doi.org\/10.1007\/978-3-0348-8522-5_12"},{"key":"3_CR14","unstructured":"Herbrand, J.: Recherches sur la th\u00e9orie de la d\u00e9monstration. Ph.D. thesis, University of Paris (1930)"},{"issue":"2","key":"3_CR15","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/3371991.3371996","volume":"53","author":"C Hofstadler","year":"2019","unstructured":"Hofstadler, C., Raab, C.G., Regensburger, G.: Certifying operator identities via noncommutative Gr\u00f6bner bases. ACM Commun. Comput. Algebra 53(2), 49\u201352 (2019)","journal-title":"ACM Commun. Comput. Algebra"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Hofstadler, C., Raab, C.G., Regensburger, G.: Computing elements of certain form in ideals to prove properties of operators. Math. Comput. Sci. 16(17) (2022)","DOI":"10.1007\/s11786-022-00536-5"},{"key":"3_CR17","unstructured":"Hofstadler, C., Raab, C.G., Regensburger, G.: Universal truth of operator statements via ideal membership. arXiv preprint arXiv:2212.11662 (2022)"},{"key":"3_CR18","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/j.jsc.2022.04.001","volume":"113","author":"C Hofstadler","year":"2022","unstructured":"Hofstadler, C., Verron, T.: Signature Gr\u00f6bner bases, bases of syzygies and cofactor reconstruction in the free algebra. J. Symb. Comput. 113, 211\u2013241 (2022)","journal-title":"J. Symb. Comput."},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Hofstadler, C., Verron, T.: Short proofs of ideal membership. arXiv preprint arXiv:2302.02832 (2023)","DOI":"10.2139\/ssrn.4481757"},{"key":"3_CR20","doi-asserted-by":"publisher","DOI":"10.1201\/b16113","volume-title":"Handbook of Linear Algebra","author":"L Hogben","year":"2013","unstructured":"Hogben, L.: Handbook of Linear Algebra, 2nd edn. CRC Press, Boca Raton (2013)","edition":"2"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Levandovskyy, V., Sch\u00f6nemann, H., Abou Zeid, K.: Letterplace - a subsystem of Singular for computations with free algebras via letterplace embedding. In: Proceedings of ISSAC 2020, pp. 305\u2013311 (2020)","DOI":"10.1145\/3373207.3404056"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Mikhalev, A.A., Zolotykh, A.A.: Standard Gr\u00f6bner-Shirshov bases of free algebras over rings. I. Free associative algebras. Int. J. Algebra Comput. 8(6), 689\u2013726 (1998)","DOI":"10.1142\/S021819679800034X"},{"key":"3_CR23","first-page":"394","volume":"26","author":"EH Moore","year":"1920","unstructured":"Moore, E.H.: On the reciprocal of the general algebraic matrix. Bull. Am. Math. Soc. 26, 394\u2013395 (1920)","journal-title":"Bull. Am. Math. Soc."},{"key":"3_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/3-540-16776-5_740","volume-title":"Algebraic Algorithms and Error-Correcting Codes","author":"F Mora","year":"1986","unstructured":"Mora, F.: Groebner bases for non-commutative polynomial rings. In: Calmet, J. (ed.) AAECC 1985. LNCS, vol. 229, pp. 353\u2013362. Springer, Heidelberg (1986). https:\/\/doi.org\/10.1007\/3-540-16776-5_740"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Mora, T.: Solving Polynomial Equation Systems IV: Volume 4, Buchberger Theory and Beyond, vol. 158. Cambridge University Press (2016)","DOI":"10.1017\/CBO9781316271902"},{"issue":"3","key":"3_CR26","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"R Penrose","year":"1955","unstructured":"Penrose, R.: A generalized inverse for matrices. Math. Proc. Cambridge Philos. Soc. 51(3), 406\u2013413 (1955)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"3_CR27","unstructured":"Prestwich, S.: CNF encodings. In: Handbook of Satisfiability, pp. 75\u201397. IOS Press (2009)"},{"key":"3_CR28","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/0024-3795(81)90145-2","volume":"40","author":"R Puystjens","year":"1981","unstructured":"Puystjens, R., Robinson, D.W.: The Moore-Penrose inverse of a morphism with factorization. Linear Algebra Appl. 40, 129\u2013141 (1981)","journal-title":"Linear Algebra Appl."},{"issue":"5","key":"3_CR29","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpaa.2020.106564","volume":"225","author":"CG Raab","year":"2021","unstructured":"Raab, C.G., Regensburger, G., Hossein Poor, J.: Formal proofs of operator identities by a single formal computation. J. Pure Appl. Algebra 225(5), 106564 (2021)","journal-title":"J. Pure Appl. Algebra"},{"key":"3_CR30","unstructured":"Schmitz, L.: Varieties over Module Homomorphisms and their Correspondence to free Algebras. Master\u2019s thesis, RWTH Aachen (2021)"},{"key":"3_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/978-3-030-53518-6_14","volume-title":"Intelligent Computer Mathematics","author":"L Schmitz","year":"2020","unstructured":"Schmitz, L., Levandovskyy, V.: Formally verifying proofs for algebraic identities of matrices. In: Benzm\u00fcller, C., Miller, B. (eds.) CICM 2020. LNCS (LNAI), vol. 12236, pp. 222\u2013236. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-53518-6_14"},{"key":"3_CR32","unstructured":"The Sage Developers: SageMath, the Sage Mathematics Software System (Version 9.8) (2023). https:\/\/www.sagemath.org"},{"issue":"1","key":"3_CR33","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0022-4049(87)90108-3","volume":"48","author":"B Tilson","year":"1987","unstructured":"Tilson, B.: Categories as algebra: an essential ingredient in the theory of monoids. J. Pure Appl. Algebra 48(1), 83\u2013198 (1987)","journal-title":"J. Pure Appl. Algebra"},{"key":"3_CR34","unstructured":"Xiu, X.: Non-commutative Gr\u00f6bner bases and applications. Ph.D. thesis, University of Passau, Germany (2012). http:\/\/www.opus-bayern.de\/uni-passau\/volltexte\/2012\/2682\/"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-41724-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T15:55:52Z","timestamp":1703001352000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-41724-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031417238","9783031417245"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-41724-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 August 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CASC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Computer Algebra in Scientific Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Havana","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cuba","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"casc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/casc-conference.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":"29","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":"0","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":"76% - 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.17","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":"1.41","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)"}}]}}