{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:41:58Z","timestamp":1747546918332},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540650126"},{"type":"electronic","value":"9783540497660"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0056611","type":"book-chapter","created":{"date-parts":[[2006,7,30]],"date-time":"2006-07-30T08:19:58Z","timestamp":1154247598000},"page":"118-133","source":"Crossref","is-referenced-by-count":11,"title":["Detecting unsolvable queries for definite logic programs"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Bruynooghe","sequence":"first","affiliation":[]},{"given":"Henk","family":"Vandecasteele","sequence":"additional","affiliation":[]},{"given":"D. Andre","family":"de Waal","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Denecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,2]]},"reference":[{"key":"8_CR1","unstructured":"H. Ade and M. Denecker. Abductive inductive logic programming. In Proc. IJCAI'95, pages 201\u20131209. Morgan Kaufman, 1995."},{"key":"8_CR2","first-page":"353","volume-title":"Proc. ICLP'89","author":"K.R. Apt","year":"1989","unstructured":"K.R. Apt, R.N. Bol, and J.W. Klop. On the safe termination of Prolog programs. In Proc. ICLP'89, pages 353\u2013368, Lisbon, June 1989. MIT Press."},{"issue":"1","key":"8_CR3","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0304-3975(91)90004-L","volume":"86","author":"R.N. Bol","year":"1991","unstructured":"R.N. Bol, K.R. Apt, and J.W. Klop. An analysis of loop checking mechanisms for logic programs. Theoretical Computer Science, 86(1):35\u201379, august 1991.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"8_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0743-1066(92)90050-D","volume":"14","author":"M.P. Bonacina","year":"1992","unstructured":"M.P. Bonacina and J. Hsiang. On rewrite programs: semantics and relationship with Prolog. J. Logic Programming, 14(1&2):155\u2013180, October 1992.","journal-title":"J. Logic Programming"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"W. Charatonik and A. Podelski. Directional type inference for logic programs. In Proc. SAS'98, LNCS, Pisa, Italy, 1998. To appear.","DOI":"10.1007\/3-540-49727-7_17"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0743-1066(95)00064-X","volume":"25","author":"M. Codish","year":"1995","unstructured":"M. Codish and B. Demoen. Analysing logic programs using \u201cprop\u201d-ositional logic programs and a magic wand. J. Logic Programming, 25(3):249\u2013274, December 1995.","journal-title":"J. Logic Programming"},{"key":"8_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19","author":"D. Schreye De","year":"1994","unstructured":"D. De Schreye and S. Decorte. Termination of logic programs: the never-ending story. J. Logic Programming, 19 & 20:199\u2013260, may\/July 1994.","journal-title":"J. Logic Programming"},{"key":"8_CR8","unstructured":"D. A. de Waal, M. Denecker, M. Bruynooghe, and M. Thielscher. The generation of pre-interpretations for detecting unsolvable planning problems. In Proc. IJCAI Workshop on Model based Automated reasoning, pages 103\u2013112, 1997."},{"issue":"2","key":"8_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/S0743-1066(97)00074-5","volume":"34","author":"M. Denecker","year":"1998","unstructured":"M. Denecker and D. De Schreye. SLDNFA: an abductive procedure for abductive logic programs. J. Logic Programming, 34(2):201\u2013226, Februari 1998.","journal-title":"J. Logic Programming"},{"key":"8_CR10","first-page":"351","volume-title":"Proc. ILPS'95","author":"J. Gallagher","year":"1995","unstructured":"J. Gallagher, D. Boulanger, and H. Sa\u011flam. Practical model-based static analysis for definite logic programs. In Proc. ILPS'95, pages 351\u2013365, Portland, Oregon, December 1995. MIT Press."},{"key":"8_CR11","unstructured":"J. P. Gallagher and D.A. de Waal. Fast and precise regular approximations of logic programs,. In Proc. ICLP94, pages 599\u2013613. MIT Press, 1994."},{"key":"8_CR12","unstructured":"N. Heintze. Set based program analysis. PhD thesis, School of Computer Science, Carnegie Mellon University, 1992."},{"key":"8_CR13","first-page":"319","volume-title":"Proc. JICSLP'96","author":"M. Leuschel","year":"1996","unstructured":"Michael Leuschel, Danny De Schreye, and Andr\u00e9 de Waal. A conceptual embedding of folding into partial deduction: Towards a maximal integration. In Proc. JICSLP'96, pages 319\u2013332, Bonn, Germany, September 1996. MIT Press."},{"key":"8_CR14","doi-asserted-by":"crossref","unstructured":"K. Sagonas, T. Swift, and D. S. Warren. XSB as an efficient deductive database engine. In Proc. SIGMOD 1994 Conf. ACM. Acm Press, 1994.","DOI":"10.1145\/191839.191927"},{"issue":"2","key":"8_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BF03037237","volume":"15","author":"Y. D. Shen","year":"1997","unstructured":"Y. D. Shen. An extended variant of atoms loop check for positive logic programs. New Generation Computing, 15(2):187\u2013203, 1997.","journal-title":"New Generation Computing"},{"key":"8_CR16","volume-title":"Technical Report TR-ARP-2-94","author":"J. Slaney","year":"1994","unstructured":"J. Slaney. Finder: Finite domain enumerator system description. Technical Report TR-ARP-2-94, Centre for Information Science Research, Australian National University, Australia, 1994. Also in Proc. CADE-12."},{"key":"8_CR17","volume-title":"Technical report","author":"J. Slaney","year":"1997","unstructured":"J. Slaney. Finder \u2014 finite domain enumerator \u2014 version 3.0 \u2014 notes and guide. Technical report, Centre for Information Science Research, Australian National University, Australia, 1997."},{"key":"8_CR18","unstructured":"Swedish Institute of Computer Science. SICSTUS Prolog User's Manual, november 1997."},{"key":"8_CR19","series-title":"LNCS","first-page":"84","volume-title":"Proceedings ICLP'86","author":"H. Tamaki","year":"1986","unstructured":"H. Tamaki and T. Sato. OLD resolution with tabulation. In Proceedings ICLP'86, LNCS, pages 84\u201398, London, 1986. Springer-Verlag."},{"key":"8_CR20","unstructured":"P. Van Hentenryck. Constraint Satisfaction in Logic Programming. The MIT press, 1989."},{"issue":"3","key":"8_CR21","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1145\/131295.131299","volume":"35","author":"D. S. Warren","year":"1992","unstructured":"David S. Warren. Memoing for Logic Programs. Communications of the ACM, 35(3):93\u2013111, March 1992.","journal-title":"Communications of the ACM"}],"container-title":["Lecture Notes in Computer Science","Principles of Declarative Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0056611","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T18:59:33Z","timestamp":1549911573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0056611"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540650126","9783540497660"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0056611","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}