{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:40:37Z","timestamp":1710283237280},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1992,3,1]],"date-time":"1992-03-01T00:00:00Z","timestamp":699408000000},"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":[[1992,3]]},"DOI":"10.1007\/bf03037527","type":"journal-article","created":{"date-parts":[[2009,4,24]],"date-time":"2009-04-24T03:18:32Z","timestamp":1240543112000},"page":"47-79","source":"Crossref","is-referenced-by-count":50,"title":["A general criterion for avoiding infinite unfolding during partial deduction"],"prefix":"10.1007","volume":"11","author":[{"given":"Maurice","family":"Bruynooghe","sequence":"first","affiliation":[]},{"given":"Danny","family":"De Schreye","sequence":"additional","affiliation":[]},{"given":"Bern","family":"Martens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF03037527_CR1","doi-asserted-by":"crossref","unstructured":"Apt, K. R. and Pedreschi, D., \u201cStudies in Pure Prolog: Termination,\u201dProc. Esprit Symposium on Computational Logic (J. W. Lloyd, ed.), pp. 150\u2013176, 1990.","DOI":"10.1007\/978-3-642-76274-1_9"},{"key":"BF03037527_CR2","series-title":"Technical Report, TR-89-04","volume-title":"A Procedure for the Partial Evaluation of Logic Programs","author":"K. Benkerimi","year":"1989","unstructured":"Benkerimi, K. and Lloyd, J. W., \u201cA Procedure for the Partial Evaluation of Logic Programs,\u201dTechnical Report, TR-89-04, Department of Computer Science, University of Bristol, Great-Britain, 1989."},{"key":"BF03037527_CR3","unstructured":"Benkerimi, K. and Lloyd, J. W., \u201cA Procedure for the Partial Evaluation of Logic Programs,\u201dProc. NACLP90 (S. Debray and M. Hermenegildo, eds.), pp. 343\u2013358, 1990."},{"key":"BF03037527_CR4","unstructured":"Bezem, M., \u201cCharacterising Termination of Logic Programs with Level Mappings,\u201dProc. NACLP89 (E. L. Lusk and R. A. Overbeek, eds.), pp. 69\u201380, 1989. Revised version will appear inJournal of Logic Programming."},{"key":"BF03037527_CR5","volume-title":"Loop Checking in Logic Programming","author":"R. N. Bol","year":"1991","unstructured":"Bol, R. N., \u201cLoop Checking in Logic Programming,\u201dPh.D. thesis, CWI, Amsterdam, 1991."},{"key":"BF03037527_CR6","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., De Schreye, D. and Krekels, B., \u201cCompiling Control,\u201dJournal of Logic Programming, pp. 135\u2013162, 1989.","DOI":"10.1016\/0743-1066(89)90033-2"},{"key":"BF03037527_CR7","unstructured":"Burt, A. D., Hill, P. M. and Lloyd, J. W., \u201cPreliminary Report on the Logic Programming Language G\u00f6del,\u201dTechnical Report, TR-90-02, Computer Science Department, University of Bristol, March 1990. Revised Oct. 1990."},{"key":"BF03037527_CR8","unstructured":"Cavedon, L., \u201cContinuity, Consistency, and Completeness Properties for Logic Programs,\u201dProc. ICLP89 (G. Levi and M. Martelli, eds.), pp. 571\u2013584, 1989."},{"key":"BF03037527_CR9","unstructured":"Chan, D. and Wallace, M., \u201cA Treatment of Negation during Partial Evaluation,\u201d inMeta-Programming in Logic Programming (H. D. Abramson and M. H. Rogers, eds.),Proc. Meta88, MIT Press, pp. 299\u2013318, 1989."},{"key":"BF03037527_CR10","doi-asserted-by":"crossref","unstructured":"De Schreye, D. and Bruynooghe, M., \u201cOn the Transformation of Logic Programs with Instantiation Based Computation Rules,\u201dJ. Symbolic Computation, pp. 125\u2013154, 1989.","DOI":"10.1016\/S0747-7171(89)80046-X"},{"key":"BF03037527_CR11","doi-asserted-by":"crossref","unstructured":"De Schreye, D., Verschaetse, K. and Bruynooghe, M., \u201cA Framework for Analysing the Termination of Definite Logic Programs,\u201d inProc. FGCS92, 1992.","DOI":"10.1007\/3-540-56282-6_5"},{"key":"BF03037527_CR12","doi-asserted-by":"crossref","unstructured":"Dershowitz, N. and Manna, Z., \u201cProving Termination with Multiset Orderings,\u201dCommunications of the ACM,22,8, Aug. 1979.","DOI":"10.1145\/359138.359142"},{"key":"BF03037527_CR13","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N., \u201cTermination of Rewriting,\u201dJournal of Symbolic Computation, 3, pp. 69\u2013116, 1987.","journal-title":"Journal of Symbolic Computation"},{"key":"BF03037527_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-0357-2","volume-title":"First-Order Logic and Automated Theorem Proving","author":"M. Fitting","year":"1990","unstructured":"Fitting, M.First-Order Logic and Automated Theorem Proving, Springer-Verlag, New York, 1990."},{"key":"BF03037527_CR15","series-title":"Proc. Symp. in Applied Math.","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/psapm\/019\/0235771","volume-title":"Assigning Meanings to Programs","author":"R. W. Floyd","year":"1967","unstructured":"Floyd, R. W., \u201cAssigning Meanings to Programs,\u201dProc. Symp. in Applied Math., 19, Amer. Math. Soc., Providence, R. I., pp. 19\u201332, 1967."},{"issue":"2\u20133","key":"BF03037527_CR16","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF03037133","volume":"6","author":"H. Fujita","year":"1988","unstructured":"Fujita, H. and Furukawa, K., \u201cA Self-Applicable Partial Evaluator and Its Use in Incremental Compilation,\u201dNew Generation Computing, 6, 2\u20133, pp. 91\u2013118, 1988.","journal-title":"New Generation Computing"},{"key":"BF03037527_CR17","unstructured":"Gallagher, J., \u201cTransforming Logic Programs by Specializing Interpreters,\u201dProc. 7th European Conference on Artificial Intelligence, pp. 109\u2013122, 1986."},{"key":"BF03037527_CR18","doi-asserted-by":"crossref","unstructured":"Gallagher, J. and Bruynooghe, M., \u201cThe Derivation of an Algorithm for Program Specialization,\u201d inProc. ICLP90 (D. H. D. Warren and P. Szeredi, eds.), pp. 732\u2013746, 1990. Revised version inNew Generation Computing, 9, 3\u20134, pp. 305\u2013334, 1991.","DOI":"10.1007\/BF03037167"},{"key":"BF03037527_CR19","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1007\/BF01806312","volume":"2","author":"N. D. Jones","year":"1989","unstructured":"Jones, N. D., Sestoft, P. and Sondergaard, H., \u201cMIX: A Self-Applicable Partial Evaluator for Experiments in Compiler Generation,\u201dLisp and Symbolic Computation 2, pp. 9\u201350, 1989.","journal-title":"Lisp and Symbolic Computation"},{"key":"BF03037527_CR20","unstructured":"Komorowski, H. J., \u201cA Specification of an Abstract Prolog Machine and Its Application to Partial Evaluation,\u201dTechnical Report, LSST69, Linkoping University, 1981."},{"key":"BF03037527_CR21","volume-title":"Synthesis of Programs in the Framework of Partial Deduction","author":"H. J. Komorowski","year":"1989","unstructured":"Komorowski, H. J., \u201cSynthesis of Programs in the Framework of Partial Deduction,\u201dSer. A, No. 81, Departments of Computer Science and Mathematics, Abo Akademi, Finland, 1989."},{"key":"BF03037527_CR22","doi-asserted-by":"crossref","unstructured":"Lakhotia, A. and Sterling, L., \u201cDevelopment of a Prolog Partial Evaluation System,\u201d inThe Practice of Prolog (L. Sterling, ed.), MIT Press, 1990.","DOI":"10.7551\/mitpress\/5510.001.0001"},{"issue":"2\u20133","key":"BF03037527_CR23","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF03037139","volume":"6","author":"G. Levi","year":"1988","unstructured":"Levi, G. and Sardu, G., \u201cPartial Evaluation of Metaprograms in a Multiple Worlds Logic Language,\u201dNew Generation Computing, 6, 2\u20133, pp. 227\u2013247, 1988.","journal-title":"New Generation Computing"},{"issue":"3\u20134","key":"BF03037527_CR24","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0743-1066(91)90027-M","volume":"11","author":"J. W. Lloyd","year":"1991","unstructured":"Lloyd, J. W. and Shepherdson, J. C., \u201cPartial Evaluation in Logic Programming,\u201dJ. Logic Programming, 11, 3\u20134, pp. 217\u2013242, 1991.","journal-title":"J. Logic Programming"},{"key":"BF03037527_CR25","unstructured":"Manna, Z. and Ness, S., \u201cOn the Termination of Markov Algorithms,\u201d inProc. 3rd Hawaii Int. Conf. on Syst. Sci., Honolulu, Hawaii, pp. 784\u2013792, 1970."},{"key":"BF03037527_CR26","unstructured":"Martens, B., De Schreye, D. and Bruynooghe, M., \u201cSound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures,\u201d inProc. FGCS92, 1992."},{"key":"BF03037527_CR27","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer, L., \u201cTermination Proofs of Logic Programs,\u201dLNCS446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"key":"BF03037527_CR28","unstructured":"Safra, S. and Shapiro, E., \u201cMeta Interpreters for Real,\u201dProceedings of IFIP86 (H.-J. Kugler, ed.), pp. 271\u2013278, 1986."},{"key":"BF03037527_CR29","unstructured":"Sahlin, D., \u201cThe Mixtus Approach to Automatic Partial Evaluation of Full Prolog,\u201dProc. NACLP90 (S. Debray and M. Hermenegildo, eds.), pp. 377\u2013398, 1990."},{"key":"BF03037527_CR30","unstructured":"Smith, D. A. and Hickey, T. J., \u201cPartial Evaluation of a CLP Language,\u201dProc. NACLP90 (S. Debray and M. Hermenegildo, eds.), pp. 119\u2013138, 1990."},{"key":"BF03037527_CR31","unstructured":"Sterling, L. and Beer, R. D., \u201cIncremental Flavor-Mixing of Meta-Interpreters for Expert System Construction,\u201dProc. 1986 Symp. on Logic Programming, IEEE Comp. Society Press, pp. 20\u201327, 1986."},{"issue":"1\u20132","key":"BF03037527_CR32","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0743-1066(89)90034-4","volume":"6","author":"L. Sterling","year":"1989","unstructured":"Sterling, L. and Beer, R. D., \u201cMetainterpreters for Expert System Construction,\u201dJ. Logic Programming, 6, 1\u20132, pp. 163\u2013178, 1989.","journal-title":"J. Logic Programming"},{"key":"BF03037527_CR33","unstructured":"Takeuchi, A. and Furukawa, K., \u201cPartial Evaluation of Prolog Programs and Its Application to Metaprogramming,\u201dProceedings of IFIP86 (H.-J. Kugler, ed.), pp. 415\u2013420, 1986."},{"issue":"2","key":"BF03037527_CR34","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"Ullman, J. D. and Van Gelder, A., \u201cEfficient Tests for Top-Down Termination of Logical Rules,\u201dJ. ACM, 35, 2, pp. 345\u2013373, 1988.","journal-title":"J. ACM"},{"key":"BF03037527_CR35","doi-asserted-by":"crossref","unstructured":"Van Harmelen, F., \u201cThe Limitations of Partial Evaluation,\u201d inLogic-Based Knowledge Representation (P. Jackson, H. Reichgelt and F. Van Harmelen, eds.), MIT Press, 1989.","DOI":"10.1007\/BFb0015938"},{"key":"BF03037527_CR36","first-page":"91","volume-title":"ECAI-84: Advances in Artificial Intelligence","author":"R. Venken","year":"1984","unstructured":"Venken, R., \u201cA Prolog. Meta Interpreter for Partial Evaluation and Its Application to Source to Source Transformation and Query Optimization,\u201d inECAI-84: Advances in Artificial Intelligence, North-Holland, Pisa, pp. 91\u2013100, 1984."},{"issue":"2\u20133","key":"BF03037527_CR37","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF03037142","volume":"6","author":"R. Venken","year":"1988","unstructured":"Venken, R. and Demoen, B., \u201cA Partial Evaluation System for Prolog: Some Practical Considerations,\u201dNew Generation Computing, 6, 2\u20133, pp. 279\u2013290, 1988.","journal-title":"New Generation Computing"},{"key":"BF03037527_CR38","volume-title":"Internal report","author":"L. U. Yalcinalp","year":"1990","unstructured":"Yalcinalp, L. U., Sterling, L., Lakhotia, A. and Bansal, A., \u201cThe COMPOSERS\u2019 Guide to Meta-Programming,\u201d inInternal report, Department of Computer Engineering and Science, Case Western Reserve University, Cleveland, Ohio, USA, 1990."}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037527.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF03037527\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF03037527","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T22:03:32Z","timestamp":1710281012000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF03037527"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,3]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1992,3]]}},"alternative-id":["BF03037527"],"URL":"https:\/\/doi.org\/10.1007\/bf03037527","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,3]]}}}