{"id":"https://openalex.org/W2078503492","doi":"https://doi.org/10.1017/s1471068402001618","title":"An open ended tree","display_name":"An open ended tree","publication_year":2003,"publication_date":"2003-05-01","ids":{"openalex":"https://openalex.org/W2078503492","doi":"https://doi.org/10.1017/s1471068402001618","mag":"2078503492"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068402001618","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068402001618","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/124151","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5107853467","display_name":"Henk Vandecasteele","orcid":null},"institutions":[{"id":"https://openalex.org/I4210090951","display_name":"Advanced Pharma","ror":"https://ror.org/00c3pmw05","country_code":"US","type":"facility","lineage":["https://openalex.org/I4210090951"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"HENK VANDECASTEELE","raw_affiliation_strings":["PharmaDM, Ambachtenlaan 54D, B-3001 Leuven, Belgium","PharmaDM, Ambachtenlaan 54D, B-3001 Leuven, Belgium (email: Henk.Vandecasteele@PharmaDM.com)#TAB#"],"affiliations":[{"raw_affiliation_string":"PharmaDM, Ambachtenlaan 54D, B-3001 Leuven, Belgium","institution_ids":["https://openalex.org/I4210090951"]},{"raw_affiliation_string":"PharmaDM, Ambachtenlaan 54D, B-3001 Leuven, Belgium (email: Henk.Vandecasteele@PharmaDM.com)#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084545304","display_name":"Gerda Janssens","orcid":null},"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":"GERDA JANSSENS","raw_affiliation_strings":["Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium","Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium (email: Gerda.Janssens@cs.kuleuven.ac.be)#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium","institution_ids":["https://openalex.org/I99464096"]},{"raw_affiliation_string":"Department of Computer Science, Katholieke Universiteit Leuven, Celestijnenlaan 200A, B-3001 Leuven, Belgium (email: Gerda.Janssens@cs.kuleuven.ac.be)#TAB#","institution_ids":["https://openalex.org/I99464096"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5107853467"],"corresponding_institution_ids":["https://openalex.org/I4210090951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.16558296,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"3","issue":"3","first_page":"377","last_page":"385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"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.9983999729156494,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.875235378742218},{"id":"https://openalex.org/keywords/pearl","display_name":"Pearl","score":0.7446284294128418},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5719031691551208},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5291175246238708},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.5096645355224609},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.45481738448143005},{"id":"https://openalex.org/keywords/tree-structure","display_name":"Tree structure","score":0.44925105571746826},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.4374552369117737},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3149759769439697},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29378482699394226},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.09876397252082825},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.061250001192092896}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.875235378742218},{"id":"https://openalex.org/C2779251273","wikidata":"https://www.wikidata.org/wiki/Q43436","display_name":"Pearl","level":2,"score":0.7446284294128418},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5719031691551208},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5291175246238708},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.5096645355224609},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.45481738448143005},{"id":"https://openalex.org/C163797641","wikidata":"https://www.wikidata.org/wiki/Q2067937","display_name":"Tree structure","level":3,"score":0.44925105571746826},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.4374552369117737},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3149759769439697},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29378482699394226},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09876397252082825},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.061250001192092896},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C27206212","wikidata":"https://www.wikidata.org/wiki/Q34178","display_name":"Theology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1017/s1471068402001618","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068402001618","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:lirias2repo.kuleuven.be:123456789/124151","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/124151","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. 3 (3), (377-385)","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"pmh:oai:lirias2repo.kuleuven.be:123456789/124151","is_oa":true,"landing_page_url":"https://lirias.kuleuven.be/handle/123456789/124151","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. 3 (3), (377-385)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W65937437","https://openalex.org/W1492803714","https://openalex.org/W1493000276","https://openalex.org/W1586826229","https://openalex.org/W2084224084","https://openalex.org/W2168798470","https://openalex.org/W2524046996"],"related_works":["https://openalex.org/W2372453241","https://openalex.org/W2371387875","https://openalex.org/W2531660186","https://openalex.org/W2064670891","https://openalex.org/W2025988984","https://openalex.org/W1508699539","https://openalex.org/W2030846031","https://openalex.org/W1987871343","https://openalex.org/W2013559555","https://openalex.org/W112831861"],"abstract_inverted_index":{"An":[0],"open":[1,64,77,82],"ended":[2,65,78,83],"list":[3],"is":[4,14,27,46,51],"a":[5,19,73],"well":[6],"known":[7],"data":[8,35],"structure":[9,36],"in":[10,33,43,53,93],"Prolog":[11],"programs.":[12],"It":[13],"frequently":[15],"used":[16],"to":[17,29,58,98],"represent":[18],"value":[20,26,60],"changing":[21],"over":[22],"time,":[23],"while":[24],"this":[25,44,68],"referred":[28],"from":[30],"several":[31],"places":[32],"the":[34,38,48,54,59,63,76,94,99],"of":[37,56,75,96],"application.":[39],"A":[40],"weak":[41],"point":[42],"technique":[45],"that":[47],"time":[49,90],"complexity":[50,91],"linear":[52],"number":[55,95],"updates":[57,97],"represented":[61],"by":[62],"list.":[66],"In":[67],"programming":[69],"pearl":[70],"we":[71],"present":[72],"variant":[74],"list,":[79],"namely":[80],"an":[81,86],"tree,":[84],"with":[85],"update":[87],"and":[88],"access":[89],"logarithmic":[92],"value.":[100]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}