{"id":8785,"date":"1995-01-01T00:00:00","date_gmt":"1995-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/1995\/01\/01\/tecnicas-de-transformacion-de-programas-logicos-para-su-optimizacion-y-paralelizacion-automatica\/"},"modified":"1995-01-01T00:00:00","modified_gmt":"1995-01-01T00:00:00","slug":"tecnicas-de-transformacion-de-programas-logicos-para-su-optimizacion-y-paralelizacion-automatica","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/tecnicas-de-transformacion-de-programas-logicos-para-su-optimizacion-y-paralelizacion-automatica\/","title":{"rendered":"Tecnicas de transformacion de programas logicos para su optimizacion y paralelizacion automatica"},"content":{"rendered":"<h2>Tesis doctoral de <strong> Francisco Bueno Carrillo <\/strong><\/h2>\n<p>La tesis propone transformaciones de programas logicos que tienen por objetivo su optimizacion mediante la explotacion del paralelismo en su ejecucion. Se estudia el metodo consistente en aunar el analisis y la transformacion de los programas, y se emplean como principio optimizador distintas nociones de independencia. La tesis comienza con el estudio, primero metodologico y luego experimental, de algoritmos de transformacion previamente propuestos, para la paralelizacion a nivel de meta. El estudio identifica y propone posibles extensiones a los algoritmos, asi como otros nuevos, comparandolos mediante una serie de pruebas experimentales. A continuacion se discute la aplicabilidad del metodo a formas mas evolucionadas de la programacion logica, cuales son la programacion logica concurrente, con restricciones, y concurrente con restricciones. En primer lugar, se presenta un esquema de transformacion de programas prolog a programas akl, el cual incorpora tecnicas que permiten explotar el paralelismo (basado en independencia) de forma completa en el lenguaje destino. En una segunda parte de la tesis, se desarrolla una semantica formal capaz de expresar el significado operacional de practicamente toda la familia de los lenguajes logicos. Esta semantica permite captar el concepto de independencia a niveles de granularidad mucho mas finos que el clasico nivel de meta, lo cual da pie a identificar posibles optimizaciones aplicables a los programas logicos, de uno y otro tipo, a niveles completamente nuevos en el computo. Para sacar partido de tales optimizaciones, se definen esquemas de transformacion a un lenguaje destino \u00abkernel\u00bb que hacen posible la explotacion de las mismas.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Tecnicas de transformacion de programas logicos para su optimizacion y paralelizacion automatica<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Tecnicas de transformacion de programas logicos para su optimizacion y paralelizacion automatica <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Francisco Bueno Carrillo <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Polit\u00e9cnica de Madrid<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1995<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n<h3>Direcci\u00f3n y tribunal<\/h3>\n<ul>\n<li><strong>Director de la tesis<\/strong>\n<ul>\n<li>Manuel Hermenegildo Salinas<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Jose Cuena Bartolome <\/li>\n<li>Francesca Rossi (vocal)<\/li>\n<li>K. Debray Saumya (vocal)<\/li>\n<li>Juan  Jos\u00e9 Moreno Navarro (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Francisco Bueno Carrillo La tesis propone transformaciones de programas logicos que tienen por objetivo su optimizacion mediante [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"site-sidebar-layout":"default","site-content-layout":"","ast-site-content-layout":"","site-content-style":"default","site-sidebar-style":"default","ast-global-header-display":"","ast-banner-title-visibility":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","astra-migrate-meta-layouts":"default","ast-page-background-enabled":"default","ast-page-background-meta":{"desktop":{"background-color":"var(--ast-global-color-4)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"ast-content-background-meta":{"desktop":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"tablet":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""},"mobile":{"background-color":"var(--ast-global-color-5)","background-image":"","background-repeat":"repeat","background-position":"center center","background-size":"auto","background-attachment":"scroll","background-type":"","background-media":"","overlay-type":"","overlay-color":"","overlay-gradient":""}},"footnotes":""},"categories":[1890,2528,6474,126,16008],"tags":[30628,30627,13268,16231,30629,4816],"class_list":["post-8785","post","type-post","status-publish","format-standard","hentry","category-ciencia-de-los-ordenadores","category-inteligencia-artificial","category-lenguajes-de-programacion","category-matematicas","category-politecnica-de-madrid","tag-francesca-rossi","tag-francisco-bueno-carrillo","tag-jose-cuena-bartolome","tag-juan-jose-moreno-navarro","tag-k-debray-saumya","tag-manuel-hermenegildo-salinas"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/8785","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/comments?post=8785"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/8785\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=8785"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=8785"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=8785"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}