{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:20Z","timestamp":1725663860036},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539810"},{"type":"electronic","value":"9783540464990"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540539816_66","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:19:25Z","timestamp":1330208365000},"page":"153-180","source":"Crossref","is-referenced-by-count":17,"title":["Proving termination of logic programs by exploiting term properties"],"prefix":"10.1007","author":[{"given":"A.","family":"Bossi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N.","family":"Cocco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Fabris","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"12_CR1","unstructured":"Apt K.R., Bol R.N., Klop J.W., On the safe termination of prolog programs, Proc. ICLP'89, MIT Press, (1989)."},{"key":"12_CR2","unstructured":"Apt K.R., Pedreschi D., Studies in Pure Prolog: Termination, Proc. Symp. on Computational Logic, LNCS (1990)."},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Baudinet M., Proving Termination Properties of Prolog Programs: A Semantic Approach, Proc. IEEE Symp. on Logic in Computer Science, pp. 336\u2013347 (1988).","DOI":"10.1109\/LICS.1988.5131"},{"key":"12_CR4","unstructured":"Bezem M., Characterizing Termination of Logic Programs, Proc. NACLP'89, pp. 69\u201380 (1989)."},{"key":"12_CR5","volume-title":"Graphs and Hypergraphs","author":"C. Berge","year":"1973","unstructured":"Berge C., Graphs and Hypergraphs, North-Holland Mathematical Library, North-Holland, 1973."},{"key":"12_CR6","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-50940-2_30","volume":"2","author":"A. Bossi","year":"1989","unstructured":"Bossi A., Cocco N., Verifying Correctness of Logic Programs, Proc. TAPSOFT'89, Vol. 2, Springer-Verlag, pp. 96\u2013110 (1989).","journal-title":"Proc. TAPSOFT'89"},{"key":"12_CR7","unstructured":"Bossi A., Cocco N., Fabris M., Norms on Terms and Their Use in Proving Universal Termination of Logic Programs, C.N.R. Technical Report on Project \"Sistemi Informatici e Calcolo Parallelo\" (1991)."},{"key":"12_CR8","first-page":"939","volume":"77","author":"K.L. Clark","year":"1977","unstructured":"K.L. Clark, S. Tarnlund, A first order theory of data and programs, Proc. IFIP 77, pp. 939\u2013944 (1977).","journal-title":"Proc. IFIP"},{"key":"12_CR9","unstructured":"Deville Y., Logic Programming. Systematic Program Development, Int. Series in Logic Programming, Addison-Wesley, 1990."},{"key":"12_CR10","unstructured":"Dijkstra E.W., A Discipline of Programming, Prentice-Hall, 1976."},{"key":"12_CR11","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0304-3975(88)90099-0","volume":"59","author":"W. Drabent","year":"1988","unstructured":"Drabent W., Maluszynski J., Inductive Assertion Method for Logic Programs, Theoretical Computer Science, 59, pp. 133\u2013155 (1988).","journal-title":"Theoretical Computer Science"},{"key":"12_CR12","unstructured":"Fabris M., Sulla Terminazione dei Programmi Logici, tesi di laurea, Dip. di Matematica Pura e Applicata, Universit\u00e0 di Padova (1990)."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Floyd R.M., Assigning meaning to programs, Proc. AMS Symp. on Applied Mathematics, Amer. Math. Soc., pp. 19\u201331 (1967).","DOI":"10.1090\/psapm\/019\/0235771"},{"key":"12_CR14","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/3-540-15648-8_8","volume":"193","author":"N. Frances","year":"1985","unstructured":"Frances N., Grumberg O., Katz S., Pnueli A., Proving Termination of Prolog Programs, Proc. Logics of Programs Conf., LNCS 193, pp. 89\u2013105 (1985).","journal-title":"Proc. Logics of Programs Conf., LNCS"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Gries D., The Science of Programming, Springer-Verlag, 1981.","DOI":"10.1007\/978-1-4612-5983-1"},{"key":"12_CR16","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","volume":"12","author":"C.A.R. Hoare","year":"1969","unstructured":"Hoare C.A.R., An axiomatic approach to computer programming, Comm. ACM 12, pp. 576\u2013580, 583 (1969).","journal-title":"Comm. ACM"},{"key":"12_CR17","unstructured":"Hogger C. J., Introduction to Logic Programming, Academic Press, 1984."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, second edition 1987.","DOI":"10.1007\/978-3-642-83189-8"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer L., Termination Proofs for Logic Programs based on Predicate Inequalities, Proc. ICLP'90, pp. 634\u2013648 (1990).","DOI":"10.1007\/3-540-52837-7"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Pl\u00fcmer L., Termination Proofs for Logic Programs, Lecture Notes in Artificial intelligence 446, Springer-Verlag, 1990.","DOI":"10.1007\/3-540-52837-7"},{"issue":"2","key":"12_CR21","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/42282.42285","volume":"35","author":"J.D. Ullman","year":"1988","unstructured":"Ullman J.D., Van Gelder A., Efficient Tests for Top-Down Termination of Logical Rules, JACM, Vol. 35, No. 2, pp. 345\u2013373 (1988).","journal-title":"JACM"},{"key":"12_CR22","unstructured":"Vasak T., Potter J., Characterisation of Terminating Logic Programs, Int. Symp. on Logic Programming '86, IEEE, pp. 140\u2013147 (1986)."},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Wang B., Shryamasunder R.K., Proving Termination of Logic Programs, Internal Report, CS Dept., Penn State University (1989).","DOI":"10.1142\/9789814368452_0021"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Wang B., Shryamasunder R.K., Towards a Characterization of Termination of Logic Programs, Proc. II Int. Workshop on Programming Language Implementation and Logic Programming '90, LNCS 456, pp. 204\u2013221 (1990).","DOI":"10.1007\/BFb0024186"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540539816_66.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:51:38Z","timestamp":1605646298000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540539816_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539810","9783540464990"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3540539816_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}