{"id":"https://openalex.org/W2284989774","doi":"https://doi.org/10.1017/s1471068416000077","title":"Using linear constraints for logic program termination analysis","display_name":"Using linear constraints for logic program termination analysis","publication_year":2016,"publication_date":"2016-03-31","ids":{"openalex":"https://openalex.org/W2284989774","doi":"https://doi.org/10.1017/s1471068416000077","mag":"2284989774"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068416000077","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000077","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/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"MARCO CALAUTTI","orcid":null},"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 (e-mail:"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende(CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"display_name":"SERGIO GRECO","orcid":null},"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 (e-mail:"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende(CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"middle","author":{"id":null,"display_name":"CRISTIAN MOLINARO","orcid":null},"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":"CRISTIAN MOLINARO","raw_affiliation_strings":["DIMES, Universit\u00e0 della Calabria, 87036 Rende(CS), Italy (e-mail:"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende(CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]},{"author_position":"last","author":{"id":null,"display_name":"IRINA TRUBITSYNA","orcid":null},"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 (e-mail:"],"affiliations":[{"raw_affiliation_string":"DIMES, Universit\u00e0 della Calabria, 87036 Rende(CS), Italy (e-mail:","institution_ids":["https://openalex.org/I45204951"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I45204951"],"apc_list":null,"apc_paid":null,"fwci":0.4444,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.77811147,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"16","issue":"3","first_page":"353","last_page":"377"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9538999795913696,"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.9538999795913696,"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.01730000041425228,"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/T10906","display_name":"AI-based Problem Solving and Planning","score":0.00559999980032444,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6209999918937683},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5758000016212463},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.5755000114440918},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5329999923706055},{"id":"https://openalex.org/keywords/logic-program","display_name":"Logic program","score":0.5315999984741211},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.5285999774932861},{"id":"https://openalex.org/keywords/current","display_name":"Current (fluid)","score":0.3801000118255615},{"id":"https://openalex.org/keywords/expressivity","display_name":"Expressivity","score":0.37380000948905945}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8870999813079834},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6209999918937683},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5758000016212463},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.5755000114440918},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5329999923706055},{"id":"https://openalex.org/C2987117450","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic program","level":3,"score":0.5315999984741211},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.5285999774932861},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5249999761581421},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5146999955177307},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3935999870300293},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.3801000118255615},{"id":"https://openalex.org/C92811239","wikidata":"https://www.wikidata.org/wiki/Q20998670","display_name":"Expressivity","level":2,"score":0.37380000948905945},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3492000102996826},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.34709998965263367},{"id":"https://openalex.org/C2778361913","wikidata":"https://www.wikidata.org/wiki/Q7248437","display_name":"Program transformation","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C182620335","wikidata":"https://www.wikidata.org/wiki/Q2852531","display_name":"Answer set programming","level":3,"score":0.2937000095844269},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C4777664","wikidata":"https://www.wikidata.org/wiki/Q1536492","display_name":"Linear temporal logic","level":2,"score":0.2752000093460083},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.2750000059604645},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.27070000767707825},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.2599000036716461}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1017/s1471068416000077","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068416000077","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/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","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, Molinaro, C & Trubitsyna, I 2016, 'Using linear constraints for logic program termination analysis', Theory and Practice of Logic Programming, vol. 16, no. 3, pp. 353\u2013377. https://doi.org/10.1017/S1471068416000077","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1512.04097","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1512.04097","pdf_url":"https://arxiv.org/pdf/1512.04097","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:air.unimi.it:2434/953308","is_oa":true,"landing_page_url":"https://hdl.handle.net/2434/953308","pdf_url":null,"source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"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":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:iris.unitn.it:11572/260171","is_oa":true,"landing_page_url":"http://hdl.handle.net/11572/260171","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/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","is_oa":true,"landing_page_url":"https://www.cambridge.org/core/journals/theory-and-practice-of-logic-programming/article/using-linear-constraints-for-logic-program-termination-analysis/7BCE150038EBE2AB845D3A0E905CB73B","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Calautti, M, Greco, S, Molinaro, C & Trubitsyna, I 2016, 'Using linear constraints for logic program termination analysis', Theory and Practice of Logic Programming, vol. 16, no. 3, pp. 353\u2013377. https://doi.org/10.1017/S1471068416000077","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/fd8a7722-e0c4-47ae-a0c3-6e733814f53a","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, Molinaro, C & Trubitsyna, I 2016, 'Using linear constraints for logic program termination analysis', Theory and Practice of Logic Programming, vol. 16, no. 3, pp. 353\u2013377. https://doi.org/10.1017/S1471068416000077","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W649907208","https://openalex.org/W1484110122","https://openalex.org/W1488953560","https://openalex.org/W1509428113","https://openalex.org/W1552168992","https://openalex.org/W1573720519","https://openalex.org/W1579524364","https://openalex.org/W1590284853","https://openalex.org/W1672891595","https://openalex.org/W1875104636","https://openalex.org/W1965483956","https://openalex.org/W1969833016","https://openalex.org/W2002483665","https://openalex.org/W2009286786","https://openalex.org/W2013130775","https://openalex.org/W2029399717","https://openalex.org/W2038040550","https://openalex.org/W2044152416","https://openalex.org/W2051564255","https://openalex.org/W2057035741","https://openalex.org/W2066734765","https://openalex.org/W2070546615","https://openalex.org/W2076698873","https://openalex.org/W2078854256","https://openalex.org/W2085386651","https://openalex.org/W2090855107","https://openalex.org/W2097474199","https://openalex.org/W2103658959","https://openalex.org/W2108205915","https://openalex.org/W2128219525","https://openalex.org/W2129825950","https://openalex.org/W2135520900","https://openalex.org/W2136514805","https://openalex.org/W2137327104","https://openalex.org/W2141104250","https://openalex.org/W2170550263","https://openalex.org/W2171446564","https://openalex.org/W2193726304","https://openalex.org/W2290835149","https://openalex.org/W2786353107","https://openalex.org/W2911543830","https://openalex.org/W2963676309","https://openalex.org/W6638498301","https://openalex.org/W6712605798"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"It":[1],"is":[2,39,56,77,84],"widely":[3],"acknowledged":[4],"that":[5,40],"function":[6,75],"symbols":[7,76],"are":[8,137,160],"an":[9],"important":[10],"feature":[11],"in":[12,92],"answer":[13],"set":[14],"programming,":[15],"as":[16],"they":[17],"make":[18],"modelling":[19],"easier,":[20],"increase":[21],"the":[22,41,72,80,87,112,140,143,149,151,154,157],"expressive":[23],"power,":[24],"and":[25,49,117,153],"allow":[26],"us":[27],"to":[28,142],"deal":[29],"with":[30,36,60],"infinite":[31],"domains.":[32],"The":[33],"main":[34],"issue":[35],"their":[37],"introduction":[38],"evaluation":[42,82,105],"of":[43,65,74,90,115,125,134,145,156],"a":[44,130],"program":[45,81],"might":[46],"not":[47,55,98],"terminate":[48],"checking":[50],"whether":[51],"it":[52],"terminates":[53],"or":[54],"undecidable.":[57],"To":[58],"cope":[59],"this":[61,93,108],"problem,":[62],"several":[63],"classes":[64,114],"logic":[66],"programs":[67,103,119],"have":[68],"been":[69],"proposed":[70,158],"where":[71],"use":[73],"restricted":[78],"but":[79],"termination":[83],"guaranteed.":[85],"Despite":[86],"significant":[88],"body":[89,141],"work":[91],"area,":[94],"current":[95,126],"approaches":[96,127],"do":[97],"include":[99],"many":[100],"simple":[101],"practical":[102],"whose":[104],"terminates.":[106],"In":[107],"paper,":[109],"we":[110],"present":[111],"novel":[113],"rule-bounded":[116],"cycle-bounded":[118],",":[120],"which":[121],"overcome":[122],"different":[123],"limitations":[124],"by":[128],"performing":[129],"more":[131],"global":[132],"analysis":[133],"how":[135],"terms":[136],"propagated":[138],"from":[139],"head":[144],"rules.":[146],"Results":[147],"on":[148],"correctness,":[150],"complexity,":[152],"expressivity":[155],"approach":[159],"provided.":[161]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}