{"id":"https://openalex.org/W2153892117","doi":"https://doi.org/10.1017/s1471068409990263","title":"Efficient local unfolding with ancestor stacks","display_name":"Efficient local unfolding with ancestor stacks","publication_year":2010,"publication_date":"2010-01-18","ids":{"openalex":"https://openalex.org/W2153892117","doi":"https://doi.org/10.1017/s1471068409990263","mag":"2153892117"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068409990263","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068409990263","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":"http://oa.upm.es/14259/","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5038492725","display_name":"Germ\u00e1n Puebla","orcid":null},"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":true,"raw_author_name":"GERM\u00c1N PUEBLA","raw_affiliation_strings":["School of Computer Science, Technical University of Madrid, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","School of Computer Science, Technical University of Madrid E28660-Boadilla del Monte, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Technical University of Madrid, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","institution_ids":["https://openalex.org/I88060688"]},{"raw_affiliation_string":"School of Computer Science, Technical University of Madrid E28660-Boadilla del Monte, Madrid, Spain","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091905437","display_name":"Elvira Albert","orcid":"https://orcid.org/0000-0003-0048-0705"},"institutions":[{"id":"https://openalex.org/I121748325","display_name":"Universidad Complutense de Madrid","ror":"https://ror.org/02p0gd045","country_code":"ES","type":"education","lineage":["https://openalex.org/I121748325"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"ELVIRA ALBERT","raw_affiliation_strings":["School of Computer Science, Complutense University of Madrid, E28040-Profesor Jos\u00e9 Garc\u00eda Santesmases, s/n, Madrid, Spain (e-mail:","School of Computer Science, Complutense University of Madrid E280JfO-Profesor Jos\u00e9 Garc\u00eda Santesmases, s/n, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Complutense University of Madrid, E28040-Profesor Jos\u00e9 Garc\u00eda Santesmases, s/n, Madrid, Spain (e-mail:","institution_ids":["https://openalex.org/I121748325"]},{"raw_affiliation_string":"School of Computer Science, Complutense University of Madrid E280JfO-Profesor Jos\u00e9 Garc\u00eda Santesmases, s/n, Madrid, Spain","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073531919","display_name":"Manuel V. Hermenegildo","orcid":"https://orcid.org/0000-0002-7583-323X"},"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"]},{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"MANUEL HERMENEGILDO","raw_affiliation_strings":["Madrid Institute for Advanced Studies in Software Development Technology, IMDEA Software, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","School of Computer Science, Technical University of Madrid, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","Madrid Institute for Advanced Studies in Software Development Technology, IMDEA Software","School of Computer Science, Technical University of Madrid E28660-Boadilla del Monte, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"Madrid Institute for Advanced Studies in Software Development Technology, IMDEA Software, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","institution_ids":["https://openalex.org/I4210162154"]},{"raw_affiliation_string":"School of Computer Science, Technical University of Madrid, E28660-Boadilla del Monte, Madrid, Spain (e-mail:","institution_ids":["https://openalex.org/I88060688"]},{"raw_affiliation_string":"Madrid Institute for Advanced Studies in Software Development Technology, IMDEA Software","institution_ids":[]},{"raw_affiliation_string":"School of Computer Science, Technical University of Madrid E28660-Boadilla del Monte, Madrid, Spain","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5038492725"],"corresponding_institution_ids":["https://openalex.org/I88060688"],"apc_list":null,"apc_paid":null,"fwci":0.9021,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.81506737,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"11","issue":"1","first_page":"1","last_page":"32"},"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.9998999834060669,"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.9998999834060669,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9969000220298767,"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.8548787236213684},{"id":"https://openalex.org/keywords/ancestor","display_name":"Ancestor","score":0.6637583374977112},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.6598143577575684},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6195699572563171},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.5697677731513977},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.5278133153915405},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.5204505920410156},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5158742666244507},{"id":"https://openalex.org/keywords/partial-evaluation","display_name":"Partial evaluation","score":0.48544102907180786},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.46036258339881897},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.43704575300216675},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4112812876701355},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.35430848598480225},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.18067488074302673},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.10611826181411743},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10386809706687927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8548787236213684},{"id":"https://openalex.org/C2780422015","wikidata":"https://www.wikidata.org/wiki/Q402152","display_name":"Ancestor","level":2,"score":0.6637583374977112},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.6598143577575684},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6195699572563171},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.5697677731513977},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.5278133153915405},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5204505920410156},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5158742666244507},{"id":"https://openalex.org/C195701839","wikidata":"https://www.wikidata.org/wiki/Q4008398","display_name":"Partial evaluation","level":2,"score":0.48544102907180786},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.46036258339881897},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.43704575300216675},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4112812876701355},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.35430848598480225},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.18067488074302673},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.10611826181411743},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10386809706687927},{"id":"https://openalex.org/C166957645","wikidata":"https://www.wikidata.org/wiki/Q23498","display_name":"Archaeology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s1471068409990263","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068409990263","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:dnet:archivodigit::1de4e79344881d1e36261c2784e7b5a9","is_oa":true,"landing_page_url":"http://oa.upm.es/14259/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and practice of logic programming, ISSN 1471-0684, 2011-01, Vol. 11, No. 1","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:oa.upm.es:14259","is_oa":true,"landing_page_url":"https://oa.upm.es/14259/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196323","display_name":"UPM Digital Archive (Technical University of Madrid)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I88060688","host_organization_name":"Universidad Polit\u00e9cnica de Madrid","host_organization_lineage":["https://openalex.org/I88060688"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and practice of logic programming, ISSN 1471-0684, 2011-01, Vol. 11, No. 1","raw_type":"info:eu-repo/semantics/acceptedVersion"},{"id":"pmh:oai:oa.upm.es:55502","is_oa":true,"landing_page_url":"https://oa.upm.es/55502/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196323","display_name":"UPM Digital Archive (Technical University of Madrid)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I88060688","host_organization_name":"Universidad Polit\u00e9cnica de Madrid","host_organization_lineage":["https://openalex.org/I88060688"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"}],"best_oa_location":{"id":"pmh:oai:dnet:archivodigit::1de4e79344881d1e36261c2784e7b5a9","is_oa":true,"landing_page_url":"http://oa.upm.es/14259/","pdf_url":null,"source":{"id":"https://openalex.org/S4306402641","display_name":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Cient\u00edficas)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4383465926","host_organization_name":"LA Referencia","host_organization_lineage":["https://openalex.org/I4383465926"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Theory and practice of logic programming, ISSN 1471-0684, 2011-01, Vol. 11, No. 1","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/17","score":0.41999998688697815,"display_name":"Partnerships for the goals"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W31561947","https://openalex.org/W95576201","https://openalex.org/W207722629","https://openalex.org/W1486252159","https://openalex.org/W1491178396","https://openalex.org/W1522598964","https://openalex.org/W1522948470","https://openalex.org/W1533556407","https://openalex.org/W1541434994","https://openalex.org/W1542269056","https://openalex.org/W1556604985","https://openalex.org/W1596577905","https://openalex.org/W1598890912","https://openalex.org/W1967769240","https://openalex.org/W1985933047","https://openalex.org/W1991589943","https://openalex.org/W2008251703","https://openalex.org/W2018765574","https://openalex.org/W2037035101","https://openalex.org/W2037317228","https://openalex.org/W2046571941","https://openalex.org/W2048831705","https://openalex.org/W2056410280","https://openalex.org/W2091064840","https://openalex.org/W2107696941","https://openalex.org/W2116325485","https://openalex.org/W2119683217","https://openalex.org/W2137818097","https://openalex.org/W2151897509","https://openalex.org/W2157543955","https://openalex.org/W2504992661","https://openalex.org/W4206370914","https://openalex.org/W6655199249","https://openalex.org/W6659970249","https://openalex.org/W6675979442"],"related_works":["https://openalex.org/W4230102134","https://openalex.org/W2384106458","https://openalex.org/W2996768723","https://openalex.org/W2091064840","https://openalex.org/W2750649130","https://openalex.org/W2131191265","https://openalex.org/W1858220877","https://openalex.org/W1978509573","https://openalex.org/W178589107","https://openalex.org/W2136233667"],"abstract_inverted_index":{"Abstract":[0],"The":[1],"most":[2],"successful":[3],"unfolding":[4,47,77,87,128],"rules":[5],"used":[6,40,99],"nowadays":[7],"in":[8,100,159,180,190,202,208],"the":[9,31,43,56,62,70,73,91,165],"partial":[10,183],"evaluation":[11],"of":[12,30,46,58,72,93,167,176],"logic":[13],"programs":[14,151],"are":[15,39,122,197],"based":[16,89],"on":[17,90,173],"well":[18],"quasi":[19],"orders":[20],"(wqo)":[21],"applied":[22],"over":[23],"(covering)":[24],"ancestors":[25,95],",":[26],"i.e.,":[27,131],"a":[28,35,103,107,160,181],"subsequence":[29],"atoms":[32,59],"selected":[33],"during":[34,76],"derivation.":[36],"Ancestor":[37],"(sub)sequences":[38],"to":[41,54,65,149,192],"increase":[42],"specialization":[44],"power":[45],"while":[48],"still":[49],"guaranteeing":[50],"termination":[51],"and":[52,105,156,204],"also":[53,198],"reduce":[55],"number":[57],"for":[60,114,164],"which":[61,96,145,185],"wqo":[63,104],"has":[64],"be":[66,98],"checked.":[67],"Unfortunately,":[68],"maintaining":[69],"structure":[71],"ancestor":[74],"relation":[75],"introduces":[78],"significant":[79],"overhead.":[80],"We":[81],"propose":[82,142],"an":[83],"efficient,":[84],"practical":[85,139,182,195],"local":[86,127],"rule":[88],"notion":[92],"covering":[94],"can":[97],"combination":[101],"with":[102,138,194],"allows":[106],"stack-based":[108],"implementation":[109,175],"without":[110],"losing":[111],"any":[112],"opportunities":[113],"specialization.":[115],"Using":[116],"our":[117,147,174,188],"technique,":[118],"certain":[119],"nonleftmost":[120],"unfoldings":[121],"allowed":[123],"as":[124,126],"long":[125],"is":[129],"performed,":[130],"we":[132,141,171],"cover":[133],"depth-first":[134],"strategies.":[135],"To":[136],"deal":[137],"programs,":[140,196],"assertion-based":[143],"techniques":[144,178],"allow":[146],"approach":[148],"treat":[150],"that":[152,187],"include":[153],"(Prolog)":[154],"built-ins":[155],"external":[157],"predicates":[158],"very":[161],"extensible":[162],"manner,":[163],"case":[166],"leftmost":[168],"unfolding.":[169],"Finally,":[170],"report":[172],"these":[177],"embedded":[179],"evaluator,":[184],"shows":[186],"techniques,":[189],"addition":[191],"dealing":[193],"significantly":[199],"more":[200,206],"efficient":[201,207],"time":[203],"somewhat":[205],"memory":[209],"than":[210],"traditional":[211],"tree-based":[212],"implementations.":[213]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}