{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:59Z","timestamp":1725456059241},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354055789X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023769","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T10:11:10Z","timestamp":1132395070000},"page":"213-226","source":"Crossref","is-referenced-by-count":6,"title":["A transformational methodology for proving termination of logic programs"],"prefix":"10.1007","author":[{"given":"M. R. K.","family":"Krishna Rao","sequence":"first","affiliation":[]},{"given":"D.","family":"Kapur","sequence":"additional","affiliation":[]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"F. Alexandre, K. Bsaics and A. Quere (1991) On using mode input-output for transforming logic programs, Workshop on Logic Program Synthesis and Transformations LOPSTR'91. Proceedings to appear in Springer Workshops in Computer Science series.","DOI":"10.1007\/978-1-4471-3494-7_11"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"K.R. Apt and D. Pedreschi (1991), Reasoning about Termination of Prolog Programs, Technical Report, University of Pisa.","DOI":"10.1007\/3-540-54415-1_50"},{"key":"16_CR3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF03037115","volume":"3","author":"J.S. Conery","year":"1985","unstructured":"J.S. Conery and D.F. Kibler (1985), AND parallelism and Nondeterminism in Logic Programs, New Generation Computing, 3, pp. 43\u201370.","journal-title":"New Generation Computing"},{"key":"16_CR4","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0743-1066(88)90010-6","volume":"5","author":"S. K. Debray","year":"1988","unstructured":"S. K. Debray and D. S. Warren (1988), Automatic mode inference for logic programs, Journal of Logic Programming 5, pp. 207\u2013229.","journal-title":"Journal of Logic Programming"},{"key":"16_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"N. Dershowitz (1987), Termination of rewriting, Journal of Symbolic Computation, 3, pp. 69\u2013116.","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"N. Dershowitz and J.-P. Jouannaud (1990), Rewrite Systems, In J. van Leeuwen, editor, Handbook of Theoretical Computer Science D: Formal Methods and Semantics, North-Holland, pp. 243\u2013320.","DOI":"10.1016\/B978-0-444-88074-1.50011-1"},{"key":"16_CR7","unstructured":"H. Jifeng and C. A. R. Iloare (1989), Operational Semantics for ProCoS level 0 language, ProCoS Project Document, OU IIJ F 1\/3, Oxford University."},{"key":"16_CR8","unstructured":"H. Jifeng, P. Pandya and J. Bowen (1990), Compiling specification for ProCoS Programming language Level 0, ProCoS Workshop, Malente, April 1990."},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"D. Kapur and Il. Zhang (1989), An Overview of Rewrite Rule Laboratory (RRL), Proc. of Rewrite Techniques and Applications, Springer-Verlag LNCS 355, pp 559\u2013563.","DOI":"10.1007\/3-540-51081-8_138"},{"key":"16_CR10","volume-title":"Technical report","author":"M.R.K. Krishna Rao","year":"1991","unstructured":"M.R.K. Krishna Rao, D. Kapur and R.K. Shyamasundar (1991), A Transformational Methodology for Proving termination of Logic Programs (extended version), Technical report, Tata Institute of Fundamental Research, Bombay 400 005, India."},{"key":"16_CR11","volume-title":"Technical report","author":"M. R. K. Krishna Rao","year":"1992","unstructured":"M. R. K. Krishna Rao, R. K. Shyamasundar and P. Pandya (1992), Termination proof for ProCoS level 0 language PL 0 compiler, technical report, Tata Institute of Fundamental Research, Bombay, India (in preparation)."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd (1987), Foundations of Logic Programming, Springer-Verlag.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"16_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-52837-7","volume-title":"Termination Proofs for Logic Programs","author":"Lutz Pl\u00fcmer","year":"1990","unstructured":"L. Pl\u00fcmer (1990), Termination proofs for Logic Programs, Ph. D. thesis, University of Dortmund, Also appears as Springer Verlag LNCS vol. 446."},{"key":"16_CR14","unstructured":"R. K. Shyamasundar, M. R. K. Krishna Rao and D. Kapur (1992), Rewriting Concepts in the Study of Termination of Logic Programs, Proc. ALPUK'92 Conf., London, April 1992."},{"issue":"2","key":"16_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"J.D. Ullman and A. van Gelder (1988), Efficient Tests for Top-Down Termination of Logical Rules, JACM, 35(2), pp. 345\u2013373.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0023769","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T01:49:45Z","timestamp":1586569785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023769"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354055789X"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0023769","relation":{},"subject":[]}}