{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:07:04Z","timestamp":1754482024923,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030887001"},{"type":"electronic","value":"9783030887018"}],"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-88701-8_21","type":"book-chapter","created":{"date-parts":[[2021,10,21]],"date-time":"2021-10-21T23:06:25Z","timestamp":1634857585000},"page":"344-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Computing Least and Greatest Fixed Points in Absorptive Semirings"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1099-5713","authenticated-orcid":false,"given":"Matthias","family":"Naaf","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,22]]},"reference":[{"key":"21_CR1","doi-asserted-by":"publisher","unstructured":"Arnold, A., Niwi\u0144ski, D., Parys, P.: A quasi-polynomial black-box algorithm for fixed point evaluation. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 183, pp. 9:1\u20139:23. Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.9","DOI":"10.4230\/LIPIcs.CSL.2021.9"},{"key":"21_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/10722010_4","volume-title":"Mathematics of Program Construction","author":"E Cohen","year":"2000","unstructured":"Cohen, E.: Separation and reduction. In: Backhouse, R., Oliveira, J.N. (eds.) MPC 2000. LNCS, vol. 1837, pp. 45\u201359. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722010_4"},{"key":"21_CR3","unstructured":"Dannert, K., Gr\u00e4del, E., Naaf, M., Tannen, V.: Generalized absorptive polynomials and provenance semantics for fixed-point logic. arXiv: 1910.07910 [cs.LO] (2019). https:\/\/arxiv.org\/abs\/1910.07910, full version of [4]"},{"key":"21_CR4","doi-asserted-by":"publisher","unstructured":"Dannert, K., Gr\u00e4del, E., Naaf, M., Tannen, V.: Semiring provenance for fixed-point logic. In: Baier, C., Goubault-Larrecq, J. (eds.) 29th EACSL Annual Conference on Computer Science Logic (CSL 2021). Leibniz International Proceedings in Informatics (LIPIcs), vol. 183, pp. 17:1\u201317:22. Dagstuhl (2021). https:\/\/doi.org\/10.4230\/LIPIcs.CSL.2021.17","DOI":"10.4230\/LIPIcs.CSL.2021.17"},{"key":"21_CR5","doi-asserted-by":"publisher","unstructured":"Deutch, D., Milo, T., Roy, S., Tannen, V.: Circuits for datalog provenance. In: Proceedings of 17th International Conference on Database Theory ICDT, pp. 201\u2013212. OpenProceedings.org (2014). https:\/\/doi.org\/10.5441\/002\/icdt.2014.22","DOI":"10.5441\/002\/icdt.2014.22"},{"issue":"6","key":"21_CR6","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1145\/1857914.1857917","volume":"57","author":"J Esparza","year":"2010","unstructured":"Esparza, J., Kiefer, S., Luttenberger, M.: Newtonian program analysis. J. ACM 57(6), 33 (2010). https:\/\/doi.org\/10.1145\/1857914.1857917","journal-title":"J. ACM"},{"key":"21_CR7","doi-asserted-by":"publisher","unstructured":"Ghilardi, S., Gouveia, M.J., Santocanale, L.: Fixed-point elimination in the intuitionistic propositional calculus. ACM Trans. Comput. Log. 21(1), 4:1\u20134:37 (2019). https:\/\/doi.org\/10.1145\/3359669","DOI":"10.1145\/3359669"},{"key":"21_CR8","series-title":"Operations Research\/Computer Science Interfaces","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-75450-5","volume-title":"Graphs, Dioids and Semirings: New Models and Algorithms","author":"M Gondran","year":"2008","unstructured":"Gondran, M., Minoux, M.: Graphs, Dioids and Semirings: New Models and Algorithms. Operations Research\/Computer Science Interfaces, vol. 41. Springer, Boston (2008). https:\/\/doi.org\/10.1007\/978-0-387-75450-5"},{"key":"21_CR9","unstructured":"Gr\u00e4del, E., Tannen, V.: Semiring provenance for first-order model checking. arXiv:1712.01980 [cs.LO] (2017). https:\/\/arxiv.org\/abs\/1712.01980"},{"issue":"3","key":"21_CR10","doi-asserted-by":"publisher","first-page":"203","DOI":"10.2140\/moscow.2020.9.203","volume":"9","author":"E Gr\u00e4del","year":"2020","unstructured":"Gr\u00e4del, E., Tannen, V.: Provenance analysis for logic and games. Mosc. J. Comb. Number Theory 9(3), 203\u2013228 (2020). https:\/\/doi.org\/10.2140\/moscow.2020.9.203","journal-title":"Mosc. J. Comb. Number Theory"},{"key":"21_CR11","doi-asserted-by":"publisher","unstructured":"Green, T., Karvounarakis, G., Tannen, V.: Provenance semirings. In: Principles of Database Systems PODS, pp. 31\u201340 (2007). https:\/\/doi.org\/10.1145\/1265530.1265535","DOI":"10.1145\/1265530.1265535"},{"key":"21_CR12","doi-asserted-by":"publisher","unstructured":"Green, T., Tannen, V.: The semiring framework for database provenance. In: Proceedings of PODS, pp. 93\u201399. ACM (2017). https:\/\/doi.org\/10.1145\/3034786.3056125","DOI":"10.1145\/3034786.3056125"},{"key":"21_CR13","unstructured":"Hausmann, D., Schr\u00f6der, L.: Computing nested fixpoints in quasipolynomial time. arXiv:1907.07020 [cs.CC] (2019). https:\/\/arxiv.org\/abs\/1907.07020"},{"key":"21_CR14","doi-asserted-by":"publisher","unstructured":"Hopkins, M., Kozen, D.: Parikh\u2019s theorem in commutative Kleene algebra. In: Proceedings of 14th Symposium on Logic in Computer Science, pp. 394\u2013401. IEEE (1999). https:\/\/doi.org\/10.1109\/LICS.1999.782634","DOI":"10.1109\/LICS.1999.782634"},{"issue":"3","key":"21_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.25596\/jalc-2002-321","volume":"7","author":"M Mohri","year":"2002","unstructured":"Mohri, M.: Semiring frameworks and algorithms for shortest-distance problems. J. Autom. Lang. Comb. 7(3), 321\u2013350 (2002). https:\/\/doi.org\/10.25596\/jalc-2002-321","journal-title":"J. Autom. Lang. Comb."},{"key":"21_CR16","unstructured":"Naaf, M.: Computing least and greatest fixed points in absorptive semirings. arXiv: 2106.00399 [cs.LO] (2021). https:\/\/arxiv.org\/abs\/2106.00399, full version of this paper"}],"container-title":["Lecture Notes in Computer Science","Relational and Algebraic Methods in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88701-8_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,22]],"date-time":"2021-10-22T00:50:38Z","timestamp":1634863838000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88701-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030887001","9783030887018"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88701-8_21","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":"22 October 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"RAMiCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Relational and Algebraic Methods in Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marseille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"2 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ramics2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ramics19.lis-lab.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}