{"id":"https://openalex.org/W2108750038","doi":"https://doi.org/10.1017/s1471068413000537","title":"Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and G\u00f6del numberings)","display_name":"Compact serialization of Prolog terms (with catalan skeletons, cantor tupling and G\u00f6del numberings)","publication_year":2013,"publication_date":"2013-07-01","ids":{"openalex":"https://openalex.org/W2108750038","doi":"https://doi.org/10.1017/s1471068413000537","mag":"2108750038"},"language":"en","primary_location":{"id":"doi:10.1017/s1471068413000537","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000537","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/A5042600106","display_name":"Paul Tarau","orcid":"https://orcid.org/0000-0001-7192-9421"},"institutions":[{"id":"https://openalex.org/I123534392","display_name":"University of North Texas","ror":"https://ror.org/00v97ad02","country_code":"US","type":"education","lineage":["https://openalex.org/I123534392"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"PAUL TARAU","raw_affiliation_strings":["Department of Computer Science and Engineering (e-mail:","Univ of North texas"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering (e-mail:","institution_ids":[]},{"raw_affiliation_string":"Univ of North texas","institution_ids":["https://openalex.org/I123534392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042600106"],"corresponding_institution_ids":["https://openalex.org/I123534392"],"apc_list":null,"apc_paid":null,"fwci":2.1752,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.88128593,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"13","issue":"4-5","first_page":"847","last_page":"861"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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/T11567","display_name":"semigroups and automata theory","score":0.9987999796867371,"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/T10948","display_name":"Advanced Combinatorial Mathematics","score":0.9934999942779541,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11727","display_name":"Advanced Algebra and Logic","score":0.9832000136375427,"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/bijection","display_name":"Bijection","score":0.7919262051582336},{"id":"https://openalex.org/keywords/bijection-injection-and-surjection","display_name":"Bijection, injection and surjection","score":0.6924464702606201},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6669572591781616},{"id":"https://openalex.org/keywords/serialization","display_name":"Serialization","score":0.6467338800430298},{"id":"https://openalex.org/keywords/prolog","display_name":"Prolog","score":0.6383363008499146},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.6030317544937134},{"id":"https://openalex.org/keywords/catalan-number","display_name":"Catalan number","score":0.5570312738418579},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.48293206095695496},{"id":"https://openalex.org/keywords/natural-number","display_name":"Natural number","score":0.4630783498287201},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.4591062068939209},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44864708185195923},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40255632996559143},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36785688996315},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3639031648635864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3626266121864319},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.29598334431648254},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.20739853382110596}],"concepts":[{"id":"https://openalex.org/C24424167","wikidata":"https://www.wikidata.org/wiki/Q180907","display_name":"Bijection","level":2,"score":0.7919262051582336},{"id":"https://openalex.org/C48659774","wikidata":"https://www.wikidata.org/wiki/Q4907197","display_name":"Bijection, injection and surjection","level":3,"score":0.6924464702606201},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6669572591781616},{"id":"https://openalex.org/C52723943","wikidata":"https://www.wikidata.org/wiki/Q1127410","display_name":"Serialization","level":2,"score":0.6467338800430298},{"id":"https://openalex.org/C81721847","wikidata":"https://www.wikidata.org/wiki/Q163468","display_name":"Prolog","level":2,"score":0.6383363008499146},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.6030317544937134},{"id":"https://openalex.org/C43929256","wikidata":"https://www.wikidata.org/wiki/Q270513","display_name":"Catalan number","level":2,"score":0.5570312738418579},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.48293206095695496},{"id":"https://openalex.org/C184264201","wikidata":"https://www.wikidata.org/wiki/Q21199","display_name":"Natural number","level":2,"score":0.4630783498287201},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.4591062068939209},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44864708185195923},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40255632996559143},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36785688996315},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3639031648635864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3626266121864319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.29598334431648254},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.20739853382110596},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s1471068413000537","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s1471068413000537","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W123238105","https://openalex.org/W1511496239","https://openalex.org/W1564642430","https://openalex.org/W1576062164","https://openalex.org/W1874338106","https://openalex.org/W1875347116","https://openalex.org/W1977004736","https://openalex.org/W2014470854","https://openalex.org/W2037750941","https://openalex.org/W2114804254","https://openalex.org/W2159183428","https://openalex.org/W2160744744","https://openalex.org/W2248009306","https://openalex.org/W2914032487","https://openalex.org/W2943402418","https://openalex.org/W4256369010","https://openalex.org/W6633912197","https://openalex.org/W6762009171"],"related_works":["https://openalex.org/W1644269556","https://openalex.org/W3101791585","https://openalex.org/W4298857690","https://openalex.org/W2083685161","https://openalex.org/W2119910493","https://openalex.org/W3000541016","https://openalex.org/W1833181489","https://openalex.org/W1531141190","https://openalex.org/W3158030256","https://openalex.org/W2359651629"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"describe":[2],"a":[3,26,38,48,77,84],"compact":[4],"serialization":[5],"algorithm":[6,24,86,92],"mapping":[7,61],"Prolog":[8,36],"terms":[9],"to":[10,16,34,47,64,114],"natural":[11,40,44,65],"numbers":[12],"of":[13,20,76,108],"bit-sizes":[14],"proportional":[15],"the":[17,21,69,73,94,106,120],"memory":[18],"representation":[19],"terms.":[22],"The":[23],"is":[25,103],"\u2018no":[27],"bit":[28],"lost\u2019":[29],"bijection,":[30],"as":[31],"it":[32],"associates":[33],"each":[35,43],"term":[37,62,78],"unique":[39,49],"number":[41,45],"and":[42,72,100],"corresponds":[46],"syntactically":[50],"well-formed":[51],"term.":[52],"To":[53],"avoid":[54],"an":[55],"exponential":[56],"explosion":[57],"resulting":[58],"from":[59],"bijections":[60],"trees":[63],"numbers,":[66],"we":[67,80],"separate":[68],"symbol":[70],"content":[71],"syntactic":[74],"skeleton":[75],"that":[79],"serialize":[81],"compactly":[82],"using":[83],"ranking":[85],"for":[87,93],"Catalan":[88],"families.":[89],"A":[90],"novel":[91],"generalized":[95],"Cantor":[96],"bijection":[97],"between":[98],"${\\mathbb{N}$":[99,101],"k":[102],"used":[104],"in":[105,119],"process":[107],"assigning":[109],"polynomially":[110],"bounded":[111],"G\u00f6del":[112],"numberings":[113],"various":[115],"data":[116],"objects":[117],"involved":[118],"translation.":[121]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}