{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T16:44:05Z","timestamp":1725813845127},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319141244"},{"type":"electronic","value":"9783319141251"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-14125-1_4","type":"book-chapter","created":{"date-parts":[[2014,12,10]],"date-time":"2014-12-10T12:03:10Z","timestamp":1418212990000},"page":"54-71","source":"Crossref","is-referenced-by-count":1,"title":["A Finite Representation of the Narrowing Space"],"prefix":"10.1007","author":[{"given":"Naoki","family":"Nishida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Germ\u00e1n","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,11]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF03037257","volume":"20","author":"E Albert","year":"2002","unstructured":"Albert, E., Vidal, G.: The Narrowing-Driven Approach to Functional Logic Program Specialization. New Generation Computing 20(1), 3\u201326 (2002)","journal-title":"New Generation Computing"},{"issue":"4","key":"4_CR2","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1145\/291891.291896","volume":"20","author":"M Alpuente","year":"1998","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Partial Evaluation of Functional Logic Programs. ACM Transactions on Programming Languages and Systems 20(4), 768\u2013844 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/3-540-58431-5_8","volume-title":"Algebraic and Logic Programming","author":"M Alpuente","year":"1994","unstructured":"Alpuente, M., Falaschi, M., Vidal, G.: Compositional Analysis for Equational Horn Programs. In: Rodr\u00edguez-Artalejo, M., Levi, G. (eds.) ALP 1994. LNCS, vol. 850, pp. 77\u201394. Springer, Heidelberg (1994)"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0033833","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"S Antoy","year":"1997","unstructured":"Antoy, S., Ariola, Z.: Narrowing the Narrowing Space. In: Hartel, P.H., Kuchen, H. (eds.) PLILP 1997. LNCS, vol. 1292, pp. 1\u201315. Springer, Heidelberg (1997)"},{"issue":"1\u20132","key":"4_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236(1\u20132), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/3-540-60939-3_17","volume-title":"Logic Program Synthesis and Transformation","author":"T Arts","year":"1996","unstructured":"Arts, T., Zantema, H.: Termination of Logic Programs Using Semantic Unification. In: Proietti, M. (ed.) LOPSTR 1995. LNCS, vol. 1048, pp. 219\u2013233. Springer, Heidelberg (1996)"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"4_CR8","unstructured":"Bae, K., Escobar, S., Meseguer, J.: Abstract Logical Model Checking of Infinite-State Systems Using Narrowing. In: Proceedings of the 24th International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 21, pp. 81\u201396. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2013)"},{"issue":"2&3","key":"4_CR9","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/S0743-1066(99)00030-8","volume":"41","author":"D Schreye De","year":"1999","unstructured":"De Schreye, D., Gl\u00fcck, R., J\u00f8rgensen, J., Leuschel, M., Martens, B., S\u00f8rensen, M.: Conjunctive partial deduction: foundations, control, algorihtms, and experiments. Journal of Logic Programming 41(2&3), 231\u2013277 (1999)","journal-title":"Journal of Logic Programming"},{"issue":"1\u20132","key":"4_CR10","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.tcs.2006.08.035","volume":"367","author":"S Escobar","year":"2006","unstructured":"Escobar, S., Meadows, C., Meseguer, J.: A rewriting-based inference system for the NRL Protocol Analyzer and its meta-logical properties. Theoretical Computer Science 367(1\u20132), 162\u2013202 (2006)","journal-title":"Theoretical Computer Science"},{"key":"4_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/978-3-540-73449-9_13","volume-title":"Term Rewriting and Applications","author":"S Escobar","year":"2007","unstructured":"Escobar, S., Meseguer, J.: Symbolic Model Checking of Infinite-State Systems Using Narrowing. In: Baader, F. (ed.) RTA 2007. LNCS, vol. 4533, pp. 153\u2013168. Springer, Heidelberg (2007)"},{"key":"4_CR12","unstructured":"Fribourg, L.: SLOG: A Logic Programming Language Interpreter Based on Clausal Superposition and Rewriting. In: Proceedings of the Symposium on Logic Programming, pp. 172\u2013185. IEEE Press (1985)"},{"issue":"34","key":"4_CR13","doi-asserted-by":"publisher","first-page":"4405","DOI":"10.1016\/j.tcs.2011.04.028","volume":"412","author":"I Gnaedig","year":"2011","unstructured":"Gnaedig, I., Kirchner, H.: Proving weak properties of rewriting. Theoretical Computer Science 412(34), 4405\u20134438 (2011)","journal-title":"Theoretical Computer Science"},{"key":"4_CR14","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 19&20, 583\u2013628 (1994)","journal-title":"Journal of Logic Programming"},{"key":"4_CR15","unstructured":"Hanus, M. (ed.): Curry: An integrated functional logic language (vers. 0.8.3) (2012). \n                    http:\/\/www.curry-language.org"},{"key":"4_CR16","unstructured":"Hermenegildo, M., Rossi, F.: On the Correctness and Efficiency of Independent And-Parallelism in Logic Programs. In: Lusk, E., Overbeck, R. (eds.) Proceedings of the 1989 North American Conf. on Logic Programming, pp. 369\u2013389. The MIT Press, Cambridge (1989)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","volume-title":"Foundations of Equational Logic Programming","year":"1989","unstructured":"H\u00f6lldobler, S. (ed.): Foundations of Equational Logic Programming. LNCS, vol. 353. Springer, Heidelberg (1989)"},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.entcs.2004.06.024","volume":"117","author":"J Meseguer","year":"2005","unstructured":"Meseguer, J., Thati, P.: Symbolic Reachability Analysis Using Narrowing and its Application to Verification of Cryptographic Protocols. Electronic Notes in Theoretical Computer Science 117, 153\u2013182 (2005)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"6","key":"4_CR19","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1006\/jsco.1997.0197","volume":"25","author":"A Middeldorp","year":"1998","unstructured":"Middeldorp, A., Okui, S.: A Deterministic Lazy Narrowing Calculus. Journal of Symbolic Computation 25(6), 733\u2013757 (1998)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR20","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Generation of Inverse Computation Programs of Constructor Term Rewriting Systems. IEICE Transactions on Information and Systems J88\u2013D\u2013I(8), 1171\u20131183 (2005) (in Japanese)"},{"key":"4_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1007\/978-3-540-32033-3_20","volume-title":"Term Rewriting and Applications","author":"N Nishida","year":"2005","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Partial Inversion of Constructor Term Rewriting Systems. In: Giesl, J. (ed.) RTA 2005. LNCS, vol. 3467, pp. 264\u2013278. Springer, Heidelberg (2005)"},{"key":"4_CR22","unstructured":"Nishida, N., Vidal, G.: Program inversion for tail recursive functions. In: Schmidt-Schau\u00df, M. (ed.) Proceedings of the 22nd International Conference on Rewriting Techniques and Applications. LIPIcs, vol. 10, pp. 283\u2013298. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-38197-3_10","volume-title":"Logic-Based Program Synthesis and Transformation","author":"N Nishida","year":"2013","unstructured":"Nishida, N., Vidal, G.: Computing More Specific Versions of Conditional Rewriting Systems. In: Albert, E. (ed.) LOPSTR 2012. LNCS, vol. 7844, pp. 137\u2013154. Springer, Heidelberg (2013)"},{"issue":"3\/4","key":"4_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/S0747-7171(89)80014-8","volume":"7","author":"W Nutt","year":"1989","unstructured":"Nutt, W., R\u00e9ty, P., Smolka, G.: Basic Narrowing Revisited. Journal of Symbolic Computation 7(3\/4), 295\u2013317 (1989)","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3661-8","volume-title":"Advanced Topics in Term Rewriting","author":"E Ohlebusch","year":"2002","unstructured":"Ohlebusch, E.: Advanced Topics in Term Rewriting. Springer, London, UK (2002)"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/BFb0032046","volume-title":"Automata, Languages and Programming","author":"C Palamidessi","year":"1990","unstructured":"Palamidessi, C.: Algebraic Properties of Idempotent Substitutions. In: Paterson, M. (ed.) ICALP 1990. LNCS, vol. 443, pp. 386\u2013399. Springer, Heidelberg (1990)"},{"key":"4_CR27","doi-asserted-by":"crossref","unstructured":"Ramos, J.G., Silva, J., Vidal, G.: Fast Narrowing-Driven Partial Evaluation for Inductively Sequential Systems. In: Danvy, O., Pierce, B.C. (eds.) Proceedings of the 10th ACM SIGPLAN International Conference on Functional Programming, pp. 228\u2013239. ACM Press (2005)","DOI":"10.1145\/1090189.1086394"},{"issue":"4","key":"4_CR28","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"JR Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM 21(4), 622\u2013642 (1974)","journal-title":"Journal of the ACM"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-14125-1_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T00:31:51Z","timestamp":1559089911000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-14125-1_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319141244","9783319141251"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-14125-1_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}