{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:38:35Z","timestamp":1743118715427,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642142024"},{"type":"electronic","value":"9783642142031"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-14203-1_32","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T13:10:58Z","timestamp":1278940258000},"page":"369-383","source":"Crossref","is-referenced-by-count":2,"title":["Perfect Discrimination Graphs: Indexing 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":"32_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.J.G.B. (eds.) WoLLIC 2007. LNCS, vol.\u00a04576, pp. 38\u201352. Springer, Heidelberg (2007)"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/978-3-642-02959-2_11","volume-title":"CADE 2009","author":"H. Bensaid","year":"2009","unstructured":"Bensaid, H., Caferra, R., Peltier, N.: Dei: A theorem prover for terms with integer exponents. In: Schmidt, R.A. (ed.) CADE 2009. LNCS, vol.\u00a05663, pp. 146\u2013150. Springer, Heidelberg (2009)"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bouhoula, A., Kounalis, E., Rusinowitch, M.: Spike, an automatic theorem prover. In: Voronkov (ed.) [18], pp. 460\u2013462","DOI":"10.1007\/BFb0013087"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/BF00881856","volume":"14","author":"A. Bouhoula","year":"1995","unstructured":"Bouhoula, A., Rusinowitch, M.: Implicit induction in conditional theories. Journal of Automated Reasoning\u00a014, 14\u2013189 (1995)","journal-title":"Journal of Automated Reasoning"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Bundy, A.: The automation of proof by mathematical induction. In: Robinson, Voronkov (eds.) [15], pp. 845\u2013911","DOI":"10.1016\/B978-044450813-3\/50015-1"},{"key":"32_CR6","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":"32_CR7","unstructured":"Comon, H.: Inductionless induction. In: David, R. (ed.) 2nd Int. Conf. in Logic For Computer Science: Automated Deduction. Lecture notes, Chamb\u00e9ry, Univ. de Savoie (1994)"},{"issue":"1","key":"32_CR8","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 Systems Theory\u00a028(1), 67\u201388 (1995)","journal-title":"Mathematical Systems Theory"},{"issue":"1-2","key":"32_CR9","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. Theor. Comput. Sci.\u00a0176(1-2), 111\u2013158 (1997)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1005872405899","volume":"18","author":"T. Hillenbrand","year":"1997","unstructured":"Hillenbrand, T., Buch, A., Vogt, R., L\u00f6chner, B.: Waldmeister - high-performance equational deduction. J. Autom. Reason.\u00a018(2), 265\u2013270 (1997)","journal-title":"J. Autom. Reason."},{"key":"32_CR11","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2000","unstructured":"Hopcroft, J.E., Motwani, R., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2000)","edition":"2"},{"issue":"2","key":"32_CR12","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF00245458","volume":"9","author":"W. McCune","year":"1992","unstructured":"McCune, W.: Experiments with discrimination-tree indexing and path indexing for term retrieval. J. Autom. Reasoning\u00a09(2), 147\u2013167 (1992)","journal-title":"J. Autom. Reasoning"},{"issue":"1","key":"32_CR13","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1006\/jsco.1997.0114","volume":"24","author":"N. Peltier","year":"1997","unstructured":"Peltier, N.: Increasing model building capabilities by constraint solving on terms with integer exponents. Journal of Symbolic Computation\u00a024(1), 59\u2013101 (1997)","journal-title":"Journal of Symbolic Computation"},{"key":"32_CR14","unstructured":"Ramakrishnan, I.V., Sekar, R.C., Voronkov, A.: Term indexing. In: Robinson, Voronkov (eds.) [15], pp. 1853\u20131964"},{"key":"32_CR15","unstructured":"Robinson, J.A., Voronkov, A. (eds.): Handbook of Automated Reasoning (in 2 volumes). Elsevier\/MIT Press (2001)"},{"key":"32_CR16","doi-asserted-by":"crossref","unstructured":"Salzer, G.: The unification of infinite sets of terms and its applications. In: Voronkov [18], pp. 409\u2013420","DOI":"10.1007\/BFb0013079"},{"key":"32_CR17","series-title":"Lecture Notes in Artificial Intelligence","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)"},{"key":"32_CR18","series-title":"Lecture Notes in Computer Science","volume-title":"Logic Programming and Automated Reasoning","year":"1992","unstructured":"Voronkov, A. (ed.): LPAR 1992. LNCS, vol.\u00a0624. Springer, Heidelberg (1992)"},{"issue":"1","key":"32_CR19","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1613\/jair.275","volume":"4","author":"T. Walsh","year":"1996","unstructured":"Walsh, T.: A divergence critic for inductive proof. Journal of Artificial Intelligence Research\u00a04(1), 209\u2013235 (1996)","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-14203-1_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,20]],"date-time":"2021-08-20T02:03:30Z","timestamp":1629425010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-14203-1_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642142024","9783642142031"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-14203-1_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}