{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:57:39Z","timestamp":1762459059706,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381966"},{"type":"electronic","value":"9783642381973"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38197-3_10","type":"book-chapter","created":{"date-parts":[[2013,4,17]],"date-time":"2013-04-17T07:53:41Z","timestamp":1366185221000},"page":"137-154","source":"Crossref","is-referenced-by-count":3,"title":["Computing More Specific Versions of Conditional Rewriting Systems"],"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","reference":[{"issue":"1","key":"10_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\u00a020(1), 3\u201326 (2002)","journal-title":"New Generation Computing"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/978-3-540-74130-5_15","volume-title":"Implementation and Application of Functional Languages","author":"J.M. Almendros-Jim\u00e9nez","year":"2007","unstructured":"Almendros-Jim\u00e9nez, J.M., Vidal, G.: Automatic partial inversion of inductively sequential functions. In: Horv\u00e1th, Z., Zs\u00f3k, V., Butterfield, A. (eds.) IFL 2006. LNCS, vol.\u00a04449, pp. 253\u2013270. Springer, Heidelberg (2007)"},{"key":"10_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/11799573_9","volume-title":"Logic Programming","author":"S. Antoy","year":"2006","unstructured":"Antoy, S., Hanus, M.: Overlapping rules and logic variables in functional logic programs. In: Etalle, S., Truszczy\u0144ski, M. (eds.) ICLP 2006. LNCS, vol.\u00a04079, pp. 87\u2013101. Springer, Heidelberg (2006)"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/3-540-51081-8_99","volume-title":"Rewriting Techniques and Applications","author":"H. Bertling","year":"1989","unstructured":"Bertling, H., Ganzinger, H.: Completion-time optimization of rewrite-time goal solving. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 45\u201358. Springer, Heidelberg (1989)"},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-60381-6_4","volume-title":"Conditional and Typed Rewriting Systems","author":"A. Bockmayr","year":"1995","unstructured":"Bockmayr, A., Werner, A.: LSE narrowing for decreasing conditional term rewrite systems. In: Dershowitz, N., Lindenstrauss, N. (eds.) CTRS 1994. LNCS, vol.\u00a0968, pp. 51\u201370. Springer, Heidelberg (1995)"},{"key":"10_CR7","first-page":"27","volume-title":"Proceedings of the International Workshop on Partial Evaluation and Mixed Computation","author":"A. Bondorf","year":"1988","unstructured":"Bondorf, A.: Towards a self-applicable partial evaluator for term rewriting systems. In: Bj\u00f8rner, D., Ershov, A., Jones, N. (eds.) Proceedings of the International Workshop on Partial Evaluation and Mixed Computation, pp. 27\u201350. North-Holland, Amsterdam (1988)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/3-540-50940-2_29","volume-title":"TAPSOFT \u201989. Proceedings of the International Joint Conference on Theory and Practice of Software Development Barcelona, Spain, March 13-17, 1989","author":"A. Bondorf","year":"1989","unstructured":"Bondorf, A.: A self-applicable partial evaluator for term rewriting systems. In: D\u00edaz, J., Orejas, F. (eds.) TAPSOFT 1989. LNCS, vol.\u00a0352, pp. 81\u201395. Springer, Heidelberg (1989)"},{"key":"10_CR9","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(88)90095-3","volume":"59","author":"P. Bosco","year":"1988","unstructured":"Bosco, P., Giovannetti, E., Moiso, C.: Narrowing vs. SLD-resolution. Theoretical Computer Science\u00a059, 3\u201323 (1988)","journal-title":"Theoretical Computer Science"},{"issue":"1&2","key":"10_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. Journal of Symbolic Computation\u00a03(1&2), 69\u2013115 (1987)","journal-title":"Journal of Symbolic Computation"},{"key":"10_CR11","series-title":"Formal Models and Semantics","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science. Formal Models and Semantics, vol.\u00a0B, pp. 243\u2013320. Elsevier, Amsterdam (1990)"},{"key":"10_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":"1","key":"10_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0304-3975(90)90105-Q","volume":"89","author":"H. Ganzinger","year":"1991","unstructured":"Ganzinger, H.: Order-sorted completion: The many-sorted way. Theoretical Computer Science\u00a089(1), 3\u201332 (1991)","journal-title":"Theoretical Computer Science"},{"key":"10_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1007\/978-3-540-40018-9_17","volume-title":"Programming Languages and Systems","author":"R. Gl\u00fcck","year":"2003","unstructured":"Gl\u00fcck, R., Kawabe, M.: A program inverter for a functional language with equality and constructors. In: Ohori, A. (ed.) APLAS 2003. LNCS, vol.\u00a02895, pp. 246\u2013264. Springer, Heidelberg (2003)"},{"issue":"4","key":"10_CR15","first-page":"367","volume":"66","author":"R. Gl\u00fcck","year":"2005","unstructured":"Gl\u00fcck, R., Kawabe, M.: A method for automatic program inversion based on LR(0) parsing. Fundamenta Informaticae\u00a066(4), 367\u2013395 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"10_CR16","doi-asserted-by":"crossref","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":"10_CR17","first-page":"153","volume-title":"Proceedings of the International Workshop on Partial Evaluation and Mixed Computation","author":"P.G. Harrison","year":"1988","unstructured":"Harrison, P.G.: Function inversion. In: Proceedings of the International Workshop on Partial Evaluation and Mixed Computation, pp. 153\u2013166. North-Holland, Amsterdam (1988)"},{"key":"10_CR18","series-title":"LNAI","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0015791","volume-title":"Foundations of Equational Logic Programming","author":"S. H\u00f6lldobler","year":"1989","unstructured":"H\u00f6lldobler, S.: Foundations of Equational Logic Programming. LNCS (LNAI), vol.\u00a0353. Springer, Heidelberg (1989)"},{"key":"10_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1007\/3-540-10009-1_25","volume-title":"Automated Deduction","author":"J.-M. Hullot","year":"1980","unstructured":"Hullot, J.-M.: Canonical forms and unification. In: Bibel, W., Kowalski, R.A. (eds.) Automated Deduction. LNCS, vol.\u00a087, pp. 318\u2013334. Springer, Heidelberg (1980)"},{"key":"10_CR20","unstructured":"Kawabe, M., Futamura, Y.: Case studies with an automatic program inversion system. In: Proceedings of the 21st Conference of Japan Society for Software Science and Technology, 6C-3, 5 pages (2004)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-540-30557-6_17","volume-title":"Practical Aspects of Declarative Languages","author":"M. Kawabe","year":"2005","unstructured":"Kawabe, M., Gl\u00fcck, R.: The program inverter LRinv and its structure. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2004. LNCS, vol.\u00a03350, pp. 219\u2013234. Springer, Heidelberg (2005)"},{"key":"10_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/3-540-51081-8_139","volume-title":"Rewriting Techniques and Applications","author":"H. Khoshnevisan","year":"1989","unstructured":"Khoshnevisan, H., Sephton, K.M.: InvX: An automatic function inverter. In: Dershowitz, N. (ed.) RTA 1989. LNCS, vol.\u00a0355, pp. 564\u2013568. Springer, Heidelberg (1989)"},{"key":"10_CR23","unstructured":"Marchiori, M.: On deterministic conditional rewriting. Technical Report MIT-LCS-TM-405, MIT Laboratory for Computer Science (1997), http:\/\/www.w3.org\/People\/Massimo\/papers\/MIT-LCS-TM-405.pdf"},{"key":"10_CR24","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/BF01531082","volume":"1","author":"K. Marriott","year":"1990","unstructured":"Marriott, K., Naish, L., Lassez, J.-L.: Most specific logic programs. Annals of Mathematics and Artificial Intelligence\u00a01, 303\u2013338 (1990), http:\/\/www.springerlink.com\/content\/k3p11kl316m73764\/","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"10_CR25","unstructured":"Middeldorp, A., Hamoen, E.: Completeness results for basic narrowing. Applicable Algebra in Engineering, Communication and Computing"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.entcs.2009.03.034","volume":"237","author":"N. Nishida","year":"2009","unstructured":"Nishida, N., Sakai, M.: Completion after program inversion of injective functions. Electronic Notes in Theoretical Computer Science\u00a0237, 39\u201356 (2009)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"issue":"8","key":"10_CR27","first-page":"1171","volume":"J88-D-I","author":"N. Nishida","year":"2005","unstructured":"Nishida, N., Sakai, M., Sakabe, T.: Generation of inverse computation programs of constructor term rewriting systems. IEICE Transactions on Information and Systems\u00a0J88-D-I(8), 1171\u20131183 (2005) (in Japanese)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"10_CR28","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.\u00a03467, pp. 264\u2013278. Springer, Heidelberg (2005)"},{"key":"10_CR29","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. Leibniz International Proceedings in Informatics, vol.\u00a010, pp. 283\u2013298. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2011)"},{"key":"10_CR30","unstructured":"Nishida, N., Vidal, G.: Conversion to first-order tail recursion for improving program inversion (2012) (submitted for publication)"},{"key":"10_CR31","unstructured":"Nishida, N., Vidal, G.: More specific term rewriting systems. In: The 21st International Workshop on Functional and (Constraint) Logic Programming, Nagoya, Japan (2012), Informal proceedings http:\/\/www.dsic.upv.es\/~gvidal\/german\/wflp12\/paper.pdf"},{"key":"10_CR32","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, UK (2002)"},{"key":"10_CR33","doi-asserted-by":"crossref","unstructured":"Pfenning, F.: Unification and anti-unification in the calculus of constructions. In: Proceedings of the Sixth Annual Symposium on Logic in Computer Science, pp. 74\u201385. IEEE Computer Society (1991)","DOI":"10.1109\/LICS.1991.151632"},{"key":"10_CR34","first-page":"73","volume":"7","author":"G. Plotkin","year":"1972","unstructured":"Plotkin, G.: Building-in equational theories. Machine Intelligence\u00a07, 73\u201390 (1972)","journal-title":"Machine Intelligence"},{"key":"10_CR35","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":"10_CR36","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1145\/321850.321859","volume":"21","author":"J.R. Slagle","year":"1974","unstructured":"Slagle, J.R.: Automated theorem-proving for theories with simplifiers, commutativity and associativity. Journal of the ACM\u00a021(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-642-38197-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,30]],"date-time":"2025-04-30T05:21:29Z","timestamp":1745990489000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38197-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381966","9783642381973"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38197-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}