乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:45:22Z","timestamp":1725893122205},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642322105"},{"type":"electronic","value":"9783642322112"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32211-2_13","type":"book-chapter","created":{"date-parts":[[2012,7,21]],"date-time":"2012-07-21T00:27:23Z","timestamp":1342830443000},"page":"189-204","source":"Crossref","is-referenced-by-count":2,"title":["Improved Termination Analysis of CHR Using Self-sustainability Analysis"],"prefix":"10.1007","author":[{"given":"Paolo","family":"Pilozzi","sequence":"first","affiliation":[]},{"given":"Danny","family":"De Schreye","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/BFb0017444","volume-title":"Principles and Practice of Constraint Programming - CP97","author":"S. Abdennadher","year":"1997","unstructured":"Abdennadher, S.: Operational Semantics and Confluence of Constraint Propagation Rules. In: Smolka, G. (ed.) CP 1997. LNCS, vol.\u00a01330, pp. 252\u2013266. Springer, Heidelberg (1997)"},{"doi-asserted-by":"crossref","unstructured":"Apt, K.R.: Logic programming. In: Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics (B), pp. 493\u2013574 (1990)","key":"13_CR2","DOI":"10.1016\/B978-0-444-88074-1.50015-9"},{"doi-asserted-by":"crossref","unstructured":"Beasley, J.E. (ed.): Advances in linear and integer programming. Oxford University Press, Inc. (1996)","key":"13_CR3","DOI":"10.1093\/oso\/9780198538561.001.0001"},{"issue":"1","key":"13_CR4","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1305\/ndjfl\/1093634995","volume":"30","author":"W.D. Blizard","year":"1989","unstructured":"Blizard, W.D.: Multiset theory. Notre Dame Journal of Formal Logic\u00a030(1), 36\u201366 (1989)","journal-title":"Notre Dame Journal of Formal Logic"},{"issue":"6","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1137","DOI":"10.1145\/330643.330645","volume":"21","author":"S. Decorte","year":"1999","unstructured":"Decorte, S., De Schreye, D., Vandecasteele, H.: Constraint-based termination analysis of logic programs. ACM Trans. Program. Lang. Syst.\u00a021(6), 1137\u20131195 (1999)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"8","key":"13_CR6","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1145\/359138.359142","volume":"22","author":"N. Dershowitz","year":"1979","unstructured":"Dershowitz, N., Manna, Z.: Proving termination with multiset orderings. Commun. ACM\u00a022(8), 465\u2013476 (1979)","journal-title":"Commun. ACM"},{"key":"13_CR7","first-page":"1","volume":"124","author":"J.G. Farkas","year":"1902","unstructured":"Farkas, J.G.: \u00dcber die theorie der einfachen ungleichungen. Journal f\u00fcr die Reine und Angewandte Mathematik\u00a0124, 1\u201327 (1902)","journal-title":"Journal f\u00fcr die Reine und Angewandte Mathematik"},{"issue":"1-3","key":"13_CR8","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0743-1066(98)10005-5","volume":"37","author":"T.W. Fr\u00fchwirth","year":"1998","unstructured":"Fr\u00fchwirth, T.W.: Theory and practice of constraint handling rules. J. Log. Program.\u00a037(1-3), 95\u2013138 (1998)","journal-title":"J. Log. Program."},{"doi-asserted-by":"crossref","unstructured":"Lloyd, J.W.: Foundations of Logic Programming, 2nd edn. Springer (1987)","key":"13_CR9","DOI":"10.1007\/978-3-642-83189-8"},{"unstructured":"MiniSAT (2010), http:\/\/minisat.se\/","key":"13_CR10"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1007\/978-3-540-78769-3_2","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M.T. Nguyen","year":"2008","unstructured":"Nguyen, M.T., Giesl, J., Schneider-Kamp, P., De Schreye, D.: Termination Analysis of Logic Programs Based on Dependency Graphs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol.\u00a04915, pp. 8\u201322. Springer, Heidelberg (2008)"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/978-3-540-89982-2_43","volume-title":"Logic Programming","author":"P. Pilozzi","year":"2008","unstructured":"Pilozzi, P., De Schreye, D.: Termination Analysis of CHR Revisited. In: Garcia de la Banda, M., Pontelli, E. (eds.) ICLP 2008. LNCS, vol.\u00a05366, pp. 501\u2013515. Springer, Heidelberg (2008)"},{"key":"13_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/978-3-642-02846-5_43","volume-title":"Logic Programming","author":"P. Pilozzi","year":"2009","unstructured":"Pilozzi, P., De Schreye, D.: Automating Termination Proofs for CHR. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 504\u2013508. Springer, Heidelberg (2009)"},{"doi-asserted-by":"crossref","unstructured":"Pilozzi, P., De Schreye, D.: Scaling termination proofs by a characterization of cycles in CHR. Technical Report CW 541, K.U.Leuven - Dept. of C.S., Leuven, Belgium (2009)","key":"13_CR14","DOI":"10.1007\/978-3-642-02846-5_43"},{"unstructured":"Pilozzi, P., De Schreye, D.: Scaling termination proofs by a characterisation of cycles in CHR. In: Termination Analysis, Proceedings of 11th International Workshop on Termination, WST 2010, United Kingdom, July 14-15 (2010)","key":"13_CR15"},{"unstructured":"Pilozzi, P., Schrijvers, T., De Schreye, D.: Proving termination of CHR in Prolog: A transformational approach. In: Termination Analysis, Proceedings of 9th International Workshop on Termination, WST 2007, Paris, France (June 2007)","key":"13_CR16"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-12592-8_4","volume-title":"Logic-Based Program Synthesis and Transformation","author":"P. Schneider-Kamp","year":"2010","unstructured":"Schneider-Kamp, P., Giesl, J., Nguyen, M.T.: The Dependency Triple Framework for Termination of Logic Programs. In: De Schreye, D. (ed.) LOPSTR 2009. LNCS, vol.\u00a06037, pp. 37\u201351. Springer, Heidelberg (2010)"},{"issue":"1","key":"13_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1471068409990123","volume":"10","author":"J. Sneyers","year":"2010","unstructured":"Sneyers, J., Van Weert, P., Schrijvers, T., De Koninck, L.: As time goes by: Constraint Handling Rules \u2013 A survey of CHR research between 1998 and 2007. Theory and Practice of Logic Programming\u00a010(1), 1\u201347 (2010)","journal-title":"Theory and Practice of Logic Programming"},{"unstructured":"SWI-Prolog (2010), http:\/\/www.swi-prolog.org","key":"13_CR19"},{"unstructured":"T-CoP (2010), http:\/\/people.cs.kuleuven.be\/~paolo.pilozzi?pg=tcop","key":"13_CR20"},{"issue":"2","key":"13_CR21","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1137\/0201010","volume":"1","author":"R.E. Tarjan","year":"1972","unstructured":"Tarjan, R.E.: Depth-first search and linear graph algorithms. SIAM J. Comput.\u00a01(2), 146\u2013160 (1972)","journal-title":"SIAM J. Comput."},{"unstructured":"Termination Competition (2010), http:\/\/termination-portal.org\/","key":"13_CR22"},{"unstructured":"Voets, D., De Schreye, D., Pilozzi, P.: A new approach to termination analysis of constraint handling rules. In: Pre-proceedings of Logic Programming, 18th International Symposium on Logic-Based Program Synthesis and Transformation, LOPSTR 2008, Valencia, Spain, pp. 28\u201342 (2008)","key":"13_CR23"}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32211-2_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,27]],"date-time":"2024-04-27T09:53:20Z","timestamp":1714211600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32211-2_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642322105","9783642322112"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32211-2_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}