{"id":3250,"date":"2013-04-23T16:17:14","date_gmt":"2013-04-23T16:17:14","guid":{"rendered":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/?p=3250"},"modified":"2013-04-24T06:17:39","modified_gmt":"2013-04-24T06:17:39","slug":"lmf2013-tableros-semanticos","status":"publish","type":"post","link":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/lmf2013-tableros-semanticos\/","title":{"rendered":"LMF2013: Tableros sem\u00e1nticos"},"content":{"rendered":"<p>En la clase de hoy del curso <a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/lmf-12\">L\u00f3gica matem\u00e1tica y fundamentos<\/a> se ha presentado un nuevo sistema deductivo: los tableros sem\u00e1nticos. <\/p>\n<p>Hemos visto c\u00f3mo los problemas de tautolog\u00eda y de consecuencia l\u00f3gica se reducen a problemas de consistencia:<\/p>\n<ul>\n<li> <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F\" class=\"latex\" \/> es una tautolog\u00eda syss <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=%5C%7B%5Cneg+F%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"&#92;{&#92;neg F&#92;}\" class=\"latex\" \/> es inconsistente.\n<li> <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=F&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"F\" class=\"latex\" \/> es consecuencia l\u00f3gica de <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=S&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"S\" class=\"latex\" \/> syss <img decoding=\"async\" src=\"https:\/\/s0.wp.com\/latex.php?latex=S+%5Ccup+%5C%7B%5Cneg+F%5C%7D&#038;bg=ffffff&#038;fg=000&#038;s=0&#038;c=20201002\" alt=\"S &#92;cup &#92;{&#92;neg F&#92;}\" class=\"latex\" \/> es inconsistente.\n<\/ul>\n<p>Por tanto, para resolver ambos problemas basta con tener un procedimiento sistem\u00e1tico de b\u00fasqueda de modelos. Uno de dichos procedimientos es el de tableros sem\u00e1nticos.<\/p>\n<p>Una ventaja de los tableros sem\u00e1nticos frente a la deducci\u00f3n natural  es la reducci\u00f3n del n\u00famero lo que facilita su automatizaci\u00f3n.<\/p>\n<p>Adem\u00e1s, se ha presentado el sistema <a href=\"http:\/\/www.umsu.de\/logik\/trees\/\">Tree Proof Generator<\/a> que busca autom\u00e1ticamente el tablero sem\u00e1ntico correspondiente a la f\u00f3rmula introducida.<\/p>\n<p>Las transparencias de esta clase son las del <a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/lmf-12\/temas\/tema-3.pdf\">tema 3<\/a> (tableros proposicionales) y las del <a href=\"http:\/\/www.cs.us.es\/~jalonso\/cursos\/lmf-12\/temas\/tema-9.pdf\">tema 9<\/a> (tableros de primer orden)<br \/>\n<!--more--><br \/>\n<div class=\"jetpack-video-wrapper\"><iframe src='https:\/\/www.slideshare.net\/slideshow\/embed_code\/12066637' width='1290' height='1057' sandbox=\"allow-popups allow-scripts allow-same-origin allow-presentation\" allowfullscreen webkitallowfullscreen mozallowfullscreen><\/iframe><\/div><\/p>\n","protected":false},"excerpt":{"rendered":"<p>En la clase de hoy del curso L\u00f3gica matem\u00e1tica y fundamentos se ha presentado un nuevo sistema deductivo: los tableros sem\u00e1nticos. Hemos visto c\u00f3mo los problemas de tautolog\u00eda y de consecuencia l\u00f3gica se reducen a problemas de consistencia: es una tautolog\u00eda syss es inconsistente. es consecuencia l\u00f3gica de syss es inconsistente. Por tanto, para resolver&#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":[1],"tags":[202],"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\/3250"}],"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=3250"}],"version-history":[{"count":1,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/3250\/revisions"}],"predecessor-version":[{"id":3251,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/posts\/3250\/revisions\/3251"}],"wp:attachment":[{"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/media?parent=3250"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/categories?post=3250"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.glc.us.es\/~jalonso\/vestigium\/wp-json\/wp\/v2\/tags?post=3250"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}