{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:43:28Z","timestamp":1725468208975},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650126"},{"type":"electronic","value":"9783540497660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056619","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:19:58Z","timestamp":1154247598000},"page":"266-281","source":"Crossref","is-referenced-by-count":3,"title":["A general framework for R-unification problems"],"prefix":"10.1007","author":[{"given":"S\u00e9bastien","family":"Limet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Saubion","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"A. Antoy, R. Echahed, and M. Hanus. A Needed Narrowing Strategy. In Proceedings 21st ACM Symposium on Principle of Programming Languages, Portland, pages 268\u2013279, 1994.","DOI":"10.1145\/174675.177899"},{"key":"16_CR2","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"F. Baader","year":"1993","unstructured":"F. Baader and J. Siekmann. Unification Theory. In D.M. Gabbay, C.J. Hogger, and Robinson J.A., editors, Handbook of Logic in Artificial Intelligence and Logic Programming. Oxford University Press, Oxford, UK, 1993."},{"issue":"1","key":"16_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-1995-24126","volume":"24","author":"A. Bockmayr","year":"1995","unstructured":"A. Bockmayr, S. Krischer, and A. Werner. Narrowing strategies for arbitrary canonical systems. Fundamenta Informaticae, 24(1,2):125\u2013155, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BF01294596","volume":"28","author":"H. Comon","year":"1995","unstructured":"H. Comon. On unification of terms with integer exponents. Math. Systems Theory, 28:67\u201388, 1995.","journal-title":"Math. Systems Theory"},{"key":"16_CR5","unstructured":"H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and M. Tommasi. Tree Automata Techniques and Applications. 1997."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud. Rewrite Systems. In J. Van Leuven, editor, Handbook of Theoretical Computer Science. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"H. Fa\u00dfbender and S. Maneth. A Strict Border for the Decidability of E-Unification for Recursive Functions. In proceedings of the intern. Conf. on Algebraic and Logic Programming., number 1139 in LNCS, pages 194\u2013208. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61735-3_13"},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"M. Hanus. The Integration of Functions into Logic Programming: From Theory to Practice. Journal of Logic Programming, 19 & 20:583\u2013628, May\/July 1994.","journal-title":"Journal of Logic Programming"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"M. Hanus. A unified computation model for functional and logic programming. In Proc. 24st ACM Symposium on Principles of Programming Languages (POPL'97), pages 80\u201393, 1997.","DOI":"10.1145\/263699.263710"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"M. Hermann and R. Galbav\u00fd. Unification of infinite sets of terms schematized by primal grammars. Theoretical Computer Science, 176, 1997.","DOI":"10.1016\/S0304-3975(96)00052-7"},{"key":"16_CR11","first-page":"69","volume":"1","author":"S. Limet","year":"1997","unstructured":"S. Limet and P. R\u00e9ty. E-Unification by Means of Tree Tuple Synchronized Grammars. Discrete Mathematics and Theoritical Computer Science (http:\/\/www.chapmanhall.com\/dm), 1:69\u201398, 1997.","journal-title":"Discrete Mathematics and Theoritical Computer Science"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"S. Limet and P. R\u00e9ty. Solving Disequations modulo some Class of Rewrite System. In Proceedings of 9th Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, pages 121\u2013135. Springer-Verlag, 1998.","DOI":"10.1007\/BFb0052365"},{"key":"16_CR13","unstructured":"A. Middeldorp, S. Okui, and T. Ida. Lazy Narrowing: Strong Completeness and Eager Variable Elimination. In procedings of the 20th Colloquium on Trees in Algebra and Programming, LNCS, 1995."},{"key":"16_CR14","volume-title":"Phd thesis","author":"S. Mitra","year":"1994","unstructured":"S. Mitra. Semantic Unification for Convergent Rewrite Systems. Phd thesis, Univ. Illinois at Urbana-Champaign, 1994."},{"key":"16_CR15","volume-title":"Technical Report 57-97","author":"R. Caballero Rold n","year":"1997","unstructured":"R. Caballero Rold n, P. L pez Fraguas, and S nchez Hern ndez J.. User's manual for toy. Technical Report 57-97, Departamento de Sistemas Inform ticos y Programaci n, Facultad de Matem ticas (UCM), Madrid, 1997."}],"container-title":["Lecture Notes in Computer Science","Principles of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056619","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,17]],"date-time":"2020-04-17T17:20:47Z","timestamp":1587144047000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056619"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650126","9783540497660"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0056619","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}