{"id":"https://openalex.org/W2121932590","doi":"https://doi.org/10.1017/s1471068404002017","title":"cTI: a constraint-based termination inference tool for ISO-Prolog","display_name":"cTI: a constraint-based termination inference tool for ISO-Prolog","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2121932590","doi":"https://doi.org/10.1017/s1471068404002017","mag":"2121932590"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068404002017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002017","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":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5106430092","display_name":"Fred Mesnard","orcid":null},"institutions":[{"id":"https://openalex.org/I24715933","display_name":"University of Reunion Island","ror":"https://ror.org/005ypkf75","country_code":"RE","type":"education","lineage":["https://openalex.org/I24715933"]},{"id":"https://openalex.org/I4210164187","display_name":"Observatoire des Sciences de l'Univers de la R\u00e9union","ror":"https://ror.org/05mv3tj33","country_code":"RE","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I1327553481","https://openalex.org/I154202486","https://openalex.org/I24715933","https://openalex.org/I2799535048","https://openalex.org/I2802818602","https://openalex.org/I4210088668","https://openalex.org/I4210090127","https://openalex.org/I4210113730","https://openalex.org/I4210113730","https://openalex.org/I4210131494","https://openalex.org/I4210148025","https://openalex.org/I4210164187","https://openalex.org/I4210166444","https://openalex.org/I4405257220"]}],"countries":["RE"],"is_corresponding":false,"raw_author_name":"FRED MESNARD","raw_affiliation_strings":["Iremia, Universit\u00e9 de La R\u00e9union, Saint Denis, France (e-mail:","Iremia, Universit\u00e9 de La R\u00e9union, Saint Denis, France (e-mail: fred@univ-reunion.fr)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Iremia, Universit\u00e9 de La R\u00e9union, Saint Denis, France (e-mail:","institution_ids":["https://openalex.org/I4210164187"]},{"raw_affiliation_string":"Iremia, Universit\u00e9 de La R\u00e9union, Saint Denis, France (e-mail: fred@univ-reunion.fr)","institution_ids":["https://openalex.org/I24715933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057370941","display_name":"Roberto Bagnara","orcid":"https://orcid.org/0000-0002-6163-6278"},"institutions":[{"id":"https://openalex.org/I124601658","display_name":"University of Parma","ror":"https://ror.org/02k7wn190","country_code":"IT","type":"education","lineage":["https://openalex.org/I124601658"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"ROBERTO BAGNARA","raw_affiliation_strings":["Department of Mathematics, University of Parma, Italy (e-mail:","Department of Mathematics, University of Parma, Italy (e-mail: bagnara@cs.unipr.it)#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Parma, Italy (e-mail:","institution_ids":["https://openalex.org/I124601658"]},{"raw_affiliation_string":"Department of Mathematics, University of Parma, Italy (e-mail: bagnara@cs.unipr.it)#TAB#","institution_ids":["https://openalex.org/I124601658"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4651,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.95621362,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"5","issue":"1-2","first_page":"243","last_page":"257"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9995999932289124,"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.9995999932289124,"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"}},{"id":"https://openalex.org/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9908999800682068,"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/computer-science","display_name":"Computer science","score":0.8850370645523071},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.8472340703010559},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.7035150527954102},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.6760612726211548},{"id":"https://openalex.org/keywords/inference","display_name":"Inference","score":0.6604868173599243},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6345216035842896},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5357515215873718},{"id":"https://openalex.org/keywords/rule-of-inference","display_name":"Rule of inference","score":0.5114220976829529},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.47363772988319397},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15663743019104004},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10145840048789978}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8850370645523071},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.8472340703010559},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.7035150527954102},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.6760612726211548},{"id":"https://openalex.org/C2776214188","wikidata":"https://www.wikidata.org/wiki/Q408386","display_name":"Inference","level":2,"score":0.6604868173599243},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6345216035842896},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5357515215873718},{"id":"https://openalex.org/C3746660","wikidata":"https://www.wikidata.org/wiki/Q1068763","display_name":"Rule of inference","level":2,"score":0.5114220976829529},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.47363772988319397},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15663743019104004},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10145840048789978},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068404002017","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068404002017","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:CiteSeerX.psu:10.1.1.3.550","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.unipr.it/~bagnara/Papers/PostScript/600dpi/TPLP05b-600DPI.ps.gz","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","display_name":"Quality Education","score":0.4699999988079071}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W90306608","https://openalex.org/W127549542","https://openalex.org/W185947355","https://openalex.org/W1479857163","https://openalex.org/W1480610117","https://openalex.org/W1487657751","https://openalex.org/W1496121453","https://openalex.org/W1497669095","https://openalex.org/W1513445487","https://openalex.org/W1524883003","https://openalex.org/W1533194915","https://openalex.org/W1533556407","https://openalex.org/W1552938934","https://openalex.org/W1553082912","https://openalex.org/W1558066556","https://openalex.org/W1584490456","https://openalex.org/W1586790674","https://openalex.org/W1589232796","https://openalex.org/W1595402260","https://openalex.org/W1597918680","https://openalex.org/W1607985220","https://openalex.org/W1617855441","https://openalex.org/W1627011610","https://openalex.org/W1785533761","https://openalex.org/W1875104636","https://openalex.org/W1899458625","https://openalex.org/W1982243747","https://openalex.org/W1993129359","https://openalex.org/W1996679397","https://openalex.org/W1999783590","https://openalex.org/W2009286786","https://openalex.org/W2010266648","https://openalex.org/W2011889853","https://openalex.org/W2013417779","https://openalex.org/W2015209525","https://openalex.org/W2027319813","https://openalex.org/W2034797403","https://openalex.org/W2057821410","https://openalex.org/W2081810835","https://openalex.org/W2120869002","https://openalex.org/W2126384248","https://openalex.org/W2132661148","https://openalex.org/W2152685301","https://openalex.org/W2340735175","https://openalex.org/W2491413729","https://openalex.org/W2911575043"],"related_works":["https://openalex.org/W1999702466","https://openalex.org/W1481700938","https://openalex.org/W2741053223","https://openalex.org/W1493824320","https://openalex.org/W592311106","https://openalex.org/W4319165641","https://openalex.org/W2972366161","https://openalex.org/W4380901377","https://openalex.org/W1977834309","https://openalex.org/W2003151706"],"abstract_inverted_index":{"We":[0,87],"present":[1],"cTI,":[2],"the":[3,40,50,57,89,100,107],"first":[4],"system":[5,101],"for":[6,42,80],"universal":[7],"left-termination":[8],"inference":[9,14],"of":[10,31,46,59,61,91,99,116],"logic":[11,108],"programs.":[12],"Termination":[13,65],"generalizes":[15],"termination":[16,22,110],"analysis":[17,51],"and":[18,93,112,119],"checking.":[19],"Traditionally,":[20],"a":[21,28],"analyzer":[23],"tries":[24],"to":[25,39],"prove":[26],"that":[27],"given":[29],"class":[30,35,58],"queries":[32,60],"terminates.":[33],"This":[34],"must":[36,52],"be":[37,53],"provided":[38],"system,":[41],"instance":[43],"by":[44],"means":[45],"user":[47,71],"annotations.":[48],"Moreover,":[49],"redone":[54],"every":[55],"time":[56],"interest":[62],"is":[63],"updated.":[64],"inference,":[66],"in":[67],"contrast,":[68],"requires":[69],"neither":[70],"annotations":[72],"nor":[73],"recomputation.":[74],"In":[75],"this":[76],"approach,":[77],"terminating":[78],"classes":[79],"all":[81],"predicates":[82],"are":[83],"inferred":[84],"at":[85],"once.":[86],"describe":[88],"architecture":[90],"cTI":[92],"report":[94],"an":[95],"extensive":[96],"experimental":[97],"evaluation":[98],"covering":[102],"many":[103],"classical":[104],"examples":[105],"from":[106],"programming":[109],"literature":[111],"several":[113],"Prolog":[114],"programs":[115],"respectable":[117],"size":[118],"complexity.":[120]},"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}