{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:08Z","timestamp":1725566648090},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_21","type":"book-chapter","created":{"date-parts":[[2010,9,28]],"date-time":"2010-09-28T00:20:02Z","timestamp":1285633202000},"page":"279-293","source":"Crossref","is-referenced-by-count":8,"title":["Natural Narrowing for General Term Rewriting Systems"],"prefix":"10.1007","author":[{"given":"Santiago","family":"Escobar","sequence":"first","affiliation":[]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[]},{"given":"Prasanna","family":"Thati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BFb0013825","volume-title":"Algebraic and Logic Programming","author":"S. Antoy","year":"1992","unstructured":"Antoy, S.: Definitional trees. In: Kirchner, H., Levi, G. (eds.) ALP 1992. LNCS, vol.\u00a0632, pp. 143\u2013157. Springer, Heidelberg (1992)"},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1145\/773184.773205","volume-title":"Proc. of PPDP 2001","author":"S. Antoy","year":"2001","unstructured":"Antoy, S.: Constructor-based conditional narrowing. In: Proc. of PPDP 2001, pp. 199\u2013206. ACM, New York (2001)"},{"key":"21_CR3","first-page":"138","volume-title":"Proc. of ICLP 1997","author":"S. Antoy","year":"1997","unstructured":"Antoy, S., Echahed, R., Hanus, M.: Parallel evaluation strategies for functional logic languages. In: Proc. of ICLP 1997, pp. 138\u2013152. MIT Press, Cambridge (1997)"},{"issue":"4","key":"21_CR4","doi-asserted-by":"publisher","first-page":"776","DOI":"10.1145\/347476.347484","volume":"47","author":"S. Antoy","year":"2000","unstructured":"Antoy, S., Echahed, R., Hanus, M.: A needed narrowing strategy. Journal of the ACM\u00a047(4), 776\u2013822 (2000)","journal-title":"Journal of the ACM"},{"key":"21_CR5","series-title":"ENTCS","volume-title":"Proc. of WFLP 2002","author":"S. Antoy","year":"2002","unstructured":"Antoy, S., Lucas, S.: Demandness in rewriting and narrowing. In: Proc. of WFLP 2002. ENTCS, vol.\u00a076, Elsevier, Amsterdam (2002)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0304-3975(01)00358-9","volume":"285","author":"P. Borovansk\u00fd","year":"2002","unstructured":"Borovansk\u00fd, P., Kirchner, C., Kirchner, H., Moreau, P.-E.: ELAN from a rewriting logic point of view. Theoretical Computer Science\u00a0285, 155\u2013185 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/S0304-3975(01)00359-0","volume":"285","author":"M. Clavel","year":"2002","unstructured":"Clavel, M., Dur\u00e1n, F., Eker, S., Lincoln, P., Mart\u00ed-Oliet, N., Meseguer, J., Quesada, J.: Maude: specification and programming in rewriting logic. Theoretical Computer Science\u00a0285, 187\u2013243 (2002)","journal-title":"Theoretical Computer Science"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1016\/B978-044450813-3\/50016-3","volume-title":"Handbook of Automated Reasoning","author":"H. Comon","year":"2001","unstructured":"Comon, H.: Inductionless induction. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a01, pp. 913\u2013962. Elsevier, Amsterdam (2001)"},{"issue":"1\/2","key":"21_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1006\/inco.2000.2875","volume":"159","author":"H. Comon","year":"2000","unstructured":"Comon, H., Nieuwenhuis, R.: Induction = I-Axiomatization + First-Order Consistency. Information and Computation\u00a0159(1\/2), 151\u2013186 (2000)","journal-title":"Information and Computation"},{"key":"21_CR10","doi-asserted-by":"crossref","DOI":"10.1142\/3163","volume-title":"Language Prototyping: An Algebraic Specification Approach","author":"A. Deursen","year":"1996","unstructured":"Deursen, A., Heering, J., Klint, P.: Language Prototyping: An Algebraic Specification Approach. World Scientific, Singapore (1996)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1145\/888251.888263","volume-title":"Proc. of PPDP 2003","author":"S. Escobar","year":"2003","unstructured":"Escobar, S.: Refining weakly outermost-needed rewriting and narrowing. In: Proc. of PPDP 2003, pp. 113\u2013123. ACM, New York (2003)"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/978-3-540-24754-8_12","volume-title":"Functional and Logic Programming","author":"S. Escobar","year":"2004","unstructured":"Escobar, S.: Implementing natural rewriting and narrowing efficiently. In: Kameyama, Y., Stuckey, P.J. (eds.) FLOPS 2004. LNCS, vol.\u00a02998, pp. 147\u2013162. Springer, Heidelberg (2004)"},{"key":"21_CR13","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Natural narrowing as a general unified mechanism for programming and proving. Technical Report DSIC-II\/16\/04, DSIC, Universidad Polit\u00e9cnica de Valencia (2004), Available at http:\/\/www.dsic.upv.es\/users\/elp\/papers.html"},{"key":"21_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/11506676_7","volume-title":"Logic Based Program Synthesis and Transformation","author":"S. Escobar","year":"2005","unstructured":"Escobar, S., Meseguer, J., Thati, P.: Natural rewriting for general term rewriting systems. In: Etalle, S. (ed.) LOPSTR 2004. LNCS, vol.\u00a03573, pp. 101\u2013116. Springer, Heidelberg (2005) (to appear)"},{"key":"21_CR15","series-title":"Lecture Notes in Computer Science","first-page":"161","volume-title":"5th Conference on Automated Deduction","author":"M. Fay","year":"1980","unstructured":"Fay, M.: First order unification in equational theories. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 161\u2013167. Springer, Heidelberg (1980)"},{"key":"21_CR16","series-title":"AMAST Series","volume-title":"CafeOBJ Report","author":"K. Futatsugi","year":"1998","unstructured":"Futatsugi, K., Diaconescu, R.: CafeOBJ Report. AMAST Series. World Scientific, Singapore (1998)"},{"issue":"2","key":"21_CR17","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/0022-0000(91)90009-T","volume":"42","author":"E. Giovannetti","year":"1991","unstructured":"Giovannetti, E., Levi, G., Moiso, C., Palamidessi, C.: Kernel Leaf: A Logic plus Functional Language. Journal of Computer and System Sciences\u00a042(2), 139\u2013185 (1991)","journal-title":"Journal of Computer and System Sciences"},{"key":"21_CR18","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-1-4757-6541-0_1","volume-title":"Software Engineering with OBJ: Algebraic Specification in Action","author":"J. Goguen","year":"2000","unstructured":"Goguen, J., Winkler, T., Meseguer, J., Futatsugi, K., Jouannaud, J.-P.: Introducing OBJ. In: Software Engineering with OBJ: Algebraic Specification in Action, pp. 3\u2013167. Kluwer, Dordrecht (2000)"},{"issue":"1","key":"21_CR19","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0743-1066(98)10029-8","volume":"40","author":"J.C. Gonz\u00e1lez-Moreno","year":"1999","unstructured":"Gonz\u00e1lez-Moreno, J.C., Hortal\u00e1-Gonz\u00e1lez, M.T., L\u00f3pez-Fraguas, F.J., Rodr\u00edguez-Artalejo, M.: An approach to declarative programming based on a rewriting logic. Journal of Logic Programming\u00a040(1), 47\u201387 (1999)","journal-title":"Journal of Logic Programming"},{"key":"21_CR20","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/0743-1066(94)90034-5","volume":"19&20","author":"M. Hanus","year":"1994","unstructured":"Hanus, M.: The integration of functions into logic programming: From theory to practice. Journal of Logic Programming\u00a019&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"issue":"1","key":"21_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0020-0190(98)00016-7","volume":"67","author":"M. Hanus","year":"1998","unstructured":"Hanus, M., Lucas, S., Middeldorp, A.: Strongly sequential and inductively sequential term rewriting systems. Information Processing Letters\u00a067(1), 1\u20138 (1998)","journal-title":"Information Processing Letters"},{"key":"21_CR22","first-page":"395","volume-title":"Computational logic: Essays in honour of J. Alan Robinson","author":"G. Huet","year":"1992","unstructured":"Huet, G., L\u00e9vy, J.-J.: Computations in Orthogonal Term Rewriting Systems, Part I + II. In: Computational logic: Essays in honour of J. Alan Robinson, pp. 395\u2013414, 415\u2013443. MIT Press, Cambridge (1992)"},{"key":"21_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"5th Conference on Automated Deduction","author":"J. Hullot","year":"1980","unstructured":"Hullot, J.: Canonical forms and unification. In: Bibel, W. (ed.) CADE 1980. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"21_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BFb0036921","volume-title":"Automata, Languages and Programming","author":"J.-P. Jouannaud","year":"1983","unstructured":"Jouannaud, J.-P., Kirchner, C., Kirchner, H.: Incremental construction of unification algorithms in equational theories. In: D\u00edaz, J. (ed.) ICALP 1983. LNCS, vol.\u00a0154, pp. 361\u2013373. Springer, Heidelberg (1983)"},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1007\/3-540-57186-8_79","volume-title":"Programming Language Implementation and Logic Programming","author":"R. Loogen","year":"1993","unstructured":"Loogen, R., L\u00f3pez-Fraguas, F., Rodr\u00edguez-Artalejo, M.: A Demand Driven Computation Strategy for Lazy Narrowing. In: Penjam, J., Bruynooghe, M. (eds.) PLILP 1993. LNCS, vol.\u00a0714, pp. 184\u2013200. Springer, Heidelberg (1993)"},{"issue":"1","key":"21_CR26","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/S0890-5401(02)93176-7","volume":"178","author":"S. Lucas","year":"2002","unstructured":"Lucas, S.: Context-sensitive rewriting strategies. Information and Computation\u00a0178(1), 294\u2013343 (2002)","journal-title":"Information and Computation"},{"key":"21_CR27","first-page":"1","volume-title":"Handbook of Philosophical Logic","author":"N. Mart\u00ed-Oliet","year":"2001","unstructured":"Mart\u00ed-Oliet, N., Meseguer, J.: Rewriting logic as a logical and semantic framework. In: Handbook of Philosophical Logic, vol.\u00a09, pp. 1\u201388. Kluwer, Dordrecht (2001)"},{"issue":"1","key":"21_CR28","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/0304-3975(92)90182-F","volume":"96","author":"J. Meseguer","year":"1992","unstructured":"Meseguer, J.: Conditional rewriting logic as a unified model of concurrency. Theoretical Computer Science\u00a096(1), 73\u2013155 (1992)","journal-title":"Theoretical Computer Science"},{"key":"21_CR29","series-title":"ENTCS","first-page":"153","volume-title":"Proc. of WRLA 2004","author":"J. Meseguer","year":"2004","unstructured":"Meseguer, J., Thati, P.: Symbolic reachability analysis using narrowing and its application to analysis of cryptographic protocols. In: Proc. of WRLA 2004. ENTCS, vol.\u00a0117, pp. 153\u2013182. Elsevier, Amsterdam (2004)"},{"key":"21_CR30","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1145\/263699.263711","volume-title":"Proc. of POPL 1997","author":"A. Middeldorp","year":"1997","unstructured":"Middeldorp, A.: Call by Need Computations to Root-Stable Form. In: Proc. of POPL 1997, pp. 94\u2013105. ACM, New York (1997)"},{"key":"21_CR31","first-page":"473","volume-title":"Proc. of LICS 1996","author":"R. Nieuwenhuis","year":"1996","unstructured":"Nieuwenhuis, R.: Basic paramodulation and decidable theories. In: Proc. of LICS 1996, pp. 473\u2013483. IEEE Computer Society, Los Alamitos (1996)"},{"issue":"1","key":"21_CR32","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1993.1026","volume":"104","author":"R. Sekar","year":"1993","unstructured":"Sekar, R., Ramakrishnan, I.: Programming in equational logic: Beyond strong sequentiality. Information and Computation\u00a0104(1), 78\u2013109 (1993)","journal-title":"Information and Computation"},{"volume-title":"Term Rewriting Systems","year":"2003","key":"21_CR33","unstructured":"TeReSe (ed.): Term Rewriting Systems. Cambridge University Press, Cambridge (2003)"},{"key":"21_CR34","doi-asserted-by":"crossref","unstructured":"Thati, P., Meseguer, J.: Complete symbolic reachability analysis using backand-forth narrowing (2005) (submitted for publication.)","DOI":"10.1007\/11548133_24"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:33:58Z","timestamp":1605760438000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}