{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:47Z","timestamp":1750306787139,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,9,16]],"date-time":"2013-09-16T00:00:00Z","timestamp":1379289600000},"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":[[2013,9,16]]},"DOI":"10.1145\/2505879.2505883","type":"proceedings-article","created":{"date-parts":[[2013,9,17]],"date-time":"2013-09-17T19:57:05Z","timestamp":1379447825000},"page":"239-250","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Detecting decidable classes of finitely ground logic programs with function symbols"],"prefix":"10.1145","author":[{"given":"Marco","family":"Calautti","sequence":"first","affiliation":[{"name":"DIMES, Universit\u00e0 della Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergio","family":"Greco","sequence":"additional","affiliation":[{"name":"DIMES, Universit\u00e0 della Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Irina","family":"Trubitsyna","sequence":"additional","affiliation":[{"name":"DIMES, Universit\u00e0 della Calabria, Rende (CS), Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,9,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000244"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1017\/S147106840900372X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2004.02.001"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1216374.1216378"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89982-2_37"},{"key":"e_1_3_2_1_6_1","volume-title":"AAAI Conference on Artificial Intelligence","author":"Calimeri Francesco","year":"2010","unstructured":"Francesco Calimeri , Susanna Cozza , Giovambattista Ianni , and Nicola Leone . Enhancing asp by functions: Decidable classes and implementation techniques . In AAAI Conference on Artificial Intelligence , 2010 . Francesco Calimeri, Susanna Cozza, Giovambattista Ianni, and Nicola Leone. Enhancing asp by functions: Decidable classes and implementation techniques. In AAAI Conference on Artificial Intelligence, 2010."},{"key":"e_1_3_2_1_7_1","volume-title":"A decidable class of logic programs with function symbols","author":"Chomicki Jan","year":"1990","unstructured":"Jan Chomicki . A decidable class of logic programs with function symbols . Manhattan, Kan : Kansas State University, Dept . of Computing and Information Sciences, 1990 . Jan Chomicki. A decidable class of logic programs with function symbols. Manhattan, Kan: Kansas State University, Dept. of Computing and Information Sciences, 1990."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/151634.151635"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/11562931_25"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/1758481.1758508"},{"key":"e_1_3_2_1_11_1","first-page":"1070","volume-title":"International Joint Conference and Symposium on Logic Programmin","author":"Gelfond Michael","year":"1988","unstructured":"Michael Gelfond and Vladimir Lifschitz . The stable model semantics for logic programming . In International Joint Conference and Symposium on Logic Programmin , pages 1070 -- 1080 , 1988 . Michael Gelfond and Vladimir Lifschitz. The stable model semantics for logic programming. In International Joint Conference and Symposium on Logic Programmin, pages 1070--1080, 1988."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03037169"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/2371185"},{"key":"e_1_3_2_1_14_1","volume-title":"International Joint Conference on Artificial Intelligence","author":"Greco Sergio","year":"2013","unstructured":"Sergio Greco , Cristian Molinaro , and Irina Trubitsyna . Checking logic program termination under bottom-up evaluation . In International Joint Conference on Artificial Intelligence , 2013 . Sergio Greco, Cristian Molinaro, and Irina Trubitsyna. Checking logic program termination under bottom-up evaluation. In International Joint Conference on Artificial Intelligence, 2013."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1017\/S147106841300046X"},{"issue":"1","key":"e_1_3_2_1_16_1","first-page":"93","article-title":"A constraints rewriting approach","volume":"3","author":"Greco Sergio","year":"2010","unstructured":"Sergio Greco and Francesca Spezzano . Chase termination : A constraints rewriting approach . Proceeding of the Very Large Data Base Conference , 3 ( 1 ): 93 -- 104 , 2010 . Sergio Greco and Francesca Spezzano. Chase termination: A constraints rewriting approach. Proceeding of the Very Large Data Base Conference, 3(1):93--104, 2010.","journal-title":"Proceeding of the Very Large Data Base Conference"},{"issue":"11","key":"e_1_3_2_1_17_1","first-page":"1158","article-title":"Stratification criteria and rewriting techniques for checking chase termination","volume":"4","author":"Greco Sergio","year":"2011","unstructured":"Sergio Greco , Francesca Spezzano , and Irina Trubitsyna . Stratification criteria and rewriting techniques for checking chase termination . Proceeding of the Very Large Data Base Conference , 4 ( 11 ): 1158 -- 1168 , 2011 . Sergio Greco, Francesca Spezzano, and Irina Trubitsyna. Stratification criteria and rewriting techniques for checking chase termination. Proceeding of the Very Large Data Base Conference, 4(11):1158--1168, 2011.","journal-title":"Proceeding of the Very Large Data Base Conference"},{"key":"e_1_3_2_1_18_1","first-page":"323","volume-title":"International Conference on Logic Programming (Technical Communications)","author":"Greco Sergio","year":"2012","unstructured":"Sergio Greco , Francesca Spezzano , and Irina Trubitsyna . On the termination of logic programs with function symbols . In International Conference on Logic Programming (Technical Communications) , pages 323 -- 333 , 2012 . Sergio Greco, Francesca Spezzano, and Irina Trubitsyna. On the termination of logic programs with function symbols. In International Conference on Logic Programming (Technical Communications), pages 323--333, 2012."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02846-5_40"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/646057.678339"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/648225.749138"},{"key":"e_1_3_2_1_22_1","first-page":"8","volume-title":"International Symposium on Logic-based Program Synthesis and Transformation","author":"Nguyen Manh Thang","year":"2007","unstructured":"Manh Thang Nguyen , J\u00fcrgen Giesl , Peter Schneider-Kamp , and Danny De Schreye . Termination analysis of logic programs based on dependency graphs . In International Symposium on Logic-based Program Synthesis and Transformation , pages 8 -- 22 , 2007 . Manh Thang Nguyen, J\u00fcrgen Giesl, Peter Schneider-Kamp, and Danny De Schreye. Termination analysis of logic programs based on dependency graphs. In International Symposium on Logic-based Program Synthesis and Transformation, pages 8--22, 2007."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00200-010-0122-4"},{"issue":"1","key":"e_1_3_2_1_24_1","first-page":"73","article-title":"Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering","volume":"12","author":"Ohlebusch Enno","year":"2001","unstructured":"Enno Ohlebusch . Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering , Communication and Computing , 12 ( 1\/2 ): 73 -- 116 , 2001 . Enno Ohlebusch. Termination of logic programs: Transformational methods revisited. Applicable Algebra in Engineering, Communication and Computing, 12(1\/2):73--116, 2001.","journal-title":"Communication and Computing"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12592-8_4"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1614431.1614433"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068410000165"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-1066(94)90027-2"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068404002248"},{"key":"e_1_3_2_1_30_1","first-page":"267","volume-title":"Logic Programming and Nonmonotonic Reasoning","author":"Syrj\u00e4nen Tommi","year":"2001","unstructured":"Tommi Syrj\u00e4nen . Omega-restricted logic programs . In Logic Programming and Nonmonotonic Reasoning , pages 267 -- 279 , 2001 . Tommi Syrj\u00e4nen. Omega-restricted logic programs. In Logic Programming and Nonmonotonic Reasoning, pages 267--279, 2001."},{"key":"e_1_3_2_1_31_1","volume-title":"Principles of Database and Knowledge-Base Systems","author":"Ullman Jeffrey D.","year":"1988","unstructured":"Jeffrey D. Ullman . Principles of Database and Knowledge-Base Systems , Volume I. Computer Science Press , 1988 . Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, 1988."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1017\/S1471068411000159"}],"event":{"name":"PPDP '13: 15th International Symposium on Principles and Practice of Declarative Programming","sponsor":["Universidad Complutense de Madrid","SIGPLAN ACM Special Interest Group on Programming Languages"],"location":"Madrid Spain","acronym":"PPDP '13"},"container-title":["Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505883","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2505879.2505883","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:34:16Z","timestamp":1750232056000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2505879.2505883"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,16]]},"references-count":32,"alternative-id":["10.1145\/2505879.2505883","10.1145\/2505879"],"URL":"https:\/\/doi.org\/10.1145\/2505879.2505883","relation":{},"subject":[],"published":{"date-parts":[[2013,9,16]]},"assertion":[{"value":"2013-09-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}