{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:20:18Z","timestamp":1725456018034},"publisher-location":"Berlin\/Heidelberg","reference-count":18,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354053010X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0024186","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T09:49:34Z","timestamp":1132393774000},"page":"204-221","source":"Crossref","is-referenced-by-count":2,"title":["Towards a characterization of termination of logic programs"],"prefix":"10.1007","author":[{"given":"B.","family":"Wang","sequence":"first","affiliation":[]},{"given":"R. K.","family":"Shyamasundar","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Apt, K. R., R. N. Bol, and J. W. Klop, On the Safe Termination of PROLOG programs, Proc. of the Sixth Intern. Conf. on Logic Programming, pp. 353\u2013368, 1989."},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/B978-0-934613-40-8.50006-3","volume-title":"Foundations of Deductive Databases and Logic Programming","author":"R. K. Apt","year":"1988","unstructured":"Apt, R. K., H. Blair, and A. Walker, Towards a Theory of Declarative Knowledge, in Foundations of Deductive Databases and Logic Programming, (Minker, J. Ed.), pp. 89\u2013148, Morgan Kaufmann, Los Altos, 1988"},{"key":"15_CR3","first-page":"58","volume":"348","author":"R. Barbuti","year":"1988","unstructured":"Barbuti, R. and M. Martelli, A Tool to Check the Non-floundering Logic Programs and Goals, Programming Languages Implementation and Logic Programming, LNCS 348. pp. 58\u201367. 1988.","journal-title":"LNCS"},{"key":"15_CR4","unstructured":"Cavedon, L. and J. W. Lloyd, A Completeness Theorem for SLDNF-resolution, Tech. Report CS-87-06, University of Bristol, 1987."},{"key":"15_CR5","unstructured":"Cavedon, L., Continuity, Consistency, and Completeness Properties for Logic Programs, Proc. of the Sixth Intern. Conf. on Logic Programming, pp. 353\u2013368, 1989."},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Clark, K. L., Negation 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":"15_CR7","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":"15_CR8","first-page":"89","volume":"193","author":"N. Francez","year":"1985","unstructured":"Francez, N., O. Grumberg, S. Katz, and A. Pnueli, Proving Termination of Prolog Programs, Proc. of Logics of Programs Conference, Brooklyn NY, LNCS 193, 89\u2013105, 1985.","journal-title":"LNCS"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Heck, N. and J. Avenhaus, On Logic Programs with Data-Driven Computations, LNCS No.225, 1986, 433\u2013443.","DOI":"10.1007\/3-540-15984-3_306"},{"key":"15_CR10","unstructured":"Kunen, K., Signed Data Dependencies in Logic Programs, Computer Science Technical Report 719 University of Wisconsin-Madison, 1987."},{"key":"15_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":"15_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":"15_CR13","doi-asserted-by":"crossref","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":"15_CR14","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0743-1066(85)90018-4","volume":"3","author":"J. C. Shepherdson","year":"1985","unstructured":"Shepherdson, J. C., Negation as Failure. II, J. Logic Programming, 1985:3:185\u2013202.","journal-title":"J. Logic Programming"},{"issue":"2","key":"15_CR15","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1145\/42282.42285","volume":"35","author":"J. D. Ullman","year":"1988","unstructured":"Ullman, J. D. and A. van Gelder, Efficient Tests for Top-Down Termination of Logical Rules, JACM, Vol. 35, No. 2, April 1988, pp. 69\u2013116.","journal-title":"JACM"},{"key":"15_CR16","unstructured":"Vasak, T., J. Potter, Characterisation of Terminating Logic Programs, IEEE Sumposium on Logic Programming, 1986."},{"key":"15_CR17","unstructured":"Wang, B. and R. K. Shyamasundar, Methodolgy for Proving Termination of Logic Programs, Tech. Report CS-90-19, Pennsylvania State University, 1990."},{"key":"15_CR18","unstructured":"Wang, B. and R. K. Shyamasundar, Static Analysis of Logic Programs for Characterization of Termination of Logic Programs, Tech. Report CS-90-20, Pennsylvania State University, 1990."}],"container-title":["Lecture Notes in Computer Science","Programming Language Implementation and Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024186.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:52:15Z","timestamp":1607550735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024186"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354053010X"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0024186","relation":{},"subject":[]}}