{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T19:10:03Z","timestamp":1736709003660,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540665403"},{"type":"electronic","value":"9783540481645"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10704567_20","type":"book-chapter","created":{"date-parts":[[2006,12,28]],"date-time":"2006-12-28T23:27:08Z","timestamp":1167348428000},"page":"328-341","source":"Crossref","is-referenced-by-count":3,"title":["Localizing and Explaining Reasons for Non-terminating Logic Programs with Failure-Slices"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Neumerkel","sequence":"first","affiliation":[]},{"given":"Fred","family":"Mesnard","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"crossref","unstructured":"Bol, R.N.: Loop Checking in Logic Programming. Thesis, Univ. Amsterdam (1991)","DOI":"10.1007\/BFb0018437"},{"key":"20_CR2","unstructured":"Byrd, L.: Understanding the control flow of Prolog programs. In: Logic Programming Workshop, Debrecen, Hungary (1980)"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BFb0033845","volume-title":"Programming Languages: Implementations, Logics, and Programs","author":"M. Carlsson","year":"1997","unstructured":"Carlsson, M., Ottosson, G., Carlson, B.: An Open-Ended Finite Domain Constraint Solver. In: Glaser, H., Hartel, P., Kuchen, H. (eds.) PLILP 1997. LNCS, vol.\u00a01292, pp. 191\u2013206. Springer, Heidelberg (1997)"},{"key":"20_CR4","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3345.001.0001","volume-title":"A Grammatical View of Logic Programming.","author":"P. Deransart","year":"1993","unstructured":"Deransart, P., Maluszynski, J.: A Grammatical View of Logic Programming. MIT-Press, Cambridge (1993)"},{"key":"20_CR5","unstructured":"Gyimothy, T., Paakki, J.: Static slicing of logic programs. In: Ducasse, M. (ed.) AADEBUG 1995. IRISA-CNRS, pp. 87\u2013103 (1995)"},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Termination Proofs for Logic Programs","author":"R.A. O\u2019Keefe","year":"1990","unstructured":"O\u2019Keefe, R.A.: The Craft of Prolog. In: Pl\u00fcmer, L. (ed.) Termination Proofs for Logic Programs. LNCS, vol.\u00a0446. Springer, Heidelberg (1990)"},{"key":"20_CR7","series-title":"LNAI","volume-title":"Termination Proofs for Logic Programs","year":"1990","unstructured":"Pl\u00fcmer, L. (ed.): Termination Proofs for Logic Programs. LNCS (LNAI), vol.\u00a0446. Springer, Heidelberg (1990)"},{"key":"20_CR8","unstructured":"Vasak, T., Potter, J.: Characterization of Termination Logic Programs, IEEE SLP, pp. 140\u2013147 (1986)"},{"key":"20_CR9","first-page":"7","volume-title":"JICSLP 1996","author":"F. Mesnard","year":"1996","unstructured":"Mesnard, F.: Inferring Left-terminating Classes of Queries for Constraint Logic Programs. In: Maher, M. (ed.) JICSLP 1996, pp. 7\u201321. MIT-Press, Cambridge (1996)"},{"key":"20_CR10","unstructured":"Mesnard, F., Hoarau, S.: A tabulation algorithm for CLP. In: Proc. of the 1st International Workshop on Tabling in Logic Programming, Leuven (1997) Revised report www.univreunion.fr\/~gcc"},{"key":"20_CR11","unstructured":"Neumerkel, U.: Mathematische Logik und logikorientierte Programmierung, Skriptum zur Labor\u00fcbung (1993\u20131997)"},{"key":"20_CR12","unstructured":"Neumerkel, U.: Teaching Prolog and CLP. Tutorial. PAP (1995) Paris, 1995 and ICLP 1997 Leuven (1997)"},{"key":"20_CR13","unstructured":"Neumerkel, U.: GUPU: A Prolog course environment and its programming methodology. In: Fuchs, N., Geske, U. (eds.) Proc. of the Poster Session at JICSLP 1996, GMD-Studien Nr. 296, Bonn (1996)"},{"key":"20_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-61739-6_50","volume-title":"Static Analysis","author":"S. Schoenig","year":"1996","unstructured":"Schoenig, S., Ducass\u00e9, M.: A Backward Slicing Algorithm for Prolog. In: Cousot, R., Schmidt, D.A. (eds.) SAS 1996. LNCS, vol.\u00a01145, pp. 317\u2013331. Springer, Heidelberg (1996)"},{"issue":"7","key":"20_CR15","doi-asserted-by":"crossref","first-page":"446","DOI":"10.1145\/358557.358577","volume":"25","author":"M. Weiser","year":"1982","unstructured":"Weiser, M.: Programmers Use Slices When Debugging. CACM\u00a025(7), 446\u2013452 (1982)","journal-title":"CACM"},{"issue":"4","key":"20_CR16","first-page":"352","volume":"10","author":"M. Weiser","year":"1984","unstructured":"Weiser, M.: Program Slicing. IEEE TSE\u00a010(4), 352\u2013357 (1984)","journal-title":"IEEE TSE"},{"key":"20_CR17","unstructured":"Zhao, J., Cheng, J., Ushijima, K.: Literal Dependence Net and Its Use in Concurrent Logic Programming Environment. In: Proc. Workshop on Parallel Logic Programming FGCS 1994, Tokyo, pp. 127\u2013141 (1994)"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10704567_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T18:49:51Z","timestamp":1736707791000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10704567_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540665403","9783540481645"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/10704567_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}