<?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>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462017000300435</article-id>
<article-id pub-id-type="doi">10.13053/cys-21-3-2442</article-id>
<title-group>
<article-title xml:lang="es"><![CDATA[Algoritmo basado en modelos para la revisión de creencias entre formas normales conjuntivas]]></article-title>
<article-title xml:lang="en"><![CDATA[Model-based Algorithm for Belief Revisions between Normal. Conjunctive Forms]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ita Luna]]></surname>
<given-names><![CDATA[Guillermo De]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Zacarias Flores]]></surname>
<given-names><![CDATA[Fernando]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[García García]]></surname>
<given-names><![CDATA[Alma Delia]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Benemerita Universidad Autonoma de Puebla Facultad de Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>09</month>
<year>2017</year>
</pub-date>
<volume>21</volume>
<numero>3</numero>
<fpage>435</fpage>
<lpage>448</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462017000300435&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462017000300435&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462017000300435&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="es"><p><![CDATA[Resumen: La revisión de creencias es un área central en la representación de conocimiento y en el procesamiento de razonamiento automático. Consideraremos una base inicial de conocimiento K y una nueva información &#966;, ambas codificadas en forma normal conjuntiva (FC). Presentamos aquí, un algoritmo novedoso, determinista y correcto para la revisión de creencias de &#966; en K. Denotamos nuestro operador de revisión como: K&#8242; = K &#9702; &#966;. Proponemos un nuevo operador binario lógico Ind entre formas conjuntivas, y tal que Ind(&#966;, K) construye también una nueva forma conjuntiva. El operador Ind(&#966;, K) trabaja construyendo cláusulas independientes con las cláusulas de K, y las asignaciones falsificantes de la fórmula resultante cubren exactamente el espacio de asignaciones de F als(&#966;) &#8722; F als(K), lo que es esencial para realizar el proceso de revisión de creencias K&#8242; = K &#9702; &#966;, y donde K&#8242; &#8872; &#966;. Además de que nuestra propuesta satisface los postulados KM. Presentamos también la demostración de que nuestro algoritmo de revisión de creencias es correcto, y su análisis de complejidad en tiempo.]]></p></abstract>
<abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: Belief revision is a central area in knowledge representation and processing of automated reasoning. We will consider a knowledge base (KB) K and a new information &#966;, both expressed in conjunctive form (CF). We present here, a novel, deterministic and correct algorithm for belief revision of &#966; in K. We denote our revision operator as: K&#8242; = K &#9702; &#966;. We introduce a new logical binary operator Ind between two conjunctive forms, such that Ind(&#966;, K) generates also a conjunctive form. The operator Ind(&#966;, K) works building independent clauses with the clauses of K, and whose falsifying assignments of the resulting formula cover exactly the space of assignments F als(&#966;) &#8722; F als(K), this is essential for performing the process of belief revision K&#8242; = K &#9702; &#966;, where K&#8242; &#8872; &#966;. Furthermore, our proposal satisfies the KM postulates. We also present the correctness proof of our belief revision method, and the analysis of its time complexity.]]></p></abstract>
<kwd-group>
<kwd lng="es"><![CDATA[Inferencia proposicional]]></kwd>
<kwd lng="es"><![CDATA[revisión de creencias]]></kwd>
<kwd lng="es"><![CDATA[inferencia basada en modelos]]></kwd>
<kwd lng="es"><![CDATA[postulados KM]]></kwd>
<kwd lng="en"><![CDATA[Propositional inference]]></kwd>
<kwd lng="en"><![CDATA[belief revision]]></kwd>
<kwd lng="en"><![CDATA[model based inference]]></kwd>
<kwd lng="en"><![CDATA[postulates KM]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<label>1</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Alchourron]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gardenfords]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Makinson]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the logic of theory change: Partial meet contraction and revision functions]]></article-title>
<source><![CDATA[Journal of Symbolic Logic]]></source>
<year>1985</year>
<volume>50</volume>
<page-range>510-30</page-range></nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Booth]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Meyer]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Varzinczak]]></surname>
<given-names><![CDATA[I. J.]]></given-names>
</name>
</person-group>
<source><![CDATA[Next steps in propositional horn contraction]]></source>
<year>2009</year>
<conf-name><![CDATA[ Proc. 21st. Int. Join the conference on artificial Intelligence - IJCAI]]></conf-name>
<conf-loc> </conf-loc>
<page-range>702-7</page-range></nlm-citation>
</ref>
<ref id="B3">
<label>3</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bordeaux]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Hamadi]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Propositional satisfiability and constraint programming: A comparative survey]]></article-title>
<source><![CDATA[ACM Computing Surveys]]></source>
<year>2006</year>
<volume>38</volume>
<page-range>1-54</page-range></nlm-citation>
</ref>
<ref id="B4">
<label>4</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Creigno]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Papini]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Woltran]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Pichler]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Belief revision within fragments of propositional logic]]></article-title>
<source><![CDATA[Technical report]]></source>
<year>2012</year>
<page-range>1-21</page-range><publisher-name><![CDATA[Technische Universitat Wien]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Cresto]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Revisión de creencias y racionalidad]]></article-title>
<source><![CDATA[Cuadernos CIMBAGE]]></source>
<year>2002</year>
<volume>5</volume>
<page-range>133-56</page-range></nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Dalal]]></surname>
<given-names><![CDATA[M]]></given-names>
</name>
</person-group>
<source><![CDATA[Investigations into theory of knowledge base revision]]></source>
<year>1988</year>
<conf-name><![CDATA[ Proc. of the 7th National Conf. on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>475-9</page-range></nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Darwiche]]></surname>
<given-names><![CDATA[A]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On tractable counting of theory models and its application to truth maintenance and belief revision]]></article-title>
<source><![CDATA[Applied Non-Classical Logics]]></source>
<year>2001</year>
<volume>11</volume>
<page-range>11-34</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Darwiche]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pearl]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the logic of iterated belief revision]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>1997</year>
<volume>89</volume>
<page-range>1-29</page-range></nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[DeIta]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Zacarias]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A model-based algorithm for propositional belief revisions]]></article-title>
<source><![CDATA[IEEE Latin America Transactions]]></source>
<year>2015</year>
<volume>13</volume>
<page-range>1055-60</page-range></nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Delgrande]]></surname>
<given-names><![CDATA[J. P]]></given-names>
</name>
</person-group>
<source><![CDATA[Horn clause belief change: Contraction functions]]></source>
<year>2008</year>
<conf-name><![CDATA[ Proc. of the 11th Int. Conf. on the Principles of Knowledge Representation and Reasoning]]></conf-name>
<conf-loc> </conf-loc>
<page-range>156-65</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Doubois]]></surname>
<given-names><![CDATA[O]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Counting the number of solutions for instances of satisfiability]]></article-title>
<source><![CDATA[Theoretical Computer Science]]></source>
<year>1991</year>
<volume>81</volume>
<page-range>49-64</page-range></nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Eiter]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Fink]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Sabattini]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Tompits]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Considerations on updates of logic programs]]></article-title>
<source><![CDATA[Lecture Notes in Artificial Intelligence]]></source>
<year>2000</year>
<volume>1</volume>
</nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Ellis]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Irredundant families of subcubes]]></article-title>
<source><![CDATA[Mathematical Proc. of the Cambridge Philosophical Society]]></source>
<year>2011</year>
<volume>150</volume>
<page-range>257-72</page-range></nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fermé]]></surname>
<given-names><![CDATA[E]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Revisión de creencias]]></article-title>
<source><![CDATA[Revista Iberoamericana de Inteligencia Artificial]]></source>
<year>2007</year>
<volume>11</volume>
<page-range>17-39</page-range></nlm-citation>
</ref>
<ref id="B15">
<label>15</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hansson]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Belief contraction]]></article-title>
<source><![CDATA[Journal of Symbolic Logic]]></source>
<year>1994</year>
<volume>59</volume>
<page-range>845-59</page-range></nlm-citation>
</ref>
<ref id="B16">
<label>16</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Katsuno]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[Mendelzon]]></surname>
<given-names><![CDATA[A. O.]]></given-names>
</name>
</person-group>
<source><![CDATA[On the difference between updating a knowledge base and revising it]]></source>
<year>1991</year>
<volume>1</volume>
<conf-name><![CDATA[ KR&#8217;91]]></conf-name>
<conf-loc>Cambridge, MA, USA </conf-loc>
<page-range>387-94</page-range></nlm-citation>
</ref>
<ref id="B17">
<label>17</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Khardon]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Roth]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Reasoning with models]]></article-title>
<source><![CDATA[Artificial Intelligence]]></source>
<year>1996</year>
<volume>87</volume>
<page-range>187-213</page-range></nlm-citation>
</ref>
<ref id="B18">
<label>18</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lehmann]]></surname>
<given-names><![CDATA[D]]></given-names>
</name>
</person-group>
<source><![CDATA[Belief revision]]></source>
<year>1995</year>
<conf-name><![CDATA[ Proc. IJCAI&#8217;95]]></conf-name>
<conf-loc> </conf-loc>
<page-range>1534-40</page-range></nlm-citation>
</ref>
<ref id="B19">
<label>19</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liberatore]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schaerf]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Belief revision and update: Complexity of model checking]]></article-title>
<source><![CDATA[Journal of Computer and System Sciences]]></source>
<year>2001</year>
<volume>62</volume>
<page-range>43-72</page-range></nlm-citation>
</ref>
<ref id="B20">
<label>20</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Liberatore]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schaerf]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of model checking for belief revision and update]]></article-title>
<source><![CDATA[Journal of Computer and Systems Sciences]]></source>
<year>2001</year>
<volume>62</volume>
<page-range>43-72</page-range></nlm-citation>
</ref>
<ref id="B21">
<label>21</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Nebel]]></surname>
<given-names><![CDATA[B]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[How hard is it to revise a belief base?]]></article-title>
<source><![CDATA[Handbook of Defeasible Reasoning and Uncertainty Management Systems]]></source>
<year>1998</year>
<volume>3</volume>
<page-range>77-145</page-range></nlm-citation>
</ref>
<ref id="B22">
<label>22</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Papadimitriou]]></surname>
<given-names><![CDATA[C. H]]></given-names>
</name>
</person-group>
<source><![CDATA[Computational Complexity]]></source>
<year>1994</year>
<publisher-name><![CDATA[Addison-Wesley Pub]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B23">
<label>23</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Petrick]]></surname>
<given-names><![CDATA[S]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A direct termination of the irredundant forms of a boolean function from the set of primer implicants]]></article-title>
<source><![CDATA[Technical report]]></source>
<year>1956</year>
<publisher-name><![CDATA[Cambridge Res Center]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B24">
<label>24</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Quine]]></surname>
<given-names><![CDATA[W]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The problem of simplifying truth functions]]></article-title>
<source><![CDATA[JSTOR]]></source>
<year>1952</year>
<volume>59</volume>
<page-range>521-31</page-range></nlm-citation>
</ref>
<ref id="B25">
<label>25</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Satoh]]></surname>
<given-names><![CDATA[K]]></given-names>
</name>
</person-group>
<source><![CDATA[Nonmonotonic Reasoning by Minimal Belief Revision]]></source>
<year>1988</year>
<volume>358</volume>
<publisher-name><![CDATA[Institute for New Generation Computer Technology]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B26">
<label>26</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Valdéz]]></surname>
<given-names><![CDATA[N. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Falapa]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Dinamica de conocimiento: contracción múltiple en lenguajes Horn]]></source>
<year>2013</year>
<conf-name><![CDATA[ Proc. XIX congreso argentino de ciencias de la computación]]></conf-name>
<conf-loc> </conf-loc>
<page-range>61-70</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
