{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:13:23Z","timestamp":1725455603860},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540537090"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0020800","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T06:07:52Z","timestamp":1131862072000},"page":"214-227","source":"Crossref","is-referenced-by-count":3,"title":["Methodology for proving the termination of logic programs"],"prefix":"10.1007","author":[{"given":"Bal","family":"Wang","sequence":"first","affiliation":[]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","first-page":"58","volume":"348","author":"R. Barbuti","year":"1988","unstructured":"Barbuti, R., M. Martelli, A Tool to Check the Non-floundering Logic Programs and Goals, First International Workshop on Programming Languages Implementation and Logic Programming, LNCS 348. pp. 58\u201367. 1988.","journal-title":"LNCS"},{"key":"18_CR2","unstructured":"Cavedon, L., J. W. Lloyd, A Completeness Theorem for SLDNF-resolution, Tech. Report CS-87-06, University of Bristol, 1987."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Clark, K. L., Nergation as Failure, in Symposium on Logic and Data Bases, (Gallaire, H. and J. Minker Eds.), Plenum Press, 1978.","DOI":"10.1007\/978-1-4684-3384-5_11"},{"key":"18_CR4","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., Termination of Rewriting, J. of Symbolic Computation, (1987) 3, pp. 69\u2013116.","journal-title":"J. of Symbolic Computation"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"Drabent, W., J. Maluszynski, Inductive Assertion Method for Logic Programs, J. Theoretical Computer Science, 59 (1988) 133\u2013155.","journal-title":"J. Theoretical Computer Science"},{"key":"18_CR6","first-page":"89","volume":"193","author":"N. Francez","year":"1985","unstructured":"Francez, N., O. Grumberg, S. Katz, A. Pnueli, Proving Termination of Prolog Programs, Proc. of Logics of Programs Conference, Brooklyn NY, LNCS 193, 89\u2013105, 1985.","journal-title":"LNCS"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Floyd, R. M., Assigning Meanings to Programs, Proc. AMS symposium on Applied Mathematics, 19, Providence R.I., 1967.","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Heck, N., J. Avenhaus, On Logic Programs with Data-Driven Computations, LNCS No.225, 1986, 433\u2013443.","DOI":"10.1007\/3-540-15984-3_306"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Kanamori, T., H. Seki, Verification of PROLOG Programs Using an Extension of Execution, Proc. of the Third Intern. Conf. on Logic Programming 1987.","DOI":"10.1007\/3-540-16492-8_96"},{"key":"18_CR10","unstructured":"Kunen, K., Signed Data Dependencies in Logic Programs, Computer Science Technical Report 719 University of Wisconsin \u2014 Madison, 1987."},{"key":"18_CR11","doi-asserted-by":"crossref","unstructured":"Lloyd, J. W., Foundation of Logic Programming,, Springer-Verlag, 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"18_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-09438-9","volume-title":"Priciples of Artificial Intelligence","author":"N. J. Nilsson","year":"1982","unstructured":"Nilsson, N. J., Priciples of Artificial Intelligence, Springer-Verlag, Berlin, 1982."},{"key":"18_CR13","volume-title":"Logic Programming: Functions, Relations, and Equations","author":"U. S. Reddy","year":"1986","unstructured":"Reddy, U. S., On the Relationship between Logic and Functional Languages, in Logic Programming: Functions, Relations, and Equations (Degroot, D. and G. Linstrom, Eds), Prentice-Hall, New Jersey, 1986."},{"key":"18_CR14","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0743-1066(84)90023-2","volume":"1","author":"J. C. Shepherdson","year":"1984","unstructured":"Shepherdson, J. C., Negation as Failure: A Comparison of Clark's Completed Data Base and Reiter's Closed World Assumption, J. Logic Programming, 1984:1:51\u201379.","journal-title":"J. Logic Programming"},{"key":"18_CR15","unstructured":"Vasak, T., J. Potter, Characterisation of Terminating Logic Programs, IEEE Sumposium on Logic Programming, 1986."},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Wang, B., R. K. Shyamasundar. Proving Termination of Logic Programs: A Perspective in Theoretical Computer Science: Commemorative Volume for Gift Siromoney,. World Scientific. pp. 380\u2013397. 1989.","DOI":"10.1142\/9789814368452_0021"},{"key":"18_CR17","volume-title":"Verification, Termination, and Completeness of Logic Programs","author":"B. Wang","year":"1990","unstructured":"Wang, B., Ph.D. Thesis, Verification, Termination, and Completeness of Logic Programs, Computer Science Department, The Pennsylvania State University, University Park, PA, August 1990."}],"container-title":["Lecture Notes in Computer Science","STACS 91"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0020800.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:45:03Z","timestamp":1607550303000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0020800"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540537090"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0020800","relation":{},"subject":[]}}