{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:32:51Z","timestamp":1725535971720},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029585"},{"type":"electronic","value":"9783642029592"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02959-2_11","type":"book-chapter","created":{"date-parts":[[2009,7,25]],"date-time":"2009-07-25T05:02:22Z","timestamp":1248498142000},"page":"146-150","source":"Crossref","is-referenced-by-count":3,"title":["Dei: A Theorem Prover for Terms with Integer Exponents"],"prefix":"10.1007","author":[{"given":"Hicham","family":"Bensaid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Caferra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Peltier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-540-73445-1_4","volume-title":"Logic, Language, Information and Computation","author":"H. Bensaid","year":"2007","unstructured":"Bensaid, H., Caferra, R., Peltier, N.: Towards systematic analysis of theorem provers search spaces: First steps. In: Leivant, D., de Queiroz, R. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 38\u201352. Springer, Heidelberg (2007)"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/3-540-54303-1","volume-title":"Conditional and Typed Rewriting Systems","author":"H. Chen","year":"1991","unstructured":"Chen, H., Hsiang, J., Kong, H.: On finite representations of infinite sequences of terms. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol.\u00a0516, pp. 100\u2013114. Springer, Heidelberg (1991)"},{"key":"11_CR3","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01294596","volume":"28","author":"H. Comon","year":"1995","unstructured":"Comon, H.: On unification of terms with integer exponents. Mathematical System Theory\u00a028, 67\u201388 (1995)","journal-title":"Mathematical System Theory"},{"issue":"1-2","key":"11_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(96)00052-7","volume":"176","author":"M. Hermann","year":"1997","unstructured":"Hermann, M., Galbav\u00fd, R.: Unification of Infinite Sets of Terms schematized by Primal Grammars. Theoretical Computer Science\u00a0176(1-2), 111\u2013158 (1997)","journal-title":"Theoretical Computer Science"},{"key":"11_CR5","unstructured":"Loechner, V.: Polylib: A library for manipulating parametrized polyhedra. Tech. rep., ICPS, Universite Louis Pasteur de Strasbourg (1999)"},{"key":"11_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1007\/3-540-45744-5_48","volume-title":"Automated Reasoning","author":"N. Peltier","year":"2001","unstructured":"Peltier, N.: A General Method for Using Terms Schematizations in Automated Deduction. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol.\u00a02083, pp. 578\u2013593. Springer, Heidelberg (2001)"},{"key":"11_CR7","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/BFb0013079","volume-title":"Logic Programming and Automated Reasoning","author":"G. Salzer","year":"1992","unstructured":"Salzer, G.: The unification of infinite sets of terms and its applications. In: Voronkov, A. (ed.) LPAR 1992. LNCS (LNAI), vol.\u00a0624, pp. 409\u2013429. Springer, Heidelberg (1992)"},{"key":"11_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-540-25984-8_15","volume-title":"Automated Reasoning","author":"S. Schulz","year":"2004","unstructured":"Schulz, S.: System Description: E\u00a00.81. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS (LNAI), vol.\u00a03097, pp. 223\u2013228. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-22"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02959-2_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T06:48:25Z","timestamp":1552114105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02959-2_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029585","9783642029592"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02959-2_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}