<?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-55462018000100189</article-id>
<article-id pub-id-type="doi">10.13053/cys-22-1-2776</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Depth-First Reasoning on Trees]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Limón]]></surname>
<given-names><![CDATA[Yensen]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[Everardo]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
<xref ref-type="aff" rid="Aaf"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[Edgard]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Medina]]></surname>
<given-names><![CDATA[María Auxilio]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Veracruzana  ]]></institution>
<addr-line><![CDATA[Veracruz ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,CONACYT  ]]></institution>
<addr-line><![CDATA[Ciudad de Mexico ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af3">
<institution><![CDATA[,Universidad Politécnica de Puebla  ]]></institution>
<addr-line><![CDATA[Puebla ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2018</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2018</year>
</pub-date>
<volume>22</volume>
<numero>1</numero>
<fpage>189</fpage>
<lpage>201</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462018000100189&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-55462018000100189&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-55462018000100189&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: The  &#956;-calculus is an expressive modal logic with least and greatest fixed-point operators. This formalism encompasses many temporal, program and description logics, and it has been widely applied in a broad range of domains, such as, program verification, knowledge representation and concurrent pervasive systems. In this paper, we propose a satisfiability algorithm for the  &#956;-calculus extended with converse modalities and interpreted on unranked trees. In contrast with known satisfiability algorithms, our proposal is based on a depth-first search. We prove the algorithm to be correct (sound and complete) and optimal. We also describe an implementation. The extension of the  &#956;-calculus with converse modalities allows to efficiently characterize standard reasoning problems (emptiness, containment and equivalence) of XPath queries. We also describe several query reasoning experiments, which shows our proposal to be competitive in practice with known implementations.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Calculus]]></kwd>
<kwd lng="en"><![CDATA[automated reasoning]]></kwd>
<kwd lng="en"><![CDATA[depth-first search]]></kwd>
<kwd lng="en"><![CDATA[XPath]]></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[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Lavalle]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Global numerical constraints on trees]]></article-title>
<source><![CDATA[Logical Methods in Computer Science]]></source>
<year>2014</year>
<volume>10</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B2">
<label>2</label><nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Context-aware mobile information systems: Data management issues and opportunities]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Arabnia]]></surname>
<given-names><![CDATA[H. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Hashemi]]></surname>
<given-names><![CDATA[R. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Vert]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Chennamaneni]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Solo]]></surname>
<given-names><![CDATA[A. M. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[International Conference on Information &amp; Knowledge Engineering, IKE]]></source>
<year>2010</year>
<page-range>127-33</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[Bettini]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Brdiczka]]></surname>
<given-names><![CDATA[O.]]></given-names>
</name>
<name>
<surname><![CDATA[Henricksen]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Indulska]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Nicklas]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Ranganathan]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Riboni]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A survey of context modelling and reasoning techniques]]></article-title>
<source><![CDATA[Pervasive and Mobile Computing]]></source>
<year>2010</year>
<volume>6</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>161-80</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[Bonatti]]></surname>
<given-names><![CDATA[P. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Lutz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Murano]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Vardi]]></surname>
<given-names><![CDATA[M. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of enriched mu-calculi]]></article-title>
<source><![CDATA[Logical Methods in Computer Science]]></source>
<year>2008</year>
<volume>4</volume>
<numero>3</numero>
<issue>3</issue>
</nlm-citation>
</ref>
<ref id="B5">
<label>5</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Calvanese]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[De Giacomo]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Lenzerini]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Vardi]]></surname>
<given-names><![CDATA[M. Y.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Node selection query languages for trees]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Fox]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Poole]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
</person-group>
<source><![CDATA[AAAI]]></source>
<year>2010</year>
<publisher-name><![CDATA[AAAI Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<label>6</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Fischer]]></surname>
<given-names><![CDATA[M. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Ladner]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Propositional modal logic of programs (extended abstract)]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Hopcroft]]></surname>
<given-names><![CDATA[J. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Friedman]]></surname>
<given-names><![CDATA[E. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Harrison]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[ACM Symposium on Theory of Computing]]></source>
<year>1977</year>
<page-range>286-94</page-range><publisher-name><![CDATA[ACM]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<label>7</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Genevès]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Layaïda]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Schmitt]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Gesbert]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Efficiently deciding &#956;-calculus with converse over finite trees]]></article-title>
<source><![CDATA[ACM Trans. Comput. Log.]]></source>
<year>2015</year>
<volume>16</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>16</page-range></nlm-citation>
</ref>
<ref id="B8">
<label>8</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Henriksen]]></surname>
<given-names><![CDATA[J. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Jensen]]></surname>
<given-names><![CDATA[J. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Jørgensen]]></surname>
<given-names><![CDATA[M. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Klarlund]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Paige]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Rauhe]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Sandholm]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mona: Monadic second-order logic in practice]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Brinksma]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Cleaveland]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Larsen]]></surname>
<given-names><![CDATA[K. G.]]></given-names>
</name>
<name>
<surname><![CDATA[Margaria]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Steffen]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
</person-group>
<source><![CDATA[TACAS]]></source>
<year>1995</year>
<volume>1019</volume>
<page-range>89-110</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<label>9</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Janin]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Walukiewicz]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[On the expressive completeness of the propositional mu-calculus with respect to monadic second order logic]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Montanari]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Sassone]]></surname>
<given-names><![CDATA[V.]]></given-names>
</name>
</person-group>
<source><![CDATA[CONCUR]]></source>
<year>1996</year>
<volume>1119</volume>
<page-range>263-77</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B10">
<label>10</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lenzi]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The modal &#956;-calculus: a survey]]></article-title>
<source><![CDATA[TASK Quarterly]]></source>
<year>2005</year>
<volume>9</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>293-316</page-range></nlm-citation>
</ref>
<ref id="B11">
<label>11</label><nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Limón]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Medina]]></surname>
<given-names><![CDATA[M. A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Depth-first search satisfiability of the &#956;-calculus with converse over trees]]></source>
<year>2017</year>
<conf-name><![CDATA[ 2017 International Conference on Electronics, Communications and Computers, CONIELECOMP]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B12">
<label>12</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Limón]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Benítez-Guerrero]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<name>
<surname><![CDATA[Mezura-Godoy]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Towards a reasoning model for context-aware systems: Modal logic and the tree model property]]></article-title>
<source><![CDATA[Research in Computing Science]]></source>
<year>2015</year>
<volume>99</volume>
<page-range>9-18</page-range></nlm-citation>
</ref>
<ref id="B13">
<label>13</label><nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tanabe]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Takahashi]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Hagiya]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A decision procedure for alternation-free modal &#956;-calculi]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Areces]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Goldblatt]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Modal Logic]]></source>
<year>2008</year>
<page-range>341-62</page-range><publisher-name><![CDATA[College Publications]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B14">
<label>14</label><nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Tarski]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A lattice-theoretical fixpoint theorem and its applications]]></article-title>
<source><![CDATA[Pacific J. Math.]]></source>
<year>1955</year>
<volume>5</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>285-309</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[ten Cate]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Marx]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Axiomatizing the logical core of XPath 2.0]]></article-title>
<source><![CDATA[Theory Comput. Syst.]]></source>
<year>2009</year>
<volume>44</volume>
<numero>4</numero>
<issue>4</issue>
<page-range>561-89</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
