{"id":"https://openalex.org/W2151120711","doi":"https://doi.org/10.1017/s147106840700316x","title":"Linear tabling strategies and optimizations","display_name":"Linear tabling strategies and optimizations","publication_year":2007,"publication_date":"2007-08-06","ids":{"openalex":"https://openalex.org/W2151120711","doi":"https://doi.org/10.1017/s147106840700316x","mag":"2151120711"},"language":"en","primary_location":{"id":"doi:10.1017/s147106840700316x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840700316x","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/A5113864016","display_name":"Neng\u2010Fa Zhou","orcid":null},"institutions":[{"id":"https://openalex.org/I83041322","display_name":"Brooklyn College","ror":"https://ror.org/019k4jq75","country_code":"US","type":"education","lineage":["https://openalex.org/I83041322"]},{"id":"https://openalex.org/I121847817","display_name":"The Graduate Center, CUNY","ror":"https://ror.org/00awd9g61","country_code":"US","type":"education","lineage":["https://openalex.org/I121847817"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"NENG-FA ZHOU","raw_affiliation_strings":["CUNY Brooklyn College & Graduate Center","CUNY Brooklyn College & Graduate Center ("],"affiliations":[{"raw_affiliation_string":"CUNY Brooklyn College & Graduate Center","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]},{"raw_affiliation_string":"CUNY Brooklyn College & Graduate Center (","institution_ids":["https://openalex.org/I83041322","https://openalex.org/I121847817"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5019997517","display_name":"Taisuke Sato","orcid":"https://orcid.org/0000-0001-9062-0729"},"institutions":[{"id":"https://openalex.org/I114531698","display_name":"Tokyo Institute of Technology","ror":"https://ror.org/0112mx960","country_code":"JP","type":"education","lineage":["https://openalex.org/I114531698"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"TAISUKE SATO","raw_affiliation_strings":["Tokyo Institute of Technology","Tokyo Institute of Technology ("],"affiliations":[{"raw_affiliation_string":"Tokyo Institute of Technology","institution_ids":["https://openalex.org/I114531698"]},{"raw_affiliation_string":"Tokyo Institute of Technology (","institution_ids":["https://openalex.org/I114531698"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102819706","display_name":"Yi-Dong Shen","orcid":"https://orcid.org/0009-0006-5782-2429"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"funder","lineage":["https://openalex.org/I19820366"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"YI-DONG SHEN","raw_affiliation_strings":["Chinese Academy of Sciences","Chinese Academy of Sciences ("],"affiliations":[{"raw_affiliation_string":"Chinese Academy of Sciences","institution_ids":["https://openalex.org/I19820366"]},{"raw_affiliation_string":"Chinese Academy of Sciences (","institution_ids":["https://openalex.org/I19820366"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113864016"],"corresponding_institution_ids":["https://openalex.org/I121847817","https://openalex.org/I83041322"],"apc_list":null,"apc_paid":null,"fwci":8.2104,"has_fulltext":false,"cited_by_count":42,"citation_normalized_percentile":{"value":0.97392799,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"8","issue":"1","first_page":"81","last_page":"109"},"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.9987000226974487,"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.9987000226974487,"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.9973999857902527,"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.9944000244140625,"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.8669607043266296},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.48623695969581604},{"id":"https://openalex.org/keywords/simplicity","display_name":"Simplicity","score":0.45697009563446045},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.43652820587158203},{"id":"https://openalex.org/keywords/automatic-summarization","display_name":"Automatic summarization","score":0.4330809414386749},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4107138216495514},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.40737393498420715}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8669607043266296},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.48623695969581604},{"id":"https://openalex.org/C2776372474","wikidata":"https://www.wikidata.org/wiki/Q508291","display_name":"Simplicity","level":2,"score":0.45697009563446045},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.43652820587158203},{"id":"https://openalex.org/C170858558","wikidata":"https://www.wikidata.org/wiki/Q1394144","display_name":"Automatic summarization","level":2,"score":0.4330809414386749},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4107138216495514},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.40737393498420715},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s147106840700316x","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s147106840700316x","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"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4699999988079071,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":46,"referenced_works":["https://openalex.org/W205087541","https://openalex.org/W1518621415","https://openalex.org/W1522225310","https://openalex.org/W1528738961","https://openalex.org/W1532503338","https://openalex.org/W1541434994","https://openalex.org/W1574950491","https://openalex.org/W1607244744","https://openalex.org/W1633377437","https://openalex.org/W1965784613","https://openalex.org/W1983792792","https://openalex.org/W1992810975","https://openalex.org/W1997189447","https://openalex.org/W1997210046","https://openalex.org/W1998915208","https://openalex.org/W2011170798","https://openalex.org/W2031868932","https://openalex.org/W2036226033","https://openalex.org/W2042416159","https://openalex.org/W2044701300","https://openalex.org/W2065555531","https://openalex.org/W2070598037","https://openalex.org/W2080716125","https://openalex.org/W2091478774","https://openalex.org/W2096979400","https://openalex.org/W2101335378","https://openalex.org/W2111353076","https://openalex.org/W2118889869","https://openalex.org/W2126970272","https://openalex.org/W2127409356","https://openalex.org/W2130683061","https://openalex.org/W2132063146","https://openalex.org/W2151952683","https://openalex.org/W2155945137","https://openalex.org/W2166780425","https://openalex.org/W2169591289","https://openalex.org/W4231741839","https://openalex.org/W4237919697","https://openalex.org/W4238307044","https://openalex.org/W4255993952","https://openalex.org/W4285719527","https://openalex.org/W6631717585","https://openalex.org/W6634545217","https://openalex.org/W6649663221","https://openalex.org/W6653041824","https://openalex.org/W7071627042"],"related_works":["https://openalex.org/W2368019753","https://openalex.org/W2333930193","https://openalex.org/W2737356002","https://openalex.org/W2246241526","https://openalex.org/W2366403280","https://openalex.org/W1495108544","https://openalex.org/W2374150061","https://openalex.org/W4301122218","https://openalex.org/W2081340182","https://openalex.org/W4210711561"],"abstract_inverted_index":{"Abstract":[0],"Recently":[1],"there":[2],"has":[3,91,163],"been":[4],"a":[5,22,109,214],"growing":[6],"interest":[7],"in":[8,10,12,21,125,179,224,255,298,310],"research":[9],"tabling":[11,45,68,90,107,194,306],"the":[13,49,56,85,119,122,160,174,182,272,275,313],"logic":[14,259],"programming":[15],"community":[16],"because":[17,95],"of":[18,24,44,79,96,100,121,208,233,258,265,316],"its":[19,97,295],"usefulness":[20],"variety":[23],"application":[25],"domains":[26],"including":[27],"program":[28],"analysis,":[29],"parsing,":[30],"deductive":[31],"databases,":[32],"theorem":[33],"proving,":[34],"model":[35],"checking,":[36],"and":[37,54,72,77,102,136,145,148,153,166,185,282,284],"logic-based":[38],"probabilistic":[39],"learning.":[40],"The":[41,155],"main":[42],"idea":[43],"is":[46,108,167,177,186,218],"to":[47,51,58,81,203,261,277,293],"memorize":[48],"answers":[50,57,133],"some":[52],"subgoals":[53,80,210],"use":[55],"resolve":[59],"subsequent":[60],"variant":[61],"subgoals.":[62,128],"Early":[63],"resolution":[64],"mechanisms":[65],"proposed":[66],"for":[67,170,189,274],"such":[69],"as":[70,211],"OLDT":[71],"SLG":[73],"rely":[74],"on":[75,118,196],"suspension":[76,202],"resumption":[78],"compute":[82,204],"fixpoints.":[83,205],"Recently,":[84],"iterative":[86,198],"approach":[87],"named":[88],"linear":[89,268,305],"received":[92],"considerable":[93],"attention":[94],"simplicity,":[98],"ease":[99],"implementation,":[101],"good":[103,164],"space":[104],"efficiency.":[105],"Linear":[106,193],"framework":[110],"from":[111],"which":[112],"different":[113],"methods":[114],"can":[115,226],"be":[116,240,278],"derived":[117],"basis":[120],"strategies":[123],"used":[124],"handling":[126],"looping":[127,216,235],"One":[129],"decision":[130],"concerns":[131],"when":[132],"are":[134],"consumed":[135],"returned.":[137],"This":[138],"article":[139],"describes":[140],"two":[141],"strategies,":[142,147],"namely,":[143],"lazy":[144,161,183],"eager":[146,175],"compares":[149,307],"them":[150],"both":[151],"qualitatively":[152],"quantitatively.":[154],"results":[156],"indicate":[157],"that,":[158],"while":[159],"strategy":[162,176,184],"locality":[165],"well":[168,187,309],"suited":[169,188],"finding":[171],"all":[172,234],"solutions,":[173],"comparable":[178],"speed":[180,311],"with":[181,191,302,312],"programs":[190,260],"cuts.":[192],"relies":[195],"depth-first":[197],"deepening":[199],"rather":[200],"than":[201],"Each":[206],"cluster":[207],"interdependent":[209],"represented":[212],"by":[213],"topmost":[215],"subgoal":[217,223],"iteratively":[219],"evaluated":[220],"until":[221],"no":[222],"it":[225],"produce":[227],"any":[228],"new":[229],"answers.":[230],"Naive":[231],"re-evaluation":[232],"subgoals,":[236],"albeit":[237],"simple,":[238],"may":[239],"computationally":[241],"unacceptable.":[242],"In":[243],"this":[244,303],"article,":[245],"we":[246],"also":[247],"introduce":[248],"semi-naive":[249],"optimization,":[250],"an":[251,286],"effective":[252],"technique":[253,276,288],"employed":[254],"bottom-up":[256],"evaluation":[257],"avoid":[262],"redundant":[263],"joins":[264],"answers,":[266],"into":[267],"tabling.":[269],"We":[270],"give":[271],"conditions":[273],"safe":[279],"(i.e.,":[280],"sound":[281],"complete)":[283],"propose":[285],"optimization":[287,304],"called":[289],"early":[290],"answer":[291],"promotion":[292],"enhance":[294],"effectiveness.":[296],"Benchmarking":[297],"B-Prolog":[299],"demonstrates":[300],"that":[301],"favorably":[308],"state-of-the-art":[314],"implementation":[315],"SLG.":[317]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}