{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:32:11Z","timestamp":1742974331681,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":66,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540221524"},{"type":"electronic","value":"9783540259510"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-25951-0_6","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T06:46:58Z","timestamp":1280904418000},"page":"152-188","source":"Crossref","is-referenced-by-count":9,"title":["Analysing Logic Programs by Reasoning Backwards"],"prefix":"10.1007","author":[{"given":"Jacob M.","family":"Howe","sequence":"first","affiliation":[]},{"given":"Andy","family":"King","sequence":"additional","affiliation":[]},{"given":"Lunjin","family":"Lu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/3-540-58485-4_32","volume-title":"Static Analysis","author":"A. Aiken","year":"1994","unstructured":"Aiken, A., Lakshman, T.K.: Directional Type Checking of Logic Programs. In: LeCharlier, B. (ed.) SAS 1994. LNCS, vol.\u00a0864, pp. 43\u201360. Springer, Heidelberg (1994)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-6423(96)00039-1","volume":"31","author":"T. Armstrong","year":"1998","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Two Classes of Boolean Functions for Dependency Analysis. Science of Computer Programming\u00a031(1), 3\u201345 (1998)","journal-title":"Science of Computer Programming"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1007\/3-540-62718-9_12","volume-title":"Logic Program Synthesis and Transformation","author":"F. Benoy","year":"1997","unstructured":"Benoy, F., King, A.: Inferring Argument Size Relationships with CLP(R). In: Gallagher, J.P. (ed.) LOPSTR 1996. LNCS, vol.\u00a01207, pp. 204\u2013224. Springer, Heidelberg (1997)"},{"key":"6_CR4","unstructured":"Boye, J., Drabent, W., Ma\u0142uszy\u0144ski, J.: Declarative Diagnosis of Constraint Programs: an Assertion-based Approach. In: Proceedings of the Third International Workshop on Automated Debugging, pp. 123\u2013141. University of Link\u00f6ping Press (1997)"},{"key":"6_CR5","first-page":"190","volume-title":"Symposium on Principles of Database Systems","author":"A. Brodsky","year":"1989","unstructured":"Brodsky, A., Sagiv, Y.: Inference of Monotonicity Constraints in Datalog Programs. In: Symposium on Principles of Database Systems, pp. 190\u2013199. ACM Press, New York (1989)"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BFb0053561","volume-title":"Programming Languages and Systems","author":"M. Bruynooghe","year":"1998","unstructured":"Bruynooghe, M., Leuschel, M., Sagonas, K.: A Polyvariant Binding-Time Analysis for Off-line Partial Deduction. In: Hankin, C. (ed.) ESOP 1998. LNCS, vol.\u00a01381, pp. 27\u201341. Springer, Heidelberg (1998)"},{"key":"6_CR7","first-page":"40","volume-title":"International Conference on Logic Programming","author":"M. Carlsson","year":"1987","unstructured":"Carlsson, M.: Freeze, Indexing, and Other Implementation Issues in the WAM. In: Lassez, J.-L. (ed.) International Conference on Logic Programming, pp. 40\u201358. MIT Press, Cambridge (1987)"},{"issue":"3","key":"6_CR8","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1145\/177492.177656","volume":"16","author":"M. Codish","year":"1994","unstructured":"Codish, M., Falaschi, M., Marriott, K.: Suspension Analyses for Concurrent Logic Programs. Transactions on Programming Languages and Systems\u00a016(3), 649\u2013686 (1994)","journal-title":"Transactions on Programming Languages and Systems"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0304-3975(98)00122-4","volume":"238","author":"M. Codish","year":"2000","unstructured":"Codish, M., Lagoon, V.: Type Dependencies for Logic Programs using ACIunification. Theoretical Computer Science\u00a0238, 131\u2013159 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR10","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/S0743-1066(99)00006-0","volume":"41","author":"M. Codish","year":"1999","unstructured":"Codish, M., Taboch, C.: A Semantic Basis for the Termination Analysis of Logic Programs. The Journal of Logic Programming\u00a041(1), 103\u2013123 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR11","first-page":"215","volume-title":"North American Conference on Logic Programming","author":"C. Codognet","year":"1990","unstructured":"Codognet, C., Codognet, P., Corsini, M.: Abstract Interpretation for Concurrent Logic Languages. In: Debray, S.K., Hermenegildo, M.V. (eds.) North American Conference on Logic Programming, pp. 215\u2013232. MIT Press, Cambridge (1990)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Comini, M., Gori, R., Levi, G., Volpe, P.: Abstract Interpretation based Verification of Logic Programs. Electronic Notes of Theoretical Computer Science\u00a030(1) (1999)","DOI":"10.1016\/S1571-0661(04)00112-4"},{"issue":"3","key":"6_CR13","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0743-1066(94)00021-W","volume":"22","author":"B. Cortesi","year":"1995","unstructured":"Cortesi, B.: Le Charlier, and P. Van Hentenryck. Type Analysis of Prolog using Type Graphs. The Journal of Logic Programming\u00a022(3), 179\u2013208 (1995)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR14","first-page":"75","volume-title":"Tools and Notions for Program Construction","author":"P. Cousot","year":"1982","unstructured":"Cousot, P., Cousot, R.: Inductive Principles for Proving Invariance Properties of Programs. In: Tools and Notions for Program Construction, pp. 75\u2013119. Cambridge University Press, Cambridge (1982)"},{"key":"6_CR15","first-page":"84","volume-title":"Symposium on Principles of Programming Languages","author":"P. Cousot","year":"1978","unstructured":"Cousot, P., Halbwachs, N.: Automatic Discovery of Linear Restraints Among Variables of a Program. In: Symposium on Principles of Programming Languages, pp. 84\u201397. ACM Press, New York (1978)"},{"issue":"12","key":"6_CR16","doi-asserted-by":"publisher","first-page":"1337","DOI":"10.1002\/spe.4380231204","volume":"23","author":"S.K. Debray","year":"1993","unstructured":"Debray, S.K.: QD-Janus: a Sequential Implementation of Janus in Prolog. Software Practice and Experience\u00a023(12), 1337\u20131360 (1993)","journal-title":"Software Practice and Experience"},{"issue":"1-3","key":"6_CR17","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/S0743-1066(96)00052-0","volume":"29","author":"S.K. Debray","year":"1992","unstructured":"Debray, S.K., Gudeman, D., Bigot, P.: Detection and Optimization of Suspension-free Logic Programs. The Journal of Logic Programming\u00a029(1-3), 171\u2013194 (1992)","journal-title":"The Journal of Logic Programming"},{"issue":"2","key":"6_CR18","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/0890-5401(91)90004-L","volume":"90","author":"P. Dyber","year":"1991","unstructured":"Dyber, P.: Inverse Image Analysis Generalises Strictness Analysis. Information and Computation\u00a090(2), 194\u2013216 (1991)","journal-title":"Information and Computation"},{"issue":"3","key":"6_CR19","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0743-1066(99)00004-7","volume":"41","author":"M. Falaschi","year":"2000","unstructured":"Falaschi, M., Hicks, P., Winsborough, W.: Demand Transformation Analysis for Concurrent Constraint Programs. The Journal of Logic Programming\u00a041(3), 185\u2013215 (2000)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR20","first-page":"394","volume-title":"ACM Symposium on Applied Computing","author":"M. Gabbrielli","year":"1994","unstructured":"Gabbrielli, M., Giacobazzi, R.: Goal Independency and Call Patterns in the Analysis of Logic Programs. In: ACM Symposium on Applied Computing, pp. 394\u2013399. ACM Press, New York (1994)"},{"issue":"4","key":"6_CR21","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1093\/logcom\/6.4.491","volume":"6","author":"M. Gabbrielli","year":"1996","unstructured":"Gabbrielli, M., Levi, G., Meo, M.C.: Resultants Semantics for Prolog. Journal of Logic and Computation\u00a06(4), 491\u2013521 (1996)","journal-title":"Journal of Logic and Computation"},{"key":"6_CR22","unstructured":"Gallagher, J.P.: A Program Transformation for Backwards Analysis of Logic Programs. In: Bruynooghe, M. (ed.) Pre-proceedings of the International Symposium on Logic-based Program Synthesis and Transformation. Katholieke Universiteit Leuven, Technical Report, vol.\u00a0CW 365, pp. 113\u2013122 (2003)"},{"key":"6_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/3-540-45587-6_16","volume-title":"Practical Aspects of Declarative Languages","author":"J.P. Gallagher","year":"2002","unstructured":"Gallagher, J.P., Puebla, G.: Abstract Interpretation over Non-deterministic Finite Tree Automata for Set-based Analysis of Logic Programs. In: Krishnamurthi, S., Ramakrishnan, C.R. (eds.) PADL 2002. LNCS, vol.\u00a02257, pp. 243\u2013261. Springer, Heidelberg (2002)"},{"key":"6_CR24","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"681","DOI":"10.1007\/3-540-45653-8_47","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"S. Genaim","year":"2001","unstructured":"Genaim, S., Codish, M.: Inferring Termination Conditions for Logic Programs using Backwards Analysis. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 681\u2013690. Springer, Heidelberg (2001); Technical report version available at \n                      http:\/\/www.cs.bgu.ac.il\/~mcodish\/Papers\/Pages\/lpar01.html"},{"key":"6_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/3-540-47813-2_9","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"S. Genaim","year":"2002","unstructured":"Genaim, S., Codish, M., Gallagher, J.P., Lagoon, V.: Combining Norms to Prove Termination. In: Cortesi, A. (ed.) VMCAI 2002. LNCS, vol.\u00a02294, pp. 126\u2013138. Springer, Heidelberg (2002)"},{"key":"6_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-36575-3_7","volume-title":"Programming Languages and Systems","author":"S. Genaim","year":"2003","unstructured":"Genaim, S., King, A.: Goal-Independent Suspension Analysis for Logic Programs with Dynamic Scheduling. In: Degano, P. (ed.) ESOP 2003. LNCS, vol.\u00a02618, pp. 84\u201398. Springer, Heidelberg (2003)"},{"issue":"4","key":"6_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1093\/logcom\/8.4.457","volume":"8","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R.: Abductive Analysis of Modular Logic Programs. Journal of Logic and Computation\u00a08(4), 457\u2013484 (1998)","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"6_CR28","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0743-1066(95)00038-0","volume":"25","author":"R. Giacobazzi","year":"1995","unstructured":"Giacobazzi, R., Debray, S.K., Levi, G.: Generalized Semantics and Abstract Interpretation for Constraint Logic Programs. The Journal of Logic Programming\u00a025(3), 191\u2013248 (1995)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR29","unstructured":"Giacobazzi, R., Ranzato, F., Scozzari, F.: Making Abstract Domains Condensing. ACM Transactions on Computational Logic (to appear)"},{"issue":"5","key":"6_CR30","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1145\/293677.293680","volume":"20","author":"R. Giacobazzi","year":"1998","unstructured":"Giacobazzi, R., Scozzari, F.: A Logical Model for Relational Abstract Domains. ACM Transactions on Programming Languages and Systems\u00a020(5), 1067\u20131109 (1998)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"6_CR31","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0167-6423(89)90027-0","volume":"12","author":"C. Hall","year":"1989","unstructured":"Hall, C., Wise, D.: Generating Function Versions with Rational Strictness Patterns. Science of Computer Programming\u00a012, 39\u201374 (1989)","journal-title":"Science of Computer Programming"},{"issue":"2","key":"6_CR32","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/BF03038312","volume":"13","author":"M. Hanus","year":"1995","unstructured":"Hanus, M.: Compile-time Analysis of Nonlinear Constraints in CLP(R). New Generation Computing\u00a013(2), 155\u2013186 (1995)","journal-title":"New Generation Computing"},{"issue":"1-3","key":"6_CR33","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0743-1066(00)00006-6","volume":"45","author":"A. Heaton","year":"2000","unstructured":"Heaton, A., Abo-Zaed, M., Codish, M., King, A.: A Simple Polynomial Groundness Analysis for Logic Programs. The Journal of Logic Programming\u00a045(1-3), 143\u2013156 (2000)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/3-540-48958-4_13","volume-title":"Logic-Based Program Synthesis and Transformation","author":"S. Hoarau","year":"1999","unstructured":"Hoarau, S., Mesnard, F.: Inferring and Compiling Termination for Constraint Logic Programs. In: Flener, P. (ed.) LOPSTR 1998. LNCS, vol.\u00a01559, pp. 240\u2013254. Springer, Heidelberg (1999)"},{"issue":"8","key":"6_CR35","doi-asserted-by":"publisher","first-page":"672","DOI":"10.1145\/27651.27653","volume":"30","author":"C.A.R. Hoare","year":"1987","unstructured":"Hoare, C.A.R., Hayes, I.J., He, J., Morgan, C., Roscoe, A.W., Sanders, J.W., Sorensen, I.H., Spivey, J.M., Sufrin, B.: Laws of Programming. Communications of the ACM\u00a030(8), 672\u2013686 (1987)","journal-title":"Communications of the ACM"},{"issue":"1-2","key":"6_CR36","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0020-0190(00)00081-8","volume":"75","author":"J.M. Howe","year":"2000","unstructured":"Howe, J.M., King, A.: Abstracting Numeric Constraints with Boolean Functions. Information Processing Letters\u00a075(1-2), 17\u201323 (2000)","journal-title":"Information Processing Letters"},{"key":"6_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/3-540-45635-X_16","volume-title":"Logic Programming","author":"J.M. Howe","year":"2001","unstructured":"Howe, J.M., King, A.: Positive Boolean Functions as Multiheaded Clauses. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol.\u00a02237, pp. 120\u2013134. Springer, Heidelberg (2001)"},{"issue":"1","key":"6_CR38","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1017\/S1471068402001485","volume":"3","author":"J.M. Howe","year":"2003","unstructured":"Howe, J.M., King, A.: Efficient Groundness Analysis in Prolog. Theory and Practice of Logic Programming\u00a03(1), 95\u2013124 (2003)","journal-title":"Theory and Practice of Logic Programming"},{"key":"6_CR39","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1017\/S1471068402001436","volume":"2","author":"A. King","year":"2002","unstructured":"King, A., Lu, L.: A Backward Analysis for Constraint Logic Programs. Theory and Practice of Logic Programming\u00a02, 517\u2013547 (2002)","journal-title":"Theory and Practice of Logic Programming"},{"key":"6_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/978-3-540-24599-5_22","volume-title":"Logic Programming","author":"A. King","year":"2003","unstructured":"King, A., Lu, L.: Forward versus Backward Verification of Logic Programs. In: Palamidessi, C. (ed.) ICLP 2003. LNCS, vol.\u00a02916, pp. 315\u2013330. Springer, Heidelberg (2003)"},{"key":"6_CR41","first-page":"478","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"A. King","year":"1992","unstructured":"King, A., Soper, P.: Schedule Analysis of Concurrent Logic Programs. In: Apt, K.R. (ed.) Joint International Conference and Symposium on Logic Programming, pp. 478\u2013492. MIT Press, Cambridge (1992)"},{"issue":"1-3","key":"6_CR42","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0743-1066(98)10032-8","volume":"39","author":"B. Le Charlier","year":"1999","unstructured":"Le Charlier, B., Lecl\u00e9re, C., Rossi, S., Cortesi, A.: Automatic Verification of Prolog Programs. The Journal of Logic Programming\u00a039(1-3), 3\u201342 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/3-540-49674-2_11","volume-title":"Logic Program Synthesis and Transformation","author":"N. Lindenstrauss","year":"1998","unstructured":"Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: Unfolding the Mystery of Mergesort. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 206\u2013225. Springer, Heidelberg (1998)"},{"key":"6_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-45789-5_9","volume-title":"Static Analysis","author":"L. Lu","year":"2002","unstructured":"Lu, L., King, A.: Backward Type Inference Generalises Type Checking. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 85\u2013101. Springer, Heidelberg (2002)"},{"key":"6_CR45","first-page":"240","volume-title":"Principles of Programming Languages","author":"K. Marriott","year":"1994","unstructured":"Marriott, K., Garc\u00eda de la Banda, M., Hermenegildo, M.V.: Analyzing Logic Programs with Dynamic Scheduling. In: Principles of Programming Languages, pp. 240\u2013254. ACM Press, New York (1994)"},{"issue":"4","key":"6_CR46","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1145\/176454.176519","volume":"2","author":"K. Marriott","year":"1993","unstructured":"Marriott, K., S\u00f8ndergaard, H.: Precise and Efficient Groundness Analysis for Logic Programs. ACM Letters on Programming Languages and Systems\u00a02(4), 181\u2013196 (1993)","journal-title":"ACM Letters on Programming Languages and Systems"},{"key":"6_CR47","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BFb0030603","volume-title":"TAPSOFT\u201997: Theory and Practice of Software Development","author":"J.C. Martin","year":"1997","unstructured":"Martin, J.C., King, A.: Generating Efficient, Terminating Logic Programs. In: Bidoit, M., Dauchet, M. (eds.) CAAP 1997, FASE 1997, and TAPSOFT 1997. LNCS, vol.\u00a01214, pp. 273\u2013284. Springer, Heidelberg (1997)"},{"key":"6_CR48","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1007\/3-540-44957-4_84","volume-title":"Computational Logic - CL 2000","author":"N. Mazur","year":"2000","unstructured":"Mazur, N., Janssens, G., Bruynooghe, M.: A Module Based Analysis for Memory Reuse in Mercury. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol.\u00a01861, pp. 1255\u20131269. Springer, Heidelberg (2000)"},{"key":"6_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/3-540-45013-0_9","volume-title":"Logic Based Program Synthesis and Transformation","author":"N. Mazur","year":"2003","unstructured":"Mazur, N., Janssens, G., Van Hoof, V.: Collecting Potential Optimizations. In: Leuschel, M. (ed.) LOPSTR 2002. LNCS, vol.\u00a02664, pp. 109\u2013110. Springer, Heidelberg (2003)"},{"key":"6_CR50","first-page":"7","volume-title":"Joint International Conference and Symposium on Logic Programming","author":"F. Mesnard","year":"1996","unstructured":"Mesnard, F.: Inferring Left-terminating Classes of Queries for Constraint Logic Programs. In: Joint International Conference and Symposium on Logic Programming, pp. 7\u201321. MIT Press, Cambridge (1996)"},{"key":"6_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/3-540-47764-0_6","volume-title":"Static Analysis","author":"F. Mesnard","year":"2001","unstructured":"Mesnard, F., Neumerkel, U.: Applying Static Analysis Techniques for Inferring Termination Conditions of Logic Programs. In: Cousot, P. (ed.) SAS 2001. LNCS, vol.\u00a02126, pp. 93\u2013110. Springer, Heidelberg (2001)"},{"key":"6_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/3-540-45789-5_35","volume-title":"Static Analysis","author":"F. Mesnard","year":"2002","unstructured":"Mesnard, F., Payet, \u00c9., Neumerkel, U.: Detecting Optimal Termination Conditions of Logic Programs. In: Hermenegildo, M.V., Puebla, G. (eds.) SAS 2002. LNCS, vol.\u00a02477, pp. 509\u2013526. Springer, Heidelberg (2002)"},{"issue":"2","key":"6_CR53","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/635499.635503","volume":"4","author":"F. Mesnard","year":"2003","unstructured":"Mesnard, F., Ruggieri, S.: On Proving Left Termination of Constraint Logic Programs. ACM Transactions on Computational Logic\u00a04(2), 207\u2013259 (2003)","journal-title":"ACM Transactions on Computational Logic"},{"key":"6_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1007\/3-540-16492-8_111","volume-title":"Third International Conference on Logic Programming","author":"L. Naish","year":"1986","unstructured":"Naish, L.: Negation and Quantifiers in NU-Prolog. In: Shapiro, E. (ed.) ICLP 1986. LNCS, vol.\u00a0225, pp. 624\u2013634. Springer, Heidelberg (1986)"},{"issue":"3","key":"6_CR55","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0020-0190(98)00098-2","volume":"67","author":"D. Pedreschi","year":"1998","unstructured":"Pedreschi, D., Ruggieri, S.: Weakest Preconditions for Pure Prolog Programs. Information Processing Letters\u00a067(3), 145\u2013150 (1998)","journal-title":"Information Processing Letters"},{"key":"6_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.V.: An Assertion Language for Constraint Logic Programs. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) DiSCiPl 1999. LNCS, vol.\u00a01870, pp. 23\u201361. Springer, Heidelberg (2000)"},{"key":"6_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/10722311_3","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G. Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.V.: A Generic Preprocessor for Program Validation and Debugging. In: Deransart, P., Ma\u0142uszy\u0144ski, J. (eds.) DiSCiPl 1999. LNCS, vol.\u00a01870, pp. 63\u2013107. Springer, Heidelberg (2000)"},{"issue":"2&3","key":"6_CR58","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/S0743-1066(99)00031-X","volume":"41","author":"G. Puebla","year":"1999","unstructured":"Puebla, G., Hermenegildo, M.V.: Abstract Multiple Specialization and its Application to Program Parallelization. The Journal of Logic Programming\u00a041(2&3), 279\u2013316 (1999)","journal-title":"The Journal of Logic Programming"},{"key":"6_CR59","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1145\/773184.773192","volume-title":"International Conference on Principles and Practice of Declarative Programming","author":"P. Rychlikowski","year":"2001","unstructured":"Rychlikowski, P., Truderung, T.: Polymorphic Directional Types for Logic Programming. In: International Conference on Principles and Practice of Declarative Programming, pp. 61\u201372. ACM Press, New York (2001)"},{"key":"6_CR60","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2086.001.0001","volume-title":"Concurrent Constraint Programming","author":"V.A. Saraswat","year":"1993","unstructured":"Saraswat, V.A.: Concurrent Constraint Programming. MIT Press, Cambridge (1993)"},{"key":"6_CR61","first-page":"431","volume-title":"North American Conference on Logic Programming","author":"V.A. Saraswat","year":"1990","unstructured":"Saraswat, V.A., Kahn, K., Levy, J.: Janus: a Step Towards Distributed Constraint Programming. In: North American Conference on Logic Programming, pp. 431\u2013446. MIT Press, Cambridge (1990)"},{"issue":"1-3","key":"6_CR62","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0743-1066(96)00068-4","volume":"29","author":"Z. Somogyi","year":"1996","unstructured":"Somogyi, Z., Henderson, F., Conway, T.: The Execution Algorithm of Mercury, an Efficient Purely Declarative Logic Programming Language. The Journal of Logic Programming\u00a029(1-3), 17\u201364 (1996)","journal-title":"The Journal of Logic Programming"},{"issue":"1","key":"6_CR63","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(89)90088-1","volume":"69","author":"L. Vielle","year":"1989","unstructured":"Vielle, L.: Recursive Query Processing: The Power of Logic. Theoretical Computer Science\u00a069(1), 1\u201353 (1989)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"6_CR64","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0167-6423(00)00017-4","volume":"39","author":"P. Volpe","year":"2001","unstructured":"Volpe, P.: A First-Order Language for Expressing Aliasing and Type Properties of Logic Programs. Science of Computer Programming\u00a039(1), 125\u2013148 (2001)","journal-title":"Science of Computer Programming"},{"key":"6_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1987","unstructured":"Wadler, P., Hughes, R.J.M.: Projections for Strictness Analysis. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 385\u2013407. Springer, Heidelberg (1987)"},{"issue":"2","key":"6_CR66","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0743-1066(91)80002-U","volume":"10","author":"E. Yardeni","year":"1991","unstructured":"Yardeni, E., Shapiro, E.Y.: A Type System for Logic Programs. The Journal of Logic Programming\u00a010(2), 125\u2013153 (1991)","journal-title":"The Journal of Logic Programming"}],"container-title":["Lecture Notes in Computer Science","Program Development in Computational Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-25951-0_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:11:54Z","timestamp":1676070714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-25951-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540221524","9783540259510"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-25951-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}