{"id":"https://openalex.org/W2119843185","doi":"https://doi.org/10.1017/s1471068410000025","title":"<tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs","display_name":"<tt>Polytool</tt>: Polynomial interpretations as a basis for termination analysis of logic programs","publication_year":2010,"publication_date":"2010-02-25","ids":{"openalex":"https://openalex.org/W2119843185","doi":"https://doi.org/10.1017/s1471068410000025","mag":"2119843185"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068410000025","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000025","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":true,"oa_status":"green","oa_url":"https://lirias.kuleuven.be/handle/123456789/259235","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028043061","display_name":"Manh Thang Nguyen","orcid":"https://orcid.org/0000-0002-1269-8229"},"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":true,"raw_author_name":"MANH THANG NGUYEN","raw_affiliation_strings":["Department of Computer Science, K. U. Leuven Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail:","Department of computer science, k. u. leuven celestijnenlaan 200a, b-3001, heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.be)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, K. U. Leuven Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of computer science, k. u. leuven celestijnenlaan 200a, b-3001, heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.be)#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5024311222","display_name":"Danny De Schreye","orcid":"https://orcid.org/0000-0002-8423-8598"},"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":"DANNY DE SCHREYE","raw_affiliation_strings":["Department of Computer Science, K. U. Leuven Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail:","Department of computer science, k. u. leuven celestijnenlaan 200a, b-3001, heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.be)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, K. U. Leuven Celestijnenlaan 200A, B-3001, Heverlee, Belgium (e-mail:","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of computer science, k. u. leuven celestijnenlaan 200a, b-3001, heverlee, belgium (e-mail: danny.deschreye@cs.kuleuven.be)#TAB#","institution_ids":["https://openalex.org/I99464096"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025232172","display_name":"J\u00fcrgen Giesl","orcid":"https://orcid.org/0000-0003-0283-8520"},"institutions":[{"id":"https://openalex.org/I887968799","display_name":"RWTH Aachen University","ror":"https://ror.org/04xfq0f34","country_code":"DE","type":"education","lineage":["https://openalex.org/I887968799"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"J\u00dcRGEN GIESL","raw_affiliation_strings":["LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany (e-mail:","LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany (e-mail: giesl@informatik.rwth-aachen.de)#TAB#"],"affiliations":[{"raw_affiliation_string":"LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany (e-mail:","institution_ids":["https://openalex.org/I887968799"]},{"raw_affiliation_string":"LuFG Informatik II, RWTH Aachen, Ahornstr. 55, 52074 Aachen, Germany (e-mail: giesl@informatik.rwth-aachen.de)#TAB#","institution_ids":["https://openalex.org/I887968799"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058200123","display_name":"Peter Schneider\u2013Kamp","orcid":"https://orcid.org/0000-0003-4000-5570"},"institutions":[{"id":"https://openalex.org/I177969490","display_name":"University of Southern Denmark","ror":"https://ror.org/03yrrjy16","country_code":"DK","type":"education","lineage":["https://openalex.org/I177969490"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"PETER SCHNEIDER-KAMP","raw_affiliation_strings":["Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark (e-mail:","Department of mathematics and computer science, university of southern denmark, campusvej 55, dk-5230 odense m, denmark (e-mail: petersk@imada.sdu.dk)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Computer Science, University of Southern Denmark, Campusvej 55, DK-5230 Odense M, Denmark (e-mail:","institution_ids":["https://openalex.org/I177969490"]},{"raw_affiliation_string":"Department of mathematics and computer science, university of southern denmark, campusvej 55, dk-5230 odense m, denmark (e-mail: petersk@imada.sdu.dk)#TAB#","institution_ids":["https://openalex.org/I177969490"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5028043061"],"corresponding_institution_ids":["https://openalex.org/I99464096"],"apc_list":null,"apc_paid":null,"fwci":5.574,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.95734396,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"11","issue":"1","first_page":"33","last_page":"63"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":1.0,"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":1.0,"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.9998999834060669,"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.996999979019165,"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.8003261685371399},{"id":"https://openalex.org/keywords/basis","display_name":"Basis (linear algebra)","score":0.6679538488388062},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4163036644458771},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3611944317817688},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12112930417060852},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.04366880655288696}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8003261685371399},{"id":"https://openalex.org/C12426560","wikidata":"https://www.wikidata.org/wiki/Q189569","display_name":"Basis (linear algebra)","level":2,"score":0.6679538488388062},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4163036644458771},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3611944317817688},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12112930417060852},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.04366880655288696},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s1471068410000025","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068410000025","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:sdu.dk:openaire_cris_publications/1b2d7e9e-8e4f-4a05-9a04-bc9380a9e318","is_oa":false,"landing_page_url":"https://portal.findresearcher.sdu.dk/da/publications/1b2d7e9e-8e4f-4a05-9a04-bc9380a9e318","pdf_url":null,"source":{"id":"https://openalex.org/S4306400423","display_name":"University of Southern Denmark Research Portal (University of Southern Denmark)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I177969490","host_organization_name":"University of Southern Denmark","host_organization_lineage":["https://openalex.org/I177969490"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Nguyen, M T, De Schreye, D, Giesl, J & Schneider-Kamp, P 2011, 'Polytool: Polynomial Interpretations as a Basis for Termination Analysis of Logic Programs', Theory and Practice of Logic Programming, vol. 11, pp. 33-63. https://doi.org/10.1017/S1471068410000025","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/259235","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/259235","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU 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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 11 (01), (33-63)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/259235","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/259235","pdf_url":null,"source":{"id":"https://openalex.org/S4306401954","display_name":"Lirias (KU 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":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Theory and Practice of Logic Programming, vol. 11 (01), (33-63)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320321730","display_name":"Fonds Wetenschappelijk Onderzoek","ror":"https://ror.org/03qtxy027"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":52,"referenced_works":["https://openalex.org/W10593442","https://openalex.org/W31561947","https://openalex.org/W39866887","https://openalex.org/W80286208","https://openalex.org/W91193428","https://openalex.org/W93035675","https://openalex.org/W111009595","https://openalex.org/W1483865431","https://openalex.org/W1484559376","https://openalex.org/W1489253037","https://openalex.org/W1491884928","https://openalex.org/W1496103894","https://openalex.org/W1499823109","https://openalex.org/W1530752153","https://openalex.org/W1541434994","https://openalex.org/W1566656731","https://openalex.org/W1574704561","https://openalex.org/W1582592616","https://openalex.org/W1584490456","https://openalex.org/W1605391485","https://openalex.org/W1748718887","https://openalex.org/W1808570911","https://openalex.org/W1820313840","https://openalex.org/W1865089979","https://openalex.org/W1968386045","https://openalex.org/W1988455648","https://openalex.org/W1994958005","https://openalex.org/W1996679397","https://openalex.org/W2001932052","https://openalex.org/W2011889853","https://openalex.org/W2069076448","https://openalex.org/W2070546615","https://openalex.org/W2079925704","https://openalex.org/W2090855107","https://openalex.org/W2109150047","https://openalex.org/W2111739714","https://openalex.org/W2121932590","https://openalex.org/W2132750992","https://openalex.org/W2137327104","https://openalex.org/W2141171354","https://openalex.org/W2141604945","https://openalex.org/W2143645917","https://openalex.org/W2149605327","https://openalex.org/W2168096396","https://openalex.org/W2171834275","https://openalex.org/W2497449838","https://openalex.org/W2504992661","https://openalex.org/W2612793397","https://openalex.org/W2911880377","https://openalex.org/W4206370914","https://openalex.org/W4285719527","https://openalex.org/W6758080311"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Abstract":[0],"Our":[1,86],"goal":[2],"is":[3],"to":[4,18,27,58,90,105],"study":[5],"the":[6,39,70,106,124],"feasibility":[7],"of":[8,41,69,76,97,108,143],"porting":[9],"termination":[10,29,48,74,103,125,141],"analysis":[11,30,49,75,104,142],"techniques":[12,31,50,72],"developed":[13],"for":[14,51,117,139],"one":[15],"programming":[16],"paradigm":[17],"another":[19],"paradigm.":[20],"In":[21],"this":[22,129],"paper,":[23],"we":[24,131],"show":[25],"how":[26],"adapt":[28],"based":[32],"on":[33,102,128],"polynomial":[34,109,120],"interpretations\u2014very":[35],"well":[36],"known":[37],"in":[38,73],"context":[40,107],"term":[42],"rewrite":[43],"systems\u2014to":[44],"obtain":[45],"new":[46,134],"(nontransformational)":[47],"definite":[52],"logic":[53],"programs":[54],"(LPs).":[55],"This":[56],"leads":[57],"an":[59],"approach":[60,116],"that":[61,122],"can":[62],"be":[63],"seen":[64],"as":[65],"a":[66,95,114,133],"direct":[67],"generalization":[68],"traditional":[71],"LPs,":[77],"where":[78],"linear":[79],"norms":[80],"and":[81,100],"level":[82],"mappings":[83],"are":[84],"used.":[85],"extension":[87],"generalizes":[88],"these":[89],"arbitrary":[91],"polynomials.":[92],"We":[93,111],"extend":[94],"number":[96],"standard":[98],"concepts":[99],"results":[101],"interpretations.":[110],"also":[112],"propose":[113],"constraint-based":[115],"automatically":[118],"generating":[119],"interpretations":[121],"satisfy":[123],"conditions.":[126],"Based":[127],"approach,":[130],"implemented":[132],"tool,":[135],"called":[136],"Polytool":[137],",":[138],"automatic":[140],"LPs.":[144]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}