{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T18:05:42Z","timestamp":1648749942669},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["New Gener Comput"],"published-print":{"date-parts":[[1998,12]]},"DOI":"10.1007\/bf03037431","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T02:51:25Z","timestamp":1240541485000},"page":"397-433","source":"Crossref","is-referenced-by-count":0,"title":["How to realize LSE narrowing"],"prefix":"10.1007","volume":"16","author":[{"given":"Andreas","family":"Werner","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Bockmayr","sequence":"additional","affiliation":[]},{"given":"Stefan","family":"Krischer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037431_CR1","doi-asserted-by":"crossref","unstructured":"A\u00eft-Kaci, H.,Warren\u2019s Abstract Machine: A Tutorial Reconstruction, MIT Press, 1991.","DOI":"10.7551\/mitpress\/7160.001.0001"},{"key":"BF03037431_CR2","doi-asserted-by":"crossref","unstructured":"Bockmayr, A., Krischer, S., and Werner, A., \u201cAn Optimal Narrowing Strategy for General Canonical Systems,\u201d inConditional Term Rewriting Systems, CTRS 1992, Pont-\u00e0-Mousson, France,LNCS 656, Springer-Verlag, pp. 483\u2013497, 1993.","DOI":"10.1007\/3-540-56393-8_39"},{"issue":"1 &2","key":"BF03037431_CR3","doi-asserted-by":"crossref","first-page":"125","DOI":"10.3233\/FI-1995-24126","volume":"24","author":"A. Bockmayr","year":"1995","unstructured":"Bockmayr, A., Krischer, S., and Werner, A., \u201cNarrowing Strategies for Arbitrary Canonical Systems,\u201dFundamenta Informaticae, 24, 1 &2, pp. 125\u2013156, 1995.","journal-title":"Fundamenta Informaticae"},{"key":"BF03037431_CR4","doi-asserted-by":"crossref","unstructured":"Bockmayr, A. and Werner, A. \u201cLSE Narrowing for Decreasing Conditional Term Rewrite Systems,\u201d inConditional and Typed Rewriting Systems, CTRS-1994, Jerusalem, Israel,LNCS 968, Springer-Verlag, pp. 51\u201370, 1995.","DOI":"10.1007\/3-540-60381-6_4"},{"key":"BF03037431_CR5","first-page":"244","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N. and Jouannaud, J. P., \u201cRewrite Systems,\u201d inHandbook of Theoretical Computer Science, Volume B, Chapter 6, Elsevier Science Publishers, North-Holland, pp. 244\u2013320, 1990."},{"key":"BF03037431_CR6","unstructured":"DeGroot, D. and Lindstrom, G.,Logic Programming. Functions, Relations, and Equations, Prentice Hall, 1986."},{"key":"BF03037431_CR7","unstructured":"Gollner, M., \u201cImplicit, Explicit and Consistent-Explicit Basic-Indexing,\u201d inImplementation of Logical-Functional Languages, Internet Bericht 10\/92, Fakult\u00e4t f\u00fcr Informatik, University of Karlsruhe, 1993."},{"key":"BF03037431_CR8","unstructured":"Gollner, M., \u201cEine abstrakte Maschine f\u00fcr das logisch-funktionale Programmieren,\u201dPh.D. thesis, University of Karlsruhe, 1996."},{"key":"BF03037431_CR9","doi-asserted-by":"crossref","unstructured":"Hanus, M., \u201cEffcient Implementation of Narrowing and Rewriting,\u201dProc. International Workshop on Processing Declarative Knowledge, Kaiserslautern,LNAI 567, Springer-Verlag, pp. 344\u2013365, 1991.","DOI":"10.1007\/BFb0013543"},{"issue":"20","key":"BF03037431_CR10","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19","author":"M. Hanus","year":"1994","unstructured":"Hanus, M., \u201cThe Integration of Functions into Logic Programming: From Theory to Practice,\u201dJournal of Logic Programming, 19 &20, pp. 583\u2013628, 1994.","journal-title":"Journal of Logic Programming"},{"key":"BF03037431_CR11","unstructured":"Herold, A, \u201cNarrowing Techniques Applied to Idempotent Unification,\u201dSEKI Report, SR-86-16, Universit\u00e4t Kaiserslautern, 1986."},{"key":"BF03037431_CR12","unstructured":"H\u00f6lldobler, S., \u201cFrom Paramodulation to Narrowing,\u201d inProc. 5th International Conference and Symposium on Logic Programming, Seattle, MIT Press, pp. 327\u2013342, 1988."},{"key":"BF03037431_CR13","unstructured":"Huet, G. and Levi, J.J., \u201cComputations in Orthogonal Rewriting Systems,\u201d inComputational Logic: Essays in Honor of Alan Robinson (J. L. Lassez and G. Plotkin), MIT Press, pp. 395\u2013443, 1991."},{"key":"BF03037431_CR14","doi-asserted-by":"crossref","unstructured":"Huet, G. and Oppen, D. C., \u201cEquations and Rewrite Rules: A Survey,\u201d inFormal Languages: Perspectives and Open Problems (R. Book, ed.), Academic Press, pp. 349\u2013405, 1980.","DOI":"10.1016\/B978-0-12-115350-2.50017-8"},{"key":"BF03037431_CR15","doi-asserted-by":"crossref","unstructured":"Hullot, J. M., \u201cCanonical Forms and Unification,\u201dProceedings of the 5th Conference on Automated Deduction, Les Ares, France,LNCS 87, Springer-Verlag, pp. 318\u2013334, 1980.","DOI":"10.21236\/ADA087640"},{"key":"BF03037431_CR16","unstructured":"Krischer, S.,Vergleich und Bewertung von Narrowing-Strategien, Diplomarbeit, Fakult\u00e4t f\u00fcr Informatik, University of Karlsruhe, 1990."},{"key":"BF03037431_CR17","doi-asserted-by":"crossref","unstructured":"Krischer, S. and Bockmayr, A., \u201cDetecting Redundant Narrowing Derivations by the LSE-SL Reducibility Test,\u201dProceedings of the 4th Conference on Rewriting Techniques and Applications, RTA 1991, Como, Italy,LNCS 488, Springer-Verlag, pp. 74\u201385, 1991.","DOI":"10.1007\/3-540-53904-2_87"},{"key":"BF03037431_CR18","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/S0747-7171(89)80014-8","volume":"7","author":"W. Nutt","year":"1989","unstructured":"Nutt, W., R\u00e9ty, P., and Smolka, G., \u201cBasic Narrowing Revisited,\u201dJournal of Symbolic Computation, 7, pp. 295\u2013317, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"BF03037431_CR19","doi-asserted-by":"crossref","unstructured":"R\u00e9ty, P., \u201cImproving Basic Narrowing Techniques,\u201d inProc. 2nd Conference on Rewriting Techniques and Applications, RTA 1987, Bordeaux, France,LNCS 256, Springer-Verlag, pp. 228\u2013241, 1987.","DOI":"10.1007\/3-540-17220-3_20"},{"key":"BF03037431_CR20","unstructured":"R\u00e9ty, P., \u201cM\u00e9thodes d\u2019 Unification par Surr\u00e9duction,\u201dPh.D. thesis, Universit\u00e9 de Nancy, 1988."},{"key":"BF03037431_CR21","doi-asserted-by":"crossref","unstructured":"R\u00e9ty, P., Kirchner, C., Kirchner, H. and Lescanne, P., \u201cNARROWER: A New Algorithm for Unifications and Its Application to Logic Programming,\u201dProc. of the Ist Conference on Rewriting Techniques and Applications, RTA 1985, Dijon, France,LNCS 202, Springer-Verlag, pp. 141\u2013157, 1985.","DOI":"10.1007\/3-540-15976-2_7"},{"key":"BF03037431_CR22","unstructured":"Warren, D. H., \u201cAn Abstract PROLOG Instruction Set,\u201dTechnical Report, 309, Artificial Intelligence Center, SRJ International, 1983."},{"key":"BF03037431_CR23","doi-asserted-by":"crossref","unstructured":"Werner, A., Bockmayr, A., and Krischer, S., \u201cHow to Realize LSE Narrowing,\u201d inAlgebraic and Logic Programming, Madrid,ALP\u201994, Springer-Verlag.,LNCS 850, pp. 59\u201376, 1994.","DOI":"10.1007\/3-540-58431-5_7"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037431.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037431\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037431","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T18:27:15Z","timestamp":1589740035000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037431"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":23,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["BF03037431"],"URL":"https:\/\/doi.org\/10.1007\/bf03037431","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}