{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:58:41Z","timestamp":1725663521091},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543176"},{"type":"electronic","value":"9783540475583"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3-540-54317-1_110","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:41:03Z","timestamp":1330209663000},"page":"417-423","source":"Crossref","is-referenced-by-count":1,"title":["An universal termination condition for solving goals in equational languages"],"prefix":"10.1007","author":[{"given":"G.","family":"Aguzzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Modigliani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. C.","family":"Verri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,2]]},"reference":[{"key":"34_CR1","unstructured":"G. Aguzzi and M. C. Verri, \u201dOn the Termination of a Unification Procedure\u201d, in Proceedings of 3rd Italian Conference on Theoretical Computer Science, World Scientific, 1989."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"G. Aguzzi and M. C. Verri, \u201dOn the termination of an algorithm for unification in equational theories\u201d, in Proceedings of IEEE TENCON '89, pp. 1034\u20131039","DOI":"10.1109\/TENCON.1989.177107"},{"key":"34_CR3","unstructured":"G. Aguzzi and M.C. Verri, \u201d A class of terminating logic programs\u201d, R.T. 2\/90, D.S.I., Univ. of Florence, 1990."},{"key":"34_CR4","doi-asserted-by":"crossref","unstructured":"M. Baudinet, \u201dProving Termination Properties of Prolog Programs: a Semantic Approach\u201d, 3rd Annual Symp. on Logic in Computer Science, Edimburg, 1988, pp. 336\u2013347.","DOI":"10.1109\/LICS.1988.5131"},{"key":"34_CR5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0304-3975(82)90026-3","volume":"17","author":"N. Dershowitz","year":"1982","unstructured":"N. Dershowitz, \u201dOrderings for Term Rewriting Systems\u201d, Theor. Comp. Sci. vol. 17, 1982, pp. 279\u2013301.","journal-title":"Theor. Comp. Sci."},{"key":"34_CR6","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-15976-2_9","volume":"202","author":"N. Dershowitz","year":"1985","unstructured":"N. Dershowitz, \u201dTermination\u201d, Lecture Notes in Computer Science, vol.202, 1985, pp. 180\u2013224.","journal-title":"Lecture Notes in Computer Science"},{"key":"34_CR7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/3-540-19242-5_4","volume":"308","author":"N. Dershowitz","year":"1988","unstructured":"N. Dershowitz and G. Sivakumar, \u201dSolving Goals in Equational Languages\u201d, Lecture Notes in Computer Science vol. 308, Springer Verlag, 1988, pp 45\u201355.","journal-title":"Lecture Notes in Computer Science"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J. P. Jouannaud, Handbook of Theoretical Computer Science chapter Rewrite Systems. Volume B, North Holland, 1990 (to appear).","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"34_CR9","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0743-1066(87)90002-1","volume":"4","author":"M. Dincbas","year":"1987","unstructured":"M. Dincbas and P. Van Hentenryck, \u201dExtended Unification Algorithms for the Integration of Functional Programming into Logic Programming\u201d, J. Logic Programming, vol. 4, 1987, pp 199\u2013227.","journal-title":"J. Logic Programming"},{"key":"34_CR10","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1007\/3-540-17220-3_19","volume":"256","author":"J. H. Gallier","year":"1987","unstructured":"J. H. Gallier and W. Snyder, \u201dA General Complete E-Unification Procedure\u201d, Lecture Notes in Computer Science vol. 256, Springer Verlag, 1987, pp. 216\u2013227.","journal-title":"Lecture Notes in Computer Science"},{"key":"34_CR11","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1016\/B978-0-12-115350-2.50017-8","volume-title":"Formal Language Theory: Perspectives and open problems","author":"G. Huet","year":"1980","unstructured":"G. Huet and D.C. Oppen, \u201dEquations and rewrite rules: A survey\u201d, in Formal Language Theory: Perspectives and open problems, R. Book Ed., Academic Press, New York, 1980, pp. 349\u2013405."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"J-M. Hullot, \u201dCanonical Forms and Unification\u201d, in Proceedings of the 5th Conference on Automated Deduction, 1980, pp. 318\u2013334.","DOI":"10.21236\/ADA087640"},{"issue":"4","key":"34_CR13","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1109\/32.4670","volume":"14","author":"B. Jayaraman","year":"1988","unstructured":"B. Jayaraman, \u201dSemantics of EqL\u201d, IEEE Transactions on Software Engineering, vol. 14, n. 4, april 1988, pp 472\u2013480.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"34_CR14","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(87)80010-X","volume":"4","author":"S. Kaplan","year":"1987","unstructured":"S. Kaplan, \u201dSimplifying Conditional Term Rewriting Systems: Unification, Termination and Confluence\u201d, J. Symbolic Computation, 4, 1987, pp. 295\u2013334.","journal-title":"J. Symbolic Computation"},{"key":"34_CR15","first-page":"180","volume-title":"3rd IEEE Symp. on Logic Programming","author":"A. Martelli","year":"1986","unstructured":"A. Martelli, C. Moiso and G. F. Rossi, \u201dAn Algorithm for Unification in Equational Theories\u201d, 3rd IEEE Symp. on Logic Programming, Salt Lake City, Utah, 1986, pp. 180\u2013186."},{"issue":"2","key":"34_CR16","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"A. Martelli and U. Montanari, \u201dAn Efficient Unification Algorithm\u201d, ACM Transaction on Programming Languages and Systems, 4, 2, 1982, pp 258\u2013282.","journal-title":"ACM Transaction on Programming Languages and Systems"},{"key":"34_CR17","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-19242-5_14","volume":"308","author":"M. Okada","year":"1988","unstructured":"M. Okada, \u201dA logical analysis on theory of conditional rewriting\u201d, Lecture Notes in Computer Science vol. 308, Springer Verlag, 1988, pp 179\u2013196.","journal-title":"Lecture Notes in Computer Science"},{"key":"34_CR18","unstructured":"U. S. Reddy, \u201dNarrowing as the Operational Semantics of Functional Languages\u201d, in Proceedings on Logic Progr., IEEE, 1985, pp. 138\u2013151."},{"key":"34_CR19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J. A. Robinson","year":"1965","unstructured":"J. A. Robinson, \u201dA Machine-Oriented Logic Based on the Resolution Principle\u201d, J. ACM vol. 12, 1965, pp. 23\u201341.","journal-title":"J. ACM"},{"key":"34_CR20","first-page":"140","volume-title":"3rd IEEE Symp. on Logic Programming","author":"T. Vasak","year":"1986","unstructured":"T. Vasak and J. Potter, \u201dCharacterization of terminating logic programs\u201d, 3rd IEEE Symp. on Logic Programming, Salt Lake City, Utah, 1986, pp. 140\u2013147."}],"container-title":["Lecture Notes in Computer Science","Conditional and Typed Rewriting Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-54317-1_110.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:53:32Z","timestamp":1605646412000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-54317-1_110"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543176","9783540475583"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-54317-1_110","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}