{"id":664,"date":"2010-09-24T05:58:16","date_gmt":"2010-09-24T05:58:16","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=664"},"modified":"2010-12-22T17:11:38","modified_gmt":"2010-12-22T17:11:38","slug":"extending-clause-learning-of-sat-solvers-with-boolean-grobner-bases","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/extending-clause-learning-of-sat-solvers-with-boolean-grobner-bases\/","title":{"rendered":"Extending Clause Learning of SAT Solvers with Boolean Gr\u00f6bner Bases"},"content":{"rendered":"<p>\nSe ha publicado recientemente el art\u00edculo <a href=\"http:\/\/zengler.eu\/files\/papers\/zengler_casc2010.pdf\">Extending Clause Learning of SAT Solvers with Boolean Gr\u00f6bner Bases<\/a>.<\/p>\n<p>\nEn el art\u00edculo se presenta una forma de combinar sistemas SAT (basados en el algoritmo DPLL) y bases de Gr\u00f6bner de forma que cuando se encuentran conflictos, el aprendizaje de las nuevas cl\u00e1usulas se realice mediante bases de Gr\u00f6bner en lugar de hacerlo por resoluci\u00f3n.<\/p>\n<p>\nPara experimentar la propuesta, han creado el sistema MiniSat+GB en el que integran el sistema <a href=\"http:\/\/minisat.se\/\">MiniSat<\/a> con la librer\u00eda <a href=\"http:\/\/www.reduce-algebra.com\/docs\/cgb.pdf\"cgb<\/a> para el c\u00e1lculo de bases de Gr\u00f6bner del sistema de c\u00e1lculo simb\u00f3lico <a href=\"http:\/\/www.reduce-algebra.com\/\">Reduce<\/a>.<\/p>\n<p>\nEn los resultados de los experimentos se observa c\u00f3mo MiniSat+GB supera en eficiencia a MiniSat en los casos en los que se requiere m\u00e1s tiempo de c\u00f3mputo.<\/p>\n<p>\nLos autores del art\u00edculo son <a href=\"http:\/\/www-sr.informatik.uni-tuebingen.de\/index.php?id=zengler\">Christoph Zengler<\/a> y <a href=\"http:\/\/www-sr.informatik.uni-tuebingen.de\/index.php?id=kuechlin\">Wolfgang K\u00fcchlin<\/a> que son miembros del <a href=\"http:\/\/www-sr.informatik.uni-tuebingen.de\/index.php\">Grupo de c\u00e1lculo simb\u00f3lico<\/a> de la Universidad de Tubinga (<i>T\u00fcbingen<\/i> en alem\u00e1n), Alemania.<\/p>\n<p>\nEl art\u00edculo se ha publicado en el LNCS 6244: <a href=\"http:\/\/www.springerlink.com\/content\/978-3-642-15273-3#section=776093&#038;page=1\">Computer Algebra in Scientific Computing. (12th International Workshop, CASC 2010)<\/a><\/p>\n","protected":false},"excerpt":{"rendered":"<p>Se ha publicado recientemente el art\u00edculo Extending Clause Learning of SAT Solvers with Boolean Gr\u00f6bner Bases. En el art\u00edculo se presenta una forma de combinar sistemas SAT (basados en el algoritmo DPLL) y bases de Gr\u00f6bner de forma que cuando se encuentran conflictos, el aprendizaje de las nuevas cl\u00e1usulas se realice mediante bases de Gr\u00f6bner&#8230;<\/p>\n","protected":false},"author":2,"featured_media":0,"comment_status":"open","ping_status":"closed","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":[123,75,111,122,110],"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\/664"}],"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=664"}],"version-history":[{"count":2,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/664\/revisions"}],"predecessor-version":[{"id":1057,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/664\/revisions\/1057"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=664"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=664"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=664"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}