{"id":31294,"date":"1997-01-01T00:00:00","date_gmt":"1997-01-01T00:00:00","guid":{"rendered":"https:\/\/www.deberes.net\/tesis\/sin-categoria\/proof-procedures-for-multiple-valued-propositional-logics\/"},"modified":"1997-01-01T00:00:00","modified_gmt":"1997-01-01T00:00:00","slug":"proof-procedures-for-multiple-valued-propositional-logics","status":"publish","type":"post","link":"https:\/\/www.deberes.net\/tesis\/matematicas\/proof-procedures-for-multiple-valued-propositional-logics\/","title":{"rendered":"Proof procedures for multiple-valued propositional logics."},"content":{"rendered":"<h2>Tesis doctoral de <strong> Felip Ma\u00f1a Serres <\/strong><\/h2>\n<p>En esta tesis se presentan procedimientos de prueba para logicas proposicionales multivaluadas. Se definen calculos completos, estructuras de datos eficientes, heuristicas para controlar el espacio de busqueda y tecnicas para ahorrar calculos no necesarios.  en primer lugar, se dise\u00f1an algoritmos para comprobar la satisfactibilidad de formulas signadas (generales y regulares), los cuales sirven para resolver el problema de la satisfactibilidad en cualquier logica finitamente-valuada. Luego, se demuestra que el problema de la satisfactibilidad de formulas horn regulares tiene una complejidad lineal, y que el problema de la 2-satisfactibilidad para formulas signadas arbitrarias es np-completo, aunque admite soluciones polinomiles si las formulas son regulares o los signos son singletons.  finalmente, se dise\u00f1a un interprete lineal para una amplia familia de logicas infinitamente-valuadas, el cual esta basado en una regla de inferencia modus-ponens e incorpora una regla de negacion por fallo finito multivaluada y un operador de corte multivaluado.<\/p>\n<p>&nbsp;<\/p>\n<h3>Datos acad\u00e9micos de la tesis doctoral \u00ab<strong>Proof procedures for multiple-valued propositional logics.<\/strong>\u00ab<\/h3>\n<ul>\n<li><strong>T\u00edtulo de la tesis:<\/strong>\u00a0 Proof procedures for multiple-valued propositional logics. <\/li>\n<li><strong>Autor:<\/strong>\u00a0 Felip Ma\u00f1a Serres <\/li>\n<li><strong>Universidad:<\/strong>\u00a0 Aut\u00f3noma de barcelona<\/li>\n<li><strong>Fecha de lectura de la tesis:<\/strong>\u00a0 01\/01\/1997<\/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>Gonzalo Escalada Imaz<\/li>\n<\/ul>\n<\/li>\n<li><strong>Tribunal<\/strong>\n<ul>\n<li>Presidente del tribunal: Francesc Esteva Massaguer <\/li>\n<li>Reiner Hahnle (vocal)<\/li>\n<li>Buenaventura Verdu Solans (vocal)<\/li>\n<li>Jaume Agust\u00ed Cullell (vocal)<\/li>\n<\/ul>\n<\/li>\n<\/ul>\n<p>&nbsp;<\/p>\n","protected":false},"excerpt":{"rendered":"<p>Tesis doctoral de Felip Ma\u00f1a Serres En esta tesis se presentan procedimientos de prueba para logicas proposicionales multivaluadas. Se definen [&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":[58580,1890,2528,3747,3748,126],"tags":[87388,56388,6570,87386,6478,87387],"class_list":["post-31294","post","type-post","status-publish","format-standard","hentry","category-calculo-proposicional","category-ciencia-de-los-ordenadores","category-inteligencia-artificial","category-logica","category-logica-deductiva","category-matematicas","tag-buenaventura-verdu-solans","tag-felip-mana-serres","tag-francesc-esteva-massaguer","tag-gonzalo-escalada-imaz","tag-jaume-agusti-cullell","tag-reiner-hahnle"],"_links":{"self":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/31294","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=31294"}],"version-history":[{"count":0,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/posts\/31294\/revisions"}],"wp:attachment":[{"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/media?parent=31294"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/categories?post=31294"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.deberes.net\/tesis\/wp-json\/wp\/v2\/tags?post=31294"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}