{"id":"https://openalex.org/W1985455954","doi":"https://doi.org/10.1017/s1471068413000446","title":"A practical analysis of non-termination in large logic programs","display_name":"A practical analysis of non-termination in large logic programs","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W1985455954","doi":"https://doi.org/10.1017/s1471068413000446","mag":"1985455954"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068413000446","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000446","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/A5018971727","display_name":"Senlin Liang","orcid":null},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"SENLIN LIANG","raw_affiliation_strings":["Department of Computer Science, Stony Brook University, USA (e-mail:","Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stony Brook University, USA (e-mail:","institution_ids":["https://openalex.org/I59553526"]},{"raw_affiliation_string":"Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059918476","display_name":"Michael Kifer","orcid":"https://orcid.org/0000-0003-3177-5792"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"MICHAEL KIFER","raw_affiliation_strings":["Department of Computer Science, Stony Brook University, USA (e-mail:","Stony Brook University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Stony Brook University, USA (e-mail:","institution_ids":["https://openalex.org/I59553526"]},{"raw_affiliation_string":"Stony Brook University","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5018971727"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":4.9439,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.94841109,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"4-5","first_page":"705","last_page":"719"},"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/T10260","display_name":"Software Engineering Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.8855304718017578},{"id":"https://openalex.org/keywords/programmer","display_name":"Programmer","score":0.8100773692131042},{"id":"https://openalex.org/keywords/debugging","display_name":"Debugging","score":0.7622823715209961},{"id":"https://openalex.org/keywords/suite","display_name":"Suite","score":0.6928260922431946},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6324528455734253},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5760941505432129},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.5090219974517822},{"id":"https://openalex.org/keywords/usability","display_name":"Usability","score":0.491105318069458},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40544530749320984},{"id":"https://openalex.org/keywords/human\u2013computer-interaction","display_name":"Human\u2013computer interaction","score":0.21205401420593262}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8855304718017578},{"id":"https://openalex.org/C2778514511","wikidata":"https://www.wikidata.org/wiki/Q1374194","display_name":"Programmer","level":2,"score":0.8100773692131042},{"id":"https://openalex.org/C168065819","wikidata":"https://www.wikidata.org/wiki/Q845566","display_name":"Debugging","level":2,"score":0.7622823715209961},{"id":"https://openalex.org/C79581498","wikidata":"https://www.wikidata.org/wiki/Q1367530","display_name":"Suite","level":2,"score":0.6928260922431946},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6324528455734253},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5760941505432129},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5090219974517822},{"id":"https://openalex.org/C170130773","wikidata":"https://www.wikidata.org/wiki/Q216378","display_name":"Usability","level":2,"score":0.491105318069458},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40544530749320984},{"id":"https://openalex.org/C107457646","wikidata":"https://www.wikidata.org/wiki/Q207434","display_name":"Human\u2013computer interaction","level":1,"score":0.21205401420593262},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C95457728","wikidata":"https://www.wikidata.org/wiki/Q309","display_name":"History","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068413000446","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000446","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.297.4288","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.297.4288","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.sunysb.edu/~sliang/iclp2013-tr.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1507859480","https://openalex.org/W1593317697","https://openalex.org/W1605371072","https://openalex.org/W1808570911","https://openalex.org/W1865089979","https://openalex.org/W1979966822","https://openalex.org/W1984187667","https://openalex.org/W1994584977","https://openalex.org/W2009286786","https://openalex.org/W2014410720","https://openalex.org/W2069453418","https://openalex.org/W2070546615","https://openalex.org/W2084130127","https://openalex.org/W2093737074","https://openalex.org/W2111739714","https://openalex.org/W2128219525","https://openalex.org/W2129825950","https://openalex.org/W2142044962","https://openalex.org/W2144853448","https://openalex.org/W2165876990","https://openalex.org/W2206328804","https://openalex.org/W2502845856","https://openalex.org/W2963711700"],"related_works":["https://openalex.org/W2379153735","https://openalex.org/W4321442002","https://openalex.org/W2046172023","https://openalex.org/W2015265939","https://openalex.org/W2972896947","https://openalex.org/W2168928134","https://openalex.org/W2112040168","https://openalex.org/W4241972157","https://openalex.org/W4242556954","https://openalex.org/W2053897590"],"abstract_inverted_index":{"Abstract":[0],"A":[1,272],"large":[2,172,306],"body":[3],"of":[4,12,93,109,126,135,174,188,203,243,300,305,329,341,364],"work":[5,175],"has":[6,18,275],"been":[7,19,276],"dedicated":[8],"to":[9,21,44,53,70,143,179,355],"termination":[10],"analysis":[11,60],"logic":[13,49,97,353],"programs":[14,50,331],"but":[15],"relatively":[16],"little":[17],"done":[20],"analyze":[22,119],"non":[23],"-termination.":[24],"In":[25,84,320],"our":[26],"opinion,":[27],"explaining":[28],"non-termination":[29,94,112],"is":[30,68,281],"a":[31,41,107,185,224,235,303,324],"much":[32,168],"more":[33,159],"important":[34],"task":[35],"because":[36],"it":[37,360],"can":[38,198,247,361],"dramatically":[39],"improve":[40],"user's":[42],"ability":[43],"effectively":[45],"debug":[46],"large,":[47],"complex":[48],"without":[51],"having":[52],"abide":[54],"by":[55,332],"punishing":[56],"syntactic":[57],"restrictions.":[58],"Non-termination":[59],"examines":[61],"program":[62,67],"execution":[63],"history":[64],"when":[65],"the":[66,75,78,91,132,147,177,210,217,250,257,264,298,351],"suspected":[69],"not":[71,200,349],"terminate":[72],"and":[73,86,105,123,156,216,280],"informs":[74],"programmer":[76],"about":[77],"exact":[79,211],"reasons":[80],"for":[81,111,176,237,256,263,278,284],"this":[82,139,194,314],"behavior.":[83],"Liang":[85],"Kifer":[87],"(2013),":[88],"we":[89,183,322],"studied":[90],"problem":[92],"in":[95,145,152,157,161,223,313],"tabled":[96,127],"engines":[98],"with":[99],"subgoal":[100,128,149,357],"abstraction,":[101,358],"such":[102],"as":[103,234,260,262],"XSB,":[104],"proposed":[106],"suite":[108,187],"algorithms":[110,118],"analysis,":[113],"called":[114],"Terminyzer":[115,165,345],".":[116,290],"These":[117],"forest":[120],"logging":[121],"traces":[122],"output":[124],"sequences":[125,202,219],"calls":[129],"that":[130,205,220,336],"are":[131,316],"likely":[133],"causes":[134,340],"non-terminating":[136,330],"cycles.":[137],"However,":[138],"feedback":[140],"was":[141],"hard":[142],"use":[144,363],"practice:":[146],"same":[148],"could":[150],"occur":[151,215],"multiple":[153],"rule":[154,162,218],"heads":[155],"even":[158],"places":[160],"bodies,":[163],"so":[164],"left":[166],"too":[167],"tedious,":[169],"sometimes":[170],"combinatorially":[171],"amount":[173],"user":[178],"do":[180],"manually.":[181],"Here":[182],"propose":[184],"new":[186],"algorithms,":[189],"Terminyzer+":[190,197,232,244,253,301,347],",":[191,245,346],"which":[192,246,296],"closes":[193],"usability":[195],"gap.":[196],"detect":[199],"only":[201],"subgoals":[204],"cause":[206],"non-termination,":[207],"but,":[208],"importantly,":[209],"rules":[212],"where":[213],"they":[214],"get":[221],"fired":[222],"cyclic":[225],"manner,":[226],"thus":[227],"causing":[228],"non-termination.":[229],"This":[230],"makes":[231],"suitable":[233],"back-end":[236],"user-friendly":[238],"graphical":[239,273],"interfaces":[240],"on":[241,302],"top":[242],"greatly":[248],"simplify":[249],"debugging":[251],"process.":[252],"back-ends":[254],"exist":[255],"SILK":[258,279],"system":[259],"well":[261],"open-source":[265],"${\\cal":[266,285],"F}$":[267,286],"lora":[268,287],"-":[269,288],"2":[270,289],"system.":[271],"interface":[274],"developed":[277],"currently":[282],"underway":[283],"We":[291],"also":[292],"report":[293],"experimental":[294],"studies,":[295],"confirm":[297],"effectiveness":[299],"host":[304],"real-world":[307],"knowledge":[308],"bases.":[309],"All":[310],"tests":[311],"used":[312],"paper":[315],"available":[317],"online.":[318],"1":[319],"addition,":[321],"make":[323,362],"step":[325],"towards":[326],"automatic":[327],"remediation":[328],"proposing":[333],"an":[334],"algorithm":[335],"heuristically":[337],"fixes":[338],"some":[339],"misbehavior.":[342],"Furthermore,":[343],"unlike":[344],"does":[348],"require":[350],"underlying":[352],"engine":[354],"support":[356],"although":[359],"it.":[365]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}