{"id":"https://openalex.org/W2135520900","doi":"https://doi.org/10.1017/s1471068414000623","title":"Checking termination of bottom-up evaluation of logic programs with function symbols","display_name":"Checking termination of bottom-up evaluation of logic programs with function symbols","publication_year":2014,"publication_date":"2014-08-13","ids":{"openalex":"https://openalex.org/W2135520900","doi":"https://doi.org/10.1017/s1471068414000623","mag":"2135520900"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068414000623","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068414000623","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/32025134-db98-41da-ac24-c6145d43b850","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5066005299","display_name":"Marco Calautti","orcid":"https://orcid.org/0000-0003-0921-4040"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"MARCO CALAUTTI","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031964906","display_name":"Sergio Greco","orcid":"https://orcid.org/0000-0003-2966-3484"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"SERGIO GRECO","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045206246","display_name":"Francesca Spezzano","orcid":"https://orcid.org/0000-0002-0361-9728"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"FRANCESCA SPEZZANO","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067924380","display_name":"Irina Trubitsyna","orcid":"https://orcid.org/0000-0002-9031-0672"},"institutions":[{"id":"https://openalex.org/I45204951","display_name":"University of Calabria","ror":"https://ror.org/02rc97e94","country_code":"IT","type":"education","lineage":["https://openalex.org/I45204951"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"IRINA TRUBITSYNA","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy","institution_ids":["https://openalex.org/I45204951"]},{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende (CS), Italy#TAB#","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5066005299"],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":2.5321,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.91338818,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"15","issue":"6","first_page":"854","last_page":"889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.8486418724060059},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8215105533599854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.817933201789856},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5404772162437439},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5251083970069885},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4237120747566223},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.41567811369895935},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3661978840827942}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.8486418724060059},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8215105533599854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.817933201789856},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5404772162437439},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5251083970069885},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4237120747566223},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.41567811369895935},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3661978840827942},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s1471068414000623","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068414000623","pdf_url":null,"source":{"id":"https://openalex.org/S59670734","display_name":"Theory and Practice of Logic Programming","issn_l":"1471-0684","issn":["1471-0684","1475-3081"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theory and Practice of Logic Programming","raw_type":"journal-article"},{"id":"pmh:oai:pure.ed.ac.uk:openaire/32025134-db98-41da-ac24-c6145d43b850","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/32025134-db98-41da-ac24-c6145d43b850","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Calautti, M, Greco, S, Spezzano, F & Trubitsyna, I 2015, 'Checking termination of bottom-up evaluation of logic programs with function symbols', Theory and Practice of Logic Programming, vol. 15, no. 6, pp. 854\u2013889. https://doi.org/10.1017/S1471068414000623","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1407.2106","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1407.2106","pdf_url":"https://arxiv.org/pdf/1407.2106","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.768.8073","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.768.8073","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1407.2106.pdf","raw_type":"text"},{"id":"pmh:oai:iris.unitn.it:11572/260195","is_oa":true,"landing_page_url":"https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/checking-termination-of-bottomup-evaluation-of-logic-programs-with-function-symbols/B22F50538C075580BE372AFBC0FE24D5","pdf_url":null,"source":{"id":"https://openalex.org/S4306401913","display_name":"Institutional Research Information System (Universit\u00e0 degli Studi di Trento)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193223587","host_organization_name":"University of Trento","host_organization_lineage":["https://openalex.org/I193223587"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.ed.ac.uk:publications/32025134-db98-41da-ac24-c6145d43b850","is_oa":false,"landing_page_url":"https://www.research.ed.ac.uk/portal/en/publications/checking-termination-of-bottomup-evaluation-of-logic-programs-with-function-symbols(32025134-db98-41da-ac24-c6145d43b850).html","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/32025134-db98-41da-ac24-c6145d43b850","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/32025134-db98-41da-ac24-c6145d43b850","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Calautti, M, Greco, S, Spezzano, F & Trubitsyna, I 2015, 'Checking termination of bottom-up evaluation of logic programs with function symbols', Theory and Practice of Logic Programming, vol. 15, no. 6, pp. 854\u2013889. https://doi.org/10.1017/S1471068414000623","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W108605113","https://openalex.org/W649907208","https://openalex.org/W1484110122","https://openalex.org/W1488953560","https://openalex.org/W1513230022","https://openalex.org/W1552168992","https://openalex.org/W1574704561","https://openalex.org/W1579524364","https://openalex.org/W1583896216","https://openalex.org/W1590284853","https://openalex.org/W1605371072","https://openalex.org/W1672891595","https://openalex.org/W1821679657","https://openalex.org/W1875104636","https://openalex.org/W1965483956","https://openalex.org/W1967832907","https://openalex.org/W1978108034","https://openalex.org/W1985455954","https://openalex.org/W2002483665","https://openalex.org/W2009286786","https://openalex.org/W2011124182","https://openalex.org/W2013096722","https://openalex.org/W2013130775","https://openalex.org/W2029399717","https://openalex.org/W2038040550","https://openalex.org/W2051564255","https://openalex.org/W2054769644","https://openalex.org/W2066734765","https://openalex.org/W2070546615","https://openalex.org/W2076698873","https://openalex.org/W2090855107","https://openalex.org/W2102729564","https://openalex.org/W2111739714","https://openalex.org/W2115282751","https://openalex.org/W2123968982","https://openalex.org/W2124061668","https://openalex.org/W2128219525","https://openalex.org/W2136514805","https://openalex.org/W2137327104","https://openalex.org/W2141104250","https://openalex.org/W2170550263","https://openalex.org/W2786353107","https://openalex.org/W2911543830","https://openalex.org/W3098606030","https://openalex.org/W6678870298"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W1501430220","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696"],"abstract_inverted_index":{"Abstract":[0],"Recently,":[1],"there":[2],"has":[3],"been":[4,72],"an":[5],"increasing":[6],"interest":[7],"in":[8,26,45,60,195],"the":[9,13,27,31,42,46,54,61,112,118,128,132,148,175,190,204,207,216,244,250],"bottom-up":[10,87,107],"evaluation":[11,43],"of":[12,15,23,37,41,100,120,127,131,147,192,206,225,235,237],"semantics":[14],"logic":[16,101],"programs":[17,102,226],"with":[18,103],"complex":[19,121],"terms.":[20],"The":[21,91,139],"presence":[22,191],"function":[24,104,178],"symbols":[25,105],"program":[28,55,68,113],"may":[29,159,184],"render":[30],"ground":[32],"instantiation":[33],"infinite,":[34],"and":[35,39,163,188,213,227],"finiteness":[36],"models":[38],"termination":[40,56,69,99],"procedure,":[44],"general":[47,62],"case,":[48,63],"are":[49,78],"not":[50,79],"guaranteed":[51],"anymore.":[52],"Since":[53],"problem":[57],"is":[58,219],"undecidable":[59],"several":[64],"decidable":[65,95,149],"criteria":[66,96,150,209],"(called":[67],"criteria)":[70],"have":[71],"recently":[73],"proposed.":[74],"However,":[75],"current":[76],"conditions":[77],"able":[80,179],"to":[81,180,210,221],"identify":[82,222],"even":[83],"simple":[84],"programs,":[85,239],"whose":[86],"execution":[88],"always":[89],"terminates.":[90],"paper":[92],"introduces":[93],"new":[94],"for":[97],"checking":[98],"under":[106],"evaluation,":[108],"by":[109,125],"deeply":[110],"analyzing":[111],"structure.":[114],"First,":[115],"we":[116,155,231],"analyze":[117,181],"propagation":[119,136],"terms":[122],"among":[123],"arguments":[124,194],"means":[126],"extended":[129],"version":[130],"argument":[133],"graph":[134,137],"called":[135,142,169,240],".":[138,171],"resulting":[140],"criterion,":[141,168],"acyclicity":[143],",":[144,242],"generalizes":[145],"most":[146],"proposed":[151,208],"so":[152],"far.":[153],"Next,":[154],"study":[156,203],"how":[157,182,189],"rules":[158,183],"activate":[160,185],"each":[161,186],"other":[162,187],"define":[164],"a":[165,196,233],"more":[166],"powerful":[167],"safety":[170,177,217],"This":[172],"criterion":[173,218],"uses":[174],"so-called":[176],"some":[193],"rule":[197],"limits":[198],"its":[199],"activation.":[200],"We":[201],"also":[202],"application":[205],"bound":[211,228],"queries":[212],"show":[214],"that":[215],"well-suited":[220],"relevant":[223],"classes":[224,236],"queries.":[229],"Finally,":[230],"propose":[232],"hierarchy":[234],"terminating":[238],"k-safety":[241],"where":[243],"k":[245,252],"-safe":[246],"class":[247],"strictly":[248],"includes":[249],"(":[251],"-1)-safe":[253],"class.":[254]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2020-11-23T00:00:00"}