{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:59:06Z","timestamp":1762459146976},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642408847"},{"type":"electronic","value":"9783642408854"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40885-4_23","type":"book-chapter","created":{"date-parts":[[2013,9,11]],"date-time":"2013-09-11T11:20:19Z","timestamp":1378898419000},"page":"327-342","source":"Crossref","is-referenced-by-count":16,"title":["On Forward Closure and the Finite Variant Property"],"prefix":"10.1007","author":[{"given":"Christopher","family":"Bouchard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimberly A.","family":"Gero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Lynch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-642-31365-3_4","volume-title":"Automated Reasoning","author":"S. Anantharaman","year":"2012","unstructured":"Anantharaman, S., Erbatur, S., Lynch, C., Narendran, P., Rusinowitch, M.: Unification Modulo Synchronous Distributivity. In: Gramlich, B., Miller, D., Sattler, U. (eds.) IJCAR 2012. LNCS, vol.\u00a07364, pp. 14\u201329. Springer, Heidelberg (2012)"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1999)","DOI":"10.1017\/CBO9781139172752"},{"key":"23_CR3","unstructured":"Baader, F., Snyder, W.: Unification Theory. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 440\u2013526. Elsevier Science Publishers BV (1999)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Bouchard, C., Gero, K.A., Lynch, C., Narendran, P.: On Forward Closure and the Finite Variant Property. Technical report, Dept. of Computer Science, University at Albany\u2014SUNY (July 2013)","DOI":"10.1007\/978-3-642-40885-4_23"},{"key":"23_CR5","unstructured":"Bouchard, C., Gero, K.A., Narendran, P.: Some Notes on Basic Syntactic Mutation. In: Escobar, S., Korovin, K., Rybakov, V. (eds.) Proceedings 26th International Workshop on Unification, pp. 9\u201314 (2012)"},{"key":"23_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-32033-3_22","volume-title":"Term Rewriting and Applications","author":"H. Comon-Lundh","year":"2005","unstructured":"Comon-Lundh, H., Delaune, S.: The finite variant property: How to get rid of some algebraic properties. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 294\u2013307. Springer, Heidelberg (2005)"},{"key":"23_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1007\/978-3-642-33167-1_5","volume-title":"Computer Security \u2013 ESORICS 2012","author":"S. Erbatur","year":"2012","unstructured":"Erbatur, S., Escobar, S., Kapur, D., Liu, Z., Lynch, C., Meadows, C., Meseguer, J., Narendran, P., Santiago, S., Sasse, R.: Effective Symbolic Protocol Analysis via Equational Irreducibility Conditions. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol.\u00a07459, pp. 73\u201390. Springer, Heidelberg (2012)"},{"key":"23_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-540-70590-1_6","volume-title":"Rewriting Techniques and Applications","author":"S. Escobar","year":"2008","unstructured":"Escobar, S., Meseguer, J., Sasse, R.: Effectively checking the finite variant property. In: Voronkov, A. (ed.) RTA 2008. LNCS, vol.\u00a05117, pp. 79\u201393. Springer, Heidelberg (2008)"},{"issue":"7-8","key":"23_CR9","doi-asserted-by":"crossref","first-page":"898","DOI":"10.1016\/j.jlap.2012.01.002","volume":"81","author":"S. Escobar","year":"2012","unstructured":"Escobar, S., Sasse, R., Meseguer, J.: Folding variant narrowing and optimal variant termination. Journal of Logic and Algebraic Programming\u00a081(7-8), 898\u2013928 (2012); Rewriting Logic and its Applications","journal-title":"Journal of Logic and Algebraic Programming"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/BF01888225","volume":"2","author":"M. Hermann","year":"1990","unstructured":"Hermann, M.: Chain properties of rule closures. Formal Aspects of Computing\u00a02(1), 207\u2013225 (1990)","journal-title":"Formal Aspects of Computing"},{"issue":"2","key":"23_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0743-1066(95)00051-K","volume":"25","author":"G.G. Hillebrand","year":"1995","unstructured":"Hillebrand, G.G., Kanellakis, P.C., Mairson, H.G., Vardi, M.Y.: Undecidable Boundedness Problems for Datalog Programs. Journal of Logic Programming\u00a025(2), 163\u2013190 (1995)","journal-title":"Journal of Logic Programming"},{"key":"23_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/978-3-540-71070-7_32","volume-title":"Automated Reasoning","author":"N. Hirokawa","year":"2008","unstructured":"Hirokawa, N., Moser, G.: Automated Complexity Analysis Based on the Dependency Pair Method. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol.\u00a05195, pp. 364\u2013379. Springer, Heidelberg (2008)"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Knuth, D.E., Bendix, P.: Simple word problems in universal algebras. In: Leech, J. (ed.) Computational Problems in Abstract Algebra, pp. 263\u2013297. Pergamon Press (1970)","DOI":"10.1016\/B978-0-08-012975-4.50028-X"},{"key":"23_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/3-540-45620-1_37","volume-title":"Automated Deduction - CADE-18","author":"C. Lynch","year":"2002","unstructured":"Lynch, C., Morawska, B.: Basic Syntactic Mutation. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, pp. 471\u2013485. Springer, Heidelberg (2002)"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Nieuwenhuis, R., Rubio, A.: Paramodulation-Based Theorem Proving. In: Robinson, J.A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 371\u2013443. Elsevier, MIT Press (2001)","DOI":"10.1016\/B978-044450813-3\/50009-6"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40885-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,3]],"date-time":"2020-08-03T20:18:52Z","timestamp":1596485932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40885-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642408847","9783642408854"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40885-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}