{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:24:42Z","timestamp":1750307082869,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2012,9,19]]},"DOI":"10.1145\/2370776.2370778","type":"proceedings-article","created":{"date-parts":[[2012,9,25]],"date-time":"2012-09-25T23:48:43Z","timestamp":1348616923000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Symbolic evaluation graphs and term rewriting"],"prefix":"10.1145","author":[{"given":"J\u00fcrgen","family":"Giesl","sequence":"first","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Thomas","family":"Str\u00f6der","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[{"name":"University of Southern Denmark, Odense, Denmark"}]},{"given":"Fabian","family":"Emmes","sequence":"additional","affiliation":[{"name":"RWTH Aachen University, Aachen, Germany"}]},{"given":"Carsten","family":"Fuhs","sequence":"additional","affiliation":[{"name":"University College London, London, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"http:\/\/aprove.informatik.rwth-aachen.de\/eval\/ LPGraphs\/.  http:\/\/aprove.informatik.rwth-aachen.de\/eval\/ LPGraphs\/."},{"key":"e_1_3_2_1_2_1","volume-title":"From Logic Programming to Prolog","author":"Apt K. R.","year":"1997","unstructured":"K. R. Apt . From Logic Programming to Prolog . Prentice Hall , 1997 . K. R. Apt. From Logic Programming to Prolog. Prentice Hall, 1997."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_10"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02348-4_4"},{"key":"e_1_3_2_1_5_1","first-page":"123","volume-title":"Proc. RTA '11","author":"Avanzini M.","year":"2011","unstructured":"M. Avanzini , N. Eguchi , and G. Moser . A path order for rewrite systems that compute exponential time functions . In Proc. RTA '11 , LIPIcs 10, pages 123 -- 138 , 2011 . M. Avanzini, N. Eguchi, and G. Moser. A path order for rewrite systems that compute exponential time functions. In Proc. RTA '11, LIPIcs 10, pages 123--138, 2011."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/280474"},{"key":"e_1_3_2_1_7_1","first-page":"155","volume-title":"Proc. RTA '11","author":"Brockschmidt M.","year":"2011","unstructured":"M. Brockschmidt , C. Otto , and J. Giesl . Modular termination proofs of recursive Java Bytecode programs by term rewriting . In Proc. RTA '11 , LIPIcs 10, pages 155 -- 170 , 2011 . M. Brockschmidt, C. Otto, and J. Giesl. Modular termination proofs of recursive Java Bytecode programs by term rewriting. In Proc. RTA '11, LIPIcs 10, pages 155--170, 2011."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31762-0_9"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31424-7_13"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/93542.93564"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/161468.161472"},{"key":"e_1_3_2_1_12_1","first-page":"291","volume-title":"Proc. ILPS '97","author":"Debray S. K.","year":"1997","unstructured":"S. K. Debray , P. L\u00f3pez-Garc\u00eda , M. V. Hermenegildo , and N.-W. Lin . Lower bound cost estimation for logic programs . In Proc. ILPS '97 , pages 291 -- 305 . MIT Press , 1997 . S. K. Debray, P. L\u00f3pez-Garc\u00eda, M. V. Hermenegildo, and N.-W. Lin. Lower bound cost estimation for logic programs. In Proc. ILPS '97, pages 291--305. MIT Press, 1997."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0747-7171(87)80022-6"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02348-4_3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814771_24"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-006-9057-7"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1890028.1890030"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2005.02.006"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000457"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_32"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068402001485"},{"key":"e_1_3_2_1_23_1","volume-title":"Information technology - Programming languages - Prolog","author":"IEC","year":"1995","unstructured":"ISO\/ IEC 13211-1. Information technology - Programming languages - Prolog . 1995 . ISO\/IEC 13211-1. Information technology - Programming languages - Prolog. 1995."},{"key":"e_1_3_2_1_24_1","first-page":"261","volume-title":"Proc. ILPS '97","author":"King A.","year":"1997","unstructured":"A. King , K. Shen , and F. Benoy . Lower-bound time-complexity analysis of logic programs . In Proc. ILPS '97 , pages 261 -- 285 . MIT Press , 1997 . A. King, K. Shen, and F. Benoy. Lower-bound time-complexity analysis of logic programs. In Proc. ILPS '97, pages 261--285. MIT Press, 1997."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/11799573_12"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000160"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29822-6_16"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00354-008-0085-1"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.5555\/646800.705491"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/1778180.1778211"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78769-3_2"},{"key":"e_1_3_2_1_32_1","first-page":"422","article-title":"The dependency pair framework for automated complexity analysis of term rewrite systems. In Proc. CADE '11","volume":"6803","author":"Noschinski L.","year":"2011","unstructured":"L. Noschinski , F. Emmes , and J. Giesl . The dependency pair framework for automated complexity analysis of term rewrite systems. In Proc. CADE '11 , LNAI 6803 , pages 422 -- 438 , 2011 . L. Noschinski, F. Emmes, and J. Giesl. The dependency pair framework for automated complexity analysis of term rewrite systems. In Proc. CADE '11, LNAI 6803, pages 422--438, 2011.","journal-title":"LNAI"},{"key":"e_1_3_2_1_33_1","volume-title":"Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing, 12(1--2):73--116","author":"Ohlebusch E.","year":"2001","unstructured":"E. Ohlebusch . Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing, 12(1--2):73--116 , 2001 . E. Ohlebusch. Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing, 12(1--2):73--116, 2001."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/115865.115869"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614431.1614433"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12592-8_4"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000165"},{"key":"e_1_3_2_1_38_1","first-page":"465","volume-title":"Proc. ILPS '95","author":"S\u00f8rensen M. H.","year":"1995","unstructured":"M. H. S\u00f8rensen and R. Gl\u00fcck . An algorithm of generalization in positive supercompilation . In Proc. ILPS '95 , pages 465 -- 479 . MIT Press , 1995 . M. H. S\u00f8rensen and R. Gl\u00fcck. An algorithm of generalization in positive supercompilation. In Proc. ILPS '95, pages 465--479. MIT Press, 1995."},{"key":"e_1_3_2_1_39_1","volume-title":"Towards termination analysis of real Prolog programs. Diploma Thesis","author":"Str\u00f6der T.","year":"2010","unstructured":"T. Str\u00f6der . Towards termination analysis of real Prolog programs. Diploma Thesis , RWTH Aachen University , 2010 . Available from {1}. T. Str\u00f6der. Towards termination analysis of real Prolog programs. Diploma Thesis, RWTH Aachen University, 2010. Available from {1}."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.5555\/2008282.2008294"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32211-2_16"},{"key":"e_1_3_2_1_42_1","first-page":"385","volume-title":"Proc. RTA '10","author":"Zankl H.","year":"2010","unstructured":"H. Zankl and M. Korp . Modular complexity analysis via relative complexity . In Proc. RTA '10 , LIPIcs 6, pages 385 -- 400 , 2010 . H. Zankl and M. Korp. Modular complexity analysis via relative complexity. In Proc. RTA '10, LIPIcs 6, pages 385--400, 2010."},{"key":"e_1_3_2_1_43_1","first-page":"181","volume-title":"Term Rewriting Systems","author":"Zantema H.","year":"2003","unstructured":"H. Zantema . Termination . In Terese, editor, Term Rewriting Systems , pages 181 -- 259 . Cambridge University Press , 2003 . H. Zantema. Termination. In Terese, editor, Term Rewriting Systems, pages 181--259. Cambridge University Press, 2003."}],"event":{"name":"PPDP'12: Principles and Practice of Declarative Programming","sponsor":["Kuleuven Belgium Kuleuven Belgium","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Leuven Belgium","acronym":"PPDP'12"},"container-title":["Proceedings of the 14th symposium on Principles and practice of declarative programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370776.2370778","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2370776.2370778","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:34:16Z","timestamp":1750239256000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2370776.2370778"}},"subtitle":["a general methodology for analyzing logic programs"],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":42,"alternative-id":["10.1145\/2370776.2370778","10.1145\/2370776"],"URL":"https:\/\/doi.org\/10.1145\/2370776.2370778","relation":{},"subject":[],"published":{"date-parts":[[2012,9,19]]},"assertion":[{"value":"2012-09-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}