{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T01:21:49Z","timestamp":1725758509651},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642452833"},{"type":"electronic","value":"9783642452840"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45284-0_12","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T00:54:34Z","timestamp":1385340874000},"page":"173-189","source":"Crossref","is-referenced-by-count":1,"title":["Terminyzer: An Automatic Non-termination Analyzer for Large Logic Programs"],"prefix":"10.1007","author":[{"given":"Senlin","family":"Liang","sequence":"first","affiliation":[]},{"given":"Michael","family":"Kifer","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Bruynooghe, M., Codish, M., Gallagher, J.P., Genaim, S., Vanhoof, W.: Termination analysis of logic programs through combination of type-based norms. ACM Trans. Program. Lang. Syst.\u00a029 (April 2007)","DOI":"10.1145\/1216374.1216378"},{"issue":"3","key":"12_CR2","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0743-1066(93)90039-J","volume":"15","author":"W. Chen","year":"1993","unstructured":"Chen, W., Kifer, M., Warren, D.S.: HiLog: A foundation for higher-order logic programming. J. Log. Program.\u00a015(3), 187\u2013230 (1993)","journal-title":"J. Log. Program."},{"key":"12_CR3","unstructured":"Costa, V.S., Damas, L., Rocha, R.: The YAP prolog system. CoRR abs\/1102.3896 (2011)"},{"key":"12_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-49674-2_6","volume-title":"Logic Program Synthesis and Transformation","author":"S. Decorte","year":"1998","unstructured":"Decorte, S., De Schreye, D., Leuschel, M., Martens, B., Sagonas, K.: Termination analysis for tabled logic programming. In: Fuchs, N.E. (ed.) LOPSTR 1997. LNCS, vol.\u00a01463, pp. 111\u2013127. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"12_CR5","first-page":"219","volume":"12","author":"M.V. Hermenegildo","year":"2012","unstructured":"Hermenegildo, M.V., Bueno, F., Carro, M., L\u00f3pez-Garc\u00eda, P., Mera, E., Morales, J.F., Puebla, G.: An overview of ciao and its design philosophy. TPLP\u00a012(1-2), 219\u2013252 (2012)","journal-title":"TPLP"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/978-3-642-33203-6_33","volume-title":"Web Reasoning and Rule Systems","author":"S. Liang","year":"2012","unstructured":"Liang, S.: Non-termination analysis and cost-based query optimization of logic programs. In: Kr\u00f6tzsch, M., Straccia, U. (eds.) RR 2012. LNCS, vol.\u00a07497, pp. 284\u2013290. Springer, Heidelberg (2012)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Liang, S., Kifer, M.: Terminyzer: An automatic non-termination analyzer for large logic programs. In: Technical Report (2012)","DOI":"10.1007\/978-3-642-45284-0_12"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/978-3-540-25951-0_14","volume-title":"Program Development in Computational Logic","author":"N. Lindenstrauss","year":"2004","unstructured":"Lindenstrauss, N., Sagiv, Y., Serebrenik, A.: Proving termination for logic programs by the query-mapping pairs approach. In: Bruynooghe, M., Lau, K.-K. (eds.) Program Development in Computational Logic. LNCS, vol.\u00a03049, pp. 453\u2013498. Springer, Heidelberg (2004)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/10704567_20","volume-title":"Proceedings of the International Conference PPDP 1999 on Principles and Practice of Declarative Programming","author":"U. Neumerkel","year":"1999","unstructured":"Neumerkel, U., Mesnard, F.: Localizing and explaining reasons for non-terminating logic programs with failure-slices. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 328\u2013342. Springer, Heidelberg (1999)"},{"key":"12_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-71410-1_15","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M.T. Nguyen","year":"2007","unstructured":"Nguyen, M.T., De Schreye, D.: Polytool: proving termination automatically based on polynomial interpretations. In: Puebla, G. (ed.) LOPSTR 2006. LNCS, vol.\u00a04407, pp. 210\u2013218. Springer, Heidelberg (2007)"},{"key":"12_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":"12_CR12","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1145\/1119479.1119481","volume":"28","author":"E. Payet","year":"2006","unstructured":"Payet, E., Mesnard, F.: Nontermination inference of logic programs. ACM Trans. Program. Lang. Syst.\u00a028, 256\u2013289 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"12_CR13","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1017\/S1471068410000165","volume":"10","author":"P. Schneider-kamp","year":"2010","unstructured":"Schneider-kamp, P., Giesl, J., Str\u00f6der, T., Serebrenik, A., Thiemann, R.: Automated termination analysis for logic programs with cut*. Theory Pract. Log. Program.\u00a010, 365\u2013381 (2010)","journal-title":"Theory Pract. Log. Program."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0743-1066(94)90027-2","volume":"19\/20","author":"D.D. Schreye","year":"1994","unstructured":"Schreye, D.D., Decorte, S.: Termination of logic programs: The never-ending story. J. Log. Program.\u00a019\/20, 199\u2013260 (1994)","journal-title":"J. Log. Program."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Introduction to the Theory of Computation. Thomson Publishing (1996)","DOI":"10.1145\/230514.571645"},{"key":"12_CR16","unstructured":"Swift, T., Warren, D.S., Sagonas, K., Freire, J., Rao, P., Cui, B., Johnson, E., de Castro, L., Marques, R.F., Saha, D., Dawson, S., Kifer, M.: The XSB system, version 3.3.x.: Programmer\u2019s manual (2012), \n                  \n                    http:\/\/xsb.sourceforge.net"},{"key":"12_CR17","unstructured":"Swift, T., Warren, D.S.: Xsb: Extending prolog with tabled logic programming. CoRR abs\/1012.5123 (2010)"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1145\/371282.371357","volume":"2","author":"S. Verbaeten","year":"2001","unstructured":"Verbaeten, S., Schreye, D.D., Sagonas, K.: Termination proofs for logic programs with tabling. ACM Trans. Comput. Logic\u00a02(1), 57\u201392 (2001)","journal-title":"ACM Trans. Comput. Logic"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-20551-4_9","volume-title":"Logic-Based Program Synthesis and Transformation","author":"D. Voets","year":"2011","unstructured":"Voets, D., De Schreye, D.: Non-termination analysis of logic programs using types. In: Alpuente, M. (ed.) LOPSTR 2010. LNCS, vol.\u00a06564, pp. 133\u2013148. Springer, Heidelberg (2011)"},{"key":"12_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-02846-5_21","volume-title":"Logic Programming","author":"D. Voets","year":"2009","unstructured":"Voets, D., De Schreye, D.: A new approach to non-termination analysis of logic programs. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol.\u00a05649, pp. 220\u2013234. Springer, Heidelberg (2009)"},{"issue":"1-2","key":"12_CR21","first-page":"189","volume":"12","author":"N.F. Zhou","year":"2012","unstructured":"Zhou, N.F.: The language features and architecture of b-prolog. TPLP\u00a012(1-2), 189\u2013218 (2012)","journal-title":"TPLP"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45284-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T18:28:22Z","timestamp":1558722502000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45284-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642452833","9783642452840"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45284-0_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}