{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:17:56Z","timestamp":1750306676221,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,9,8]],"date-time":"2014-09-08T00:00:00Z","timestamp":1410134400000},"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":[[2014,9,8]]},"DOI":"10.1145\/2643135.2643152","type":"proceedings-article","created":{"date-parts":[[2015,7,6]],"date-time":"2015-07-06T14:04:29Z","timestamp":1436191469000},"page":"111-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Proving Operational Termination of Declarative Programs in General Logics"],"prefix":"10.1145","author":[{"given":"Salvador","family":"Lucas","sequence":"first","affiliation":[{"name":"CS Dept. University of Illinois at Urbana-Champaign and DSIC, Universitat Polit\u00e8cnica de Val\u00e8ncia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9","family":"Meseguer","sequence":"additional","affiliation":[{"name":"CS Dept. University of Illinois at Urbana-Champaign"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2014,9,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1093\/oso\/9780198538592.003.0010","volume-title":"What is a Logical System","author":"Aczel P.","year":"1994","unstructured":"P. Aczel . Schematic Consequence . In D. Gabbay, editor, What is a Logical System , pages 261 -- 272 , Oxford University Press , 1994 . P. Aczel. Schematic Consequence. In D. Gabbay, editor, What is a Logical System, pages 261--272, Oxford University Press, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89439-1_44"},{"key":"e_1_3_2_1_3_1","first-page":"35","article-title":"A Dependency Pair Framework for A\u2228C-Termination. In Proc. of WRLA'10","volume":"6381","author":"Alarc\u00f3n B.","year":"2010","unstructured":"B. Alarc\u00f3n , S. Lucas , and J. Meseguer . A Dependency Pair Framework for A\u2228C-Termination. In Proc. of WRLA'10 , LNCS 6381 : 35 -- 51 , 2010 . B. Alarc\u00f3n, S. Lucas, and J. Meseguer. A Dependency Pair Framework for A\u2228C-Termination. In Proc. of WRLA'10, LNCS 6381:35--51, 2010.","journal-title":"LNCS"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/2529641"},{"key":"e_1_3_2_1_5_1","volume-title":"LNCS","author":"Clavel M.","year":"2007","unstructured":"M. Clavel , F. Dur\u00e1n , S. Eker , P. Lincoln , N. Mart\u00ed-Oliet , J. Meseguer , and C. Talcott . All About Maude -- A High-Performance Logical Framework , LNCS volume 4350 , 2007 . M. Clavel, F. Dur\u00e1n, S. Eker, P. Lincoln, N. Mart\u00ed-Oliet, J. Meseguer, and C. Talcott. All About Maude -- A High-Performance Logical Framework, LNCS volume 4350, 2007."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-1066(99)00006-0"},{"key":"e_1_3_2_1_7_1","first-page":"117","article-title":"A General Framework for Automatic Termination of Logic Programs. Applicable Algebra in Engineering","volume":"12","author":"Dershowitz N.","year":"2001","unstructured":"N. Dershowitz , N. Lindenstrauss , Y. Sagiv , and A. Serebrenik . A General Framework for Automatic Termination of Logic Programs. Applicable Algebra in Engineering , Communication and Computing , 12 : 117 -- 156 , 2001 . N. Dershowitz, N. Lindenstrauss, Y. Sagiv, and A. Serebrenik. A General Framework for Automatic Termination of Logic Programs. Applicable Algebra in Engineering, Communication and Computing, 12:117--156, 2001.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/359138.359142"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1014007.1014022"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10990-008-9028-2"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.entcs.2009.07.062"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-71070-7_27"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-70590-1_7"},{"key":"e_1_3_2_1_14_1","volume-title":"Proc. of RTA'01","author":"Giesl J.","year":"2051","unstructured":"J. Giesl and D. Kapur . Dependency Pairs for Equational Rewriting . Proc. of RTA'01 , LNCS 2051 : 93--108, 2001. J. Giesl and D. Kapur. Dependency Pairs for Equational Rewriting. Proc. of RTA'01, LNCS 2051:93--108, 2001."},{"key":"e_1_3_2_1_15_1","first-page":"301","article-title":"The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR'04","volume":"3452","author":"Giesl J.","year":"2004","unstructured":"J. Giesl , R. Thiemann , and P. Schneider-Kamp . The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR'04 , LNAI 3452 : 301 -- 331 , 2004 . J. Giesl, R. Thiemann, and P. Schneider-Kamp. The Dependency Pair Framework: Combining Techniques for Automated Termination Proofs. In Proc. of LPAR'04, LNAI 3452:301--331, 2004.","journal-title":"LNAI"},{"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","volume-title":"Proc of WRLA'10 LNCS 6381:19--35","author":"Guti\u00e9rrez R.","year":"2010","unstructured":"R. Guti\u00e9rrez and S. Lucas . Proving Termination in the Context-Sensitive Depedency Pairs Framework . In Proc of WRLA'10 LNCS 6381:19--35 , 2010 . R. Guti\u00e9rrez and S. Lucas. Proving Termination in the Context-Sensitive Depedency Pairs Framework. In Proc of WRLA'10 LNCS 6381:19--35, 2010."},{"issue":"1","key":"e_1_3_2_1_18_1","first-page":"1","article-title":"Context-sensitive computations in functional and functional logic programs","volume":"1998","author":"Lucas S.","year":"1998","unstructured":"S. Lucas . Context-sensitive computations in functional and functional logic programs . Journal of Functional and Logic Programming , 1998 ( 1 ): 1 -- 61 , January 1998 . S. Lucas. Context-sensitive computations in functional and functional logic programs. Journal of Functional and Logic Programming, 1998(1):1--61, January 1998.","journal-title":"Journal of Functional and Logic Programming"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(02)93176-7"},{"key":"e_1_3_2_1_20_1","volume-title":"Proc. of WRLA'14","volume":"8663","author":"Lucas S.","unstructured":"S. Lucas and J. Meseguer . 2D Dependency Pairs for Proving Operational Termination of CTRSs . In Proc. of WRLA'14 , LNCS vol. 8663 , to appear, 2014. S. Lucas and J. Meseguer. 2D Dependency Pairs for Proving Operational Termination of CTRSs. In Proc. of WRLA'14, LNCS vol. 8663, to appear, 2014."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389449.1389463"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.05.002"},{"key":"e_1_3_2_1_23_1","first-page":"275","volume-title":"Logic Colloquium'87","author":"Meseguer J.","year":"1989","unstructured":"J. Meseguer . General Logics . In H.-D. Ebbinghaus et al., editors , Logic Colloquium'87 , pages 275 -- 329 , North-Holland , 1989 . J. Meseguer. General Logics. In H.-D. Ebbinghaus et al., editors, Logic Colloquium'87, pages 275--329, North-Holland, 1989."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/645934.673375"},{"key":"e_1_3_2_1_25_1","first-page":"2","volume":"40","author":"Nakamura M.","year":"2013","unstructured":"M. Nakamura , K. Ogata , and K. Futatsugi . On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs. International Journal of Computer Science , 40 : 2 , 2013 . M. Nakamura, K. Ogata, and K. Futatsugi. On Proving Operational Termination Incrementally with Modular Conditional Dependency Pairs. International Journal of Computer Science, 40:2, 2013.","journal-title":"International Journal of Computer Science"},{"key":"e_1_3_2_1_26_1","volume-title":"Proc. of LOPSTR 2007","author":"Nguyen M.T.","year":"2007","unstructured":"M.T. Nguyen , J. Giesl , P. Schneider-Kamp , and D. De Schreye . Termination Analysis of Logic Programs Based on Dependency Graphs . In Proc. of LOPSTR 2007 , LNCS 4915: 8--22, 2007 . M.T. Nguyen, J. Giesl, P. Schneider-Kamp, and D. De Schreye. Termination Analysis of Logic Programs Based on Dependency Graphs. In Proc. of LOPSTR 2007, LNCS 4915:8--22, 2007."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/513717"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2009.08.001"},{"key":"e_1_3_2_1_29_1","first-page":"199","article-title":"de Scheye and S","volume":"19","author":"D","year":"1994","unstructured":"D . de Scheye and S . Decorte. Termination of Logic Programs: The Never-Ending Story. Journal of Logic Programming , 19 : 199 -- 260 , 1994 . D. de Scheye and S. Decorte. Termination of Logic Programs: The Never-Ending Story. Journal of Logic Programming, 19:199--260, 1994.","journal-title":"Journal of Logic Programming"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12592-8_4"}],"event":{"name":"PPDP '14: 16th International Symposium on Principles and Practice of Declarative Programming","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Canterbury United Kingdom","acronym":"PPDP '14"},"container-title":["Proceedings of the 16th International Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643152","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2643135.2643152","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:01Z","timestamp":1750230061000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2643135.2643152"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,9,8]]},"references-count":30,"alternative-id":["10.1145\/2643135.2643152","10.1145\/2643135"],"URL":"https:\/\/doi.org\/10.1145\/2643135.2643152","relation":{},"subject":[],"published":{"date-parts":[[2014,9,8]]},"assertion":[{"value":"2014-09-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}