{"id":"https://openalex.org/W2070546615","doi":"https://doi.org/10.1145/1216374.1216378","title":"Termination analysis of logic programs through combination of type-based norms","display_name":"Termination analysis of logic programs through combination of type-based norms","publication_year":2007,"publication_date":"2007-04-01","ids":{"openalex":"https://openalex.org/W2070546615","doi":"https://doi.org/10.1145/1216374.1216378","mag":"2070546615"},"language":"en","primary_location":{"id":"doi:10.1145/1216374.1216378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1216374.1216378","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1216374.1216378","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/1216374.1216378","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004343076","display_name":"Maurice Bruynooghe","orcid":"https://orcid.org/0000-0002-6881-1462"},"institutions":[{"id":"https://openalex.org/I99464096","display_name":"KU Leuven","ror":"https://ror.org/05f950310","country_code":"BE","type":"education","lineage":["https://openalex.org/I99464096"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Maurice Bruynooghe","raw_affiliation_strings":["Katholieke Universiteit Leuven, Heverlee, Belgium","Katholieke Universiteit Leuven, Heverlee Belgium#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Katholieke Universiteit Leuven, Heverlee, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Katholieke Universiteit Leuven, Heverlee Belgium#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5063747415","display_name":"Michael Codish","orcid":"https://orcid.org/0000-0003-0394-5854"},"institutions":[{"id":"https://openalex.org/I124227911","display_name":"Ben-Gurion University of the Negev","ror":"https://ror.org/05tkyf982","country_code":"IL","type":"education","lineage":["https://openalex.org/I124227911"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michael Codish","raw_affiliation_strings":["Ben-Gurion University of the Negev, Beer-Sheva, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ben-Gurion University of the Negev, Beer-Sheva, Israel","institution_ids":["https://openalex.org/I124227911"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020698393","display_name":"John P. Gallagher","orcid":"https://orcid.org/0000-0001-6984-7419"},"institutions":[{"id":"https://openalex.org/I107707843","display_name":"Roskilde University","ror":"https://ror.org/014axpa37","country_code":"DK","type":"education","lineage":["https://openalex.org/I107707843"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"John P. Gallagher","raw_affiliation_strings":["Roskilde University, Roskilde, Denmark","(Roskilde University, Roskilde, Denmark)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Roskilde University, Roskilde, Denmark","institution_ids":["https://openalex.org/I107707843"]},{"raw_affiliation_string":"(Roskilde University, Roskilde, Denmark)","institution_ids":["https://openalex.org/I107707843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014510097","display_name":"Samir Genaim","orcid":"https://orcid.org/0000-0002-7176-1881"},"institutions":[{"id":"https://openalex.org/I88060688","display_name":"Universidad Polit\u00e9cnica de Madrid","ror":"https://ror.org/03n6nwv02","country_code":"ES","type":"education","lineage":["https://openalex.org/I88060688"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Samir Genaim","raw_affiliation_strings":["Universidad Polit\u00e9cnica de Madrid, Madrid, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad Polit\u00e9cnica de Madrid, Madrid, Spain","institution_ids":["https://openalex.org/I88060688"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5006632551","display_name":"Wim Vanhoof","orcid":"https://orcid.org/0000-0003-3769-6294"},"institutions":[{"id":"https://openalex.org/I149768937","display_name":"University of Namur","ror":"https://ror.org/03d1maw17","country_code":"BE","type":"education","lineage":["https://openalex.org/I149768937"]}],"countries":["BE"],"is_corresponding":false,"raw_author_name":"Wim Vanhoof","raw_affiliation_strings":["University of Namur, Namur, Belgium","University of Namur; Namur; Belgium"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Namur, Namur, Belgium","institution_ids":["https://openalex.org/I149768937"]},{"raw_affiliation_string":"University of Namur; Namur; Belgium","institution_ids":["https://openalex.org/I149768937"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":13.4117,"has_fulltext":true,"cited_by_count":71,"citation_normalized_percentile":{"value":0.98518414,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":"29","issue":"2","first_page":"10","last_page":"10"},"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.9997000098228455,"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.9997000098228455,"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.9993000030517578,"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.9950000047683716,"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.831302285194397},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.7117049098014832},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5496096611022949},{"id":"https://openalex.org/keywords/norm","display_name":"Norm (philosophy)","score":0.5483057498931885},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.509844958782196},{"id":"https://openalex.org/keywords/program-analysis","display_name":"Program analysis","score":0.49880480766296387},{"id":"https://openalex.org/keywords/semantics","display_name":"Semantics (computer science)","score":0.47476649284362793},{"id":"https://openalex.org/keywords/static-analysis","display_name":"Static analysis","score":0.4391572177410126},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4104557931423187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39677420258522034},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1348608136177063}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.831302285194397},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.7117049098014832},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5496096611022949},{"id":"https://openalex.org/C191795146","wikidata":"https://www.wikidata.org/wiki/Q3878446","display_name":"Norm (philosophy)","level":2,"score":0.5483057498931885},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.509844958782196},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.49880480766296387},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.47476649284362793},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.4391572177410126},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4104557931423187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39677420258522034},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1348608136177063},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1216374.1216378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1216374.1216378","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1216374.1216378","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},{"id":"pmh:oai:pure.unamur.be:openaire_cris_publications/6d727773-27fb-463c-b438-213e1ec1fb7e","is_oa":false,"landing_page_url":"https://researchportal.unamur.be/en/publications/6d727773-27fb-463c-b438-213e1ec1fb7e","pdf_url":null,"source":{"id":"https://openalex.org/S4406922457","display_name":"Repository of the University of Namur","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bruynooghe, M, Codish, M, Gallagher, J P, Genaim, S & Vanhoof, W 2007, 'Termination analysis of logic programs through combination of type-based norms', ACM Transactions on Programming Languages and Systems, vol. 29, no. 2. https://doi.org/10.1145/1216374.1216378","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/124239","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/124239","pdf_url":null,"source":{"id":"https://openalex.org/S7407055369","display_name":"Lirias","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"ACM transactions on programming languages and systems, vol. 29 (2), Art.No. ARTN 10, (1-44)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.4388","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.4388","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.kuleuven.be/~dtai/publications/files/41830.pdf","raw_type":"text"},{"id":"pmh:oai:dial.uclouvain.be:boreal:101502","is_oa":false,"landing_page_url":"http://hdl.handle.net/2078.2/101502","pdf_url":null,"source":{"id":"https://openalex.org/S4306401974","display_name":"DIAL (Catholic University of Leuven)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I99464096","host_organization_name":"KU Leuven","host_organization_lineage":["https://openalex.org/I99464096"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Programming Languages and Systems, Vol. 29, no. 2 (2007)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/eb80c3b0-0325-11dc-825a-000ea68e967b","is_oa":false,"landing_page_url":"http://portal.acm.org/citation.cfm?doid=1216374.1216378","pdf_url":null,"source":{"id":"https://openalex.org/S4306401457","display_name":"RUCforsk (Roskilde University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I107707843","host_organization_name":"Roskilde University","host_organization_lineage":["https://openalex.org/I107707843"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bruynooghe, M, Codish, M, Gallagher, J P, Genaim, S & Vanhoof, W 2007, 'Termination analysis of logic programs through combination of type-based norms', ACM Transactions on Programming Languages and Systems, vol. 29, no. 2. < http://portal.acm.org/citation.cfm?doid=1216374.1216378 >","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/1216374.1216378","is_oa":true,"landing_page_url":"https://doi.org/10.1145/1216374.1216378","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/1216374.1216378","source":{"id":"https://openalex.org/S41449414","display_name":"ACM Transactions on Programming Languages and Systems","issn_l":"0164-0925","issn":["0164-0925","1558-4593"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Programming Languages and Systems","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320324120","display_name":"Universit\u00e0 degli Studi di Verona","ror":"https://ror.org/039bp8j42"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2070546615.pdf","grobid_xml":"https://content.openalex.org/works/W2070546615.grobid-xml"},"referenced_works_count":59,"referenced_works":["https://openalex.org/W22766926","https://openalex.org/W31561947","https://openalex.org/W61686890","https://openalex.org/W68738721","https://openalex.org/W93035675","https://openalex.org/W284389283","https://openalex.org/W635557121","https://openalex.org/W1481041911","https://openalex.org/W1484554695","https://openalex.org/W1485053244","https://openalex.org/W1491884928","https://openalex.org/W1495626710","https://openalex.org/W1503837378","https://openalex.org/W1507967078","https://openalex.org/W1524883003","https://openalex.org/W1530717542","https://openalex.org/W1540904225","https://openalex.org/W1551097966","https://openalex.org/W1558952152","https://openalex.org/W1565933208","https://openalex.org/W1584490456","https://openalex.org/W1588685584","https://openalex.org/W1597504980","https://openalex.org/W1597918680","https://openalex.org/W1605195718","https://openalex.org/W1605391485","https://openalex.org/W1605586974","https://openalex.org/W1753357466","https://openalex.org/W1834328158","https://openalex.org/W1982243747","https://openalex.org/W1993129359","https://openalex.org/W1996679397","https://openalex.org/W1999320791","https://openalex.org/W2003914809","https://openalex.org/W2014030742","https://openalex.org/W2023578426","https://openalex.org/W2031373197","https://openalex.org/W2038037493","https://openalex.org/W2085832943","https://openalex.org/W2094283454","https://openalex.org/W2095689360","https://openalex.org/W2106356822","https://openalex.org/W2120869002","https://openalex.org/W2125364400","https://openalex.org/W2132661148","https://openalex.org/W2135681149","https://openalex.org/W2143441770","https://openalex.org/W2143645917","https://openalex.org/W2143961073","https://openalex.org/W2148363954","https://openalex.org/W2519374515","https://openalex.org/W2748837517","https://openalex.org/W2798428635","https://openalex.org/W2913865624","https://openalex.org/W4233310630","https://openalex.org/W4289767071","https://openalex.org/W6603731656","https://openalex.org/W6635711394","https://openalex.org/W6635918241"],"related_works":["https://openalex.org/W2867457158","https://openalex.org/W4297908618","https://openalex.org/W2765641823","https://openalex.org/W3111646971","https://openalex.org/W2895825088","https://openalex.org/W4387793661","https://openalex.org/W2970480852","https://openalex.org/W3186878187","https://openalex.org/W1843794072","https://openalex.org/W2354385412"],"abstract_inverted_index":{"This":[0,48,79,118],"article":[1],"makes":[2],"two":[3,101],"contributions":[4,102,127],"to":[5,36,68,88,152],"the":[6,41,61,73,90,96,100,107,110],"work":[7],"on":[8,72],"semantics-based":[9],"termination":[10,70,91,134],"analysis":[11,147],"for":[12,27,56,114],"logic":[13],"programs.":[14],"The":[15,63],"first":[16],"involves":[17],"a":[18,28,31,39,50,115,121,132,144],"novel":[19],"notion":[20],"of":[21,43,45,52,75,92,95,99,109],"type":[22,58],"-":[23],"based":[24],"norm":[25,33],"where":[26],"given":[29,116],"type,":[30],"corresponding":[32],"is":[34,80],"defined":[35,59],"count":[37],"in":[38,60,105,120,143],"term":[40],"number":[42],"subterms":[44],"that":[46,138,154],"type.":[47],"provides":[49],"collection":[51],"candidate":[53,112],"norms,":[54],"one":[55],"each":[57],"program.":[62,97,117],"second":[64],"enables":[65],"an":[66],"analyzer":[67],"base":[69],"proofs":[71],"combination":[74,108],"several":[76],"different":[77,83,93],"norms.":[78,162],"useful":[81],"when":[82],"norms":[84,113],"are":[85],"better":[86],"suited":[87],"justify":[89],"parts":[94],"Application":[98],"together":[103],"consists":[104],"considering":[106],"type-based":[111],"results":[119,142],"powerful":[122],"and":[123,160],"practical":[124],"technique.":[125],"Both":[126],"have":[128],"been":[129],"introduced":[130],"into":[131],"working":[133],"analyzer.":[135],"Experimentation":[136],"indicates":[137],"they":[139],"yield":[140],"state-of-the-art":[141],"fully":[145],"automatic":[146],"tool,":[148],"improving":[149],"with":[150],"respect":[151],"methods":[153],"do":[155],"not":[156],"use":[157],"both":[158],"types":[159],"combined":[161]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":11},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}
