{"id":2151,"date":"2012-08-30T06:18:54","date_gmt":"2012-08-30T06:18:54","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=2151"},"modified":"2013-03-08T05:48:12","modified_gmt":"2013-03-08T05:48:12","slug":"deriving-a-fast-inverse-of-the-generalized-cantor-n-tupling-bijection","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/deriving-a-fast-inverse-of-the-generalized-cantor-n-tupling-bijection\/","title":{"rendered":"Rese\u00f1a: Deriving a fast inverse of the generalized Cantor N-tupling bijection"},"content":{"rendered":"<p>La semana que viene (6 de septiembre) se presentar\u00e1 en el <a href=\"http:\/\/www.cs.bme.hu\/iclp2012\">ICLP&#8217;12<\/a> (28th International Conference on Logic Programming) un trabajo sobre resoluci\u00f3n l\u00f3gica de problemas combinatorios titulado <a href=\"http:\/\/drops.dagstuhl.de\/opus\/volltexte\/2012\/3632\/pdf\/30.pdf\">Deriving a fast inverse of the generalized Cantor N-tupling bijection<\/a>.<\/p>\n<p>Su autor es <a href=\"http:\/\/logic.cse.unt.edu\/tarau\/index.html\">Paul Tarau<\/a> (de la <i>University of North Texas<\/i>, Denton, Texas, USA).<\/p>\n<p>Su resumen es<\/p>\n<blockquote><p>\nWe attack an interesting open problem (an efficient algorithm to invert the generalized Cantor N-tupling bijection) and solve it through a sequence of equivalence preserving transformations of logic programs, that take advantage of unique strengths of this programming paradigm. An extension to set and multiset tuple encodings, as well as a simple application to a \u201cfair-search\u201d mechanism illustrate practical uses of our algorithms. <\/p>\n<p>The code in the paper (a literate Prolog program, tested with SWI-Prolog and Lean Prolog) is available at <a href=\"http:\/\/logic.cse.unt.edu\/tarau\/research\/2012\/pcantor.pl\">http:\/\/logic.cse.unt.edu\/tarau\/research\/2012\/pcantor.pl<\/a>.\n<\/p><\/blockquote>\n","protected":false},"excerpt":{"rendered":"<p>La semana que viene (6 de septiembre) se presentar\u00e1 en el ICLP&#8217;12 (28th International Conference on Logic Programming) un trabajo sobre resoluci\u00f3n l\u00f3gica de problemas combinatorios titulado Deriving a fast inverse of the generalized Cantor N-tupling bijection. Su autor es Paul Tarau (de la University of North Texas, Denton, Texas, USA). Su resumen es We&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"closed","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"jetpack_post_was_ever_published":false,"_kad_post_transparent":"","_kad_post_title":"","_kad_post_layout":"","_kad_post_sidebar_id":"","_kad_post_content_style":"","_kad_post_vertical_padding":"","_kad_post_feature":"","_kad_post_feature_position":"","_kad_post_header":false,"_kad_post_footer":false,"_jetpack_newsletter_access":"","_jetpack_dont_email_post_to_subs":false,"_jetpack_newsletter_tier_id":0,"_jetpack_memberships_contains_paywalled_content":false,"footnotes":"","_jetpack_memberships_contains_paid_content":false},"categories":[100],"tags":[294,285],"jetpack_featured_media_url":"","jetpack_sharing_enabled":true,"jetpack_likes_enabled":false,"_links":{"self":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2151"}],"collection":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/users\/2"}],"replies":[{"embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/comments?post=2151"}],"version-history":[{"count":4,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2151\/revisions"}],"predecessor-version":[{"id":2786,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/2151\/revisions\/2786"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=2151"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=2151"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=2151"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}