<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>0011-1503</journal-id>
<journal-title><![CDATA[Crítica (México, D.F.)]]></journal-title>
<abbrev-journal-title><![CDATA[Crítica (Méx., D.F.)]]></abbrev-journal-title>
<issn>0011-1503</issn>
<publisher>
<publisher-name><![CDATA[Universidad Nacional Autónoma de México, Instituto de Investigaciones Filosóficas]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S0011-15032008000100057</article-id>
<article-id pub-id-type="doi">10.22201/iifs.18704905e.2008.1021</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Abducción en modelos finitos]]></article-title>
<article-title xml:lang="en"><![CDATA[Abduction in Finite Models]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Soler Toscano]]></surname>
<given-names><![CDATA[Fernando]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Nepomuceno Fernández]]></surname>
<given-names><![CDATA[Ángel]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad de Sevilla Departamento de Filosofía, Lógica y Filosofía de la Ciencia ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Spain</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Universidad de Sevilla Departamento de Filosofía, Lógica y Filosofía de la Ciencia ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Spain</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>00</month>
<year>2008</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>00</month>
<year>2008</year>
</pub-date>
<volume>40</volume>
<numero>118</numero>
<fpage>57</fpage>
<lpage>78</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S0011-15032008000100057&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S0011-15032008000100057&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S0011-15032008000100057&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen Este artículo presenta un acercamiento a la resolución de problemas abductivos en C-estructuras, estructuras que tienen un universo de discurso finito y cada uno de sus elementos es la interpretación de una constante conocida. Empleando una variante del cálculo de tablas semánticas y resolución dual, construimos un procedimiento efectivo para encontrar soluciones abductivas minimales dentro de la semántica propuesta.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Summary We present an approach to abductive reasoning on C-structures, that is, structures with a finite domain such that each of its elements is the interpretation of a known constant of the language. We use a modification of the tableaux calculus and dual resolution to make a process which finds minimal abductive solutions within the proposed semantics.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[lógica de primer orden]]></kwd>
<kwd lng="es"><![CDATA[resolución dual]]></kwd>
<kwd lng="es"><![CDATA[tablas semánticas]]></kwd>
<kwd lng="en"><![CDATA[first order logic]]></kwd>
<kwd lng="en"><![CDATA[dual resolution]]></kwd>
<kwd lng="en"><![CDATA[semantic tableaux]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aliseda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Abductive Reasoning: Logical Investigations into Discovery and Explanation]]></source>
<year>2006</year>
<publisher-loc><![CDATA[Dordrecht ]]></publisher-loc>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Aliseda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Seeking Explanations: Abduction in Logic, Philosophy of Science and Artificial Intelligence]]></source>
<year>1997</year>
<publisher-loc><![CDATA[Amsterdam ]]></publisher-loc>
<publisher-name><![CDATA[Universidad de Amsterdam]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Beth]]></surname>
<given-names><![CDATA[E.W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Semantic Entailment and Formal Derivability]]></article-title>
<source><![CDATA[Konin-klijke Nederlandse Akademie van Wentenschappen, Proceedings of the Section of Sciences]]></source>
<year>1955</year>
<volume>18</volume>
<page-range>309-42</page-range></nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Boolos]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Trees and Finite Satisfiability]]></article-title>
<source><![CDATA[Notre Dame Journal of Formal Logic]]></source>
<year>1984</year>
<volume>25</volume>
<page-range>110-5</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Carnielli]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Surviving Abduction]]></article-title>
<source><![CDATA[Logic Journal of the IGPL]]></source>
<year>2006</year>
<volume>14</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>237-56</page-range></nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cialdea Mayer]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Pirri]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[First Order Abduction Via Tableau and Sequent Calculi]]></article-title>
<source><![CDATA[Bulletin ofthe IGPL]]></source>
<year>1993</year>
<volume>1</volume>
<page-range>99-117</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Díaz]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Árboles semánticos y modelos mínimos]]></article-title>
<source><![CDATA[Actas del I Congreso de la Sociedad de Lógica, Metodología y Filosofía de la Ciencia en España]]></source>
<year>1993</year>
<publisher-loc><![CDATA[Madrid ]]></publisher-loc>
<publisher-name><![CDATA[Universidad Complutense de Madrid]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Kakas]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Kowalski]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Toni]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Role of Abduction in Logic Programming]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Gabbay]]></surname>
<given-names><![CDATA[D.M.]]></given-names>
</name>
<name>
<surname><![CDATA[Hogger]]></surname>
<given-names><![CDATA[C.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Robinson]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Logic in Artificial Intelligence and Logic Programming]]></source>
<year>1998</year>
<volume>5</volume>
<page-range>235-324</page-range><publisher-loc><![CDATA[Oxford ]]></publisher-loc>
<publisher-name><![CDATA[Oxford University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nepomuceno]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Scientific Explanation and Modified Semantic Tableaux]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Magnani]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Nersessian]]></surname>
<given-names><![CDATA[N.J.]]></given-names>
</name>
<name>
<surname><![CDATA[Pizzi]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<source><![CDATA[Logical and Computational Aspects ofModel-Based Reasoning]]></source>
<year>2002</year>
<page-range>181-98</page-range><publisher-loc><![CDATA[Dordrecht ]]></publisher-loc>
<publisher-name><![CDATA[Kluwer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quine]]></surname>
<given-names><![CDATA[W.V.O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Way to Simplify Truth Functions]]></article-title>
<source><![CDATA[The American Mathematical Monthly]]></source>
<year>1955</year>
<volume>62</volume>
<page-range>627-31</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Reyes]]></surname>
<given-names><![CDATA[A.L.]]></given-names>
</name>
<name>
<surname><![CDATA[Aliseda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Nepomuceno]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Abductive Reasoning in First Order Logic]]></article-title>
<source><![CDATA[Logic Journal of the IGPL]]></source>
<year>2006</year>
<volume>14</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>287-304</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Robinson]]></surname>
<given-names><![CDATA[J.A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A Machine-Oriented Logic Based on the Resolution Principle]]></article-title>
<source><![CDATA[Journal of the ACM]]></source>
<year>1965</year>
<volume>12</volume>
<page-range>23-41</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Soler]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Nepomuceno]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[TARFA: Tableaux and Resolution for Finite Abduction]]></article-title>
<source><![CDATA[Lecture Notes in Computer Science]]></source>
<year>2006</year>
<volume>4160</volume>
<page-range>511-4</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Soler]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Nepomuceno]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Aliseda]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Model-Based Abduction Via Dual Resolution]]></article-title>
<source><![CDATA[Logic Journal of the IGPL]]></source>
<year>2006</year>
<volume>14</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>305-19</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
