<?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-55462016000100067</article-id>
<article-id pub-id-type="doi">10.13053/cys-20-1-2186</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[(Hyper)sequent Calculi for the ALC(S4) Description Logics]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Muńoz]]></surname>
<given-names><![CDATA[Juan Pablo]]></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"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Martínez]]></surname>
<given-names><![CDATA[Iván]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Arrazola]]></surname>
<given-names><![CDATA[José Ramón Enrique]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla FCFM ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,CONACYT  ]]></institution>
<addr-line><![CDATA[ ]]></addr-line>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>03</month>
<year>2016</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>03</month>
<year>2016</year>
</pub-date>
<volume>20</volume>
<numero>1</numero>
<fpage>67</fpage>
<lpage>79</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462016000100067&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-55462016000100067&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-55462016000100067&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract Description logics (DL) form a well known family of knowledge representation languages. One of its main applications is on the Semantic Web as a reasoning framework in the form of the Ontology Web Language (OWL). In this paper, we propose a cut-free tree hypersequent calculus for terminological reasoning in the Description Logic ALC. We show the calculus is sound and complete. Also, an implementation is provided together with a complexity analysis. In addition, we also describe a cut-free sequent calculus for the description logic ALC with reflexive and transitive roles. Soundness and completeness are proven, and a complexity analysis and an implementation are also provided.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Description logics]]></kwd>
<kwd lng="en"><![CDATA[(Hyper)sequents]]></kwd>
<kwd lng="en"><![CDATA[proof theory]]></kwd>
<kwd lng="en"><![CDATA[automated reasoning]]></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[Baader]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Calvanese]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[McGuinness]]></surname>
<given-names><![CDATA[D. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Nardi]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Patel-Schneider]]></surname>
<given-names><![CDATA[P. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[The Description Logic Handbook: Theory, Implementation, and Applications]]></source>
<year>2003</year>
<publisher-name><![CDATA[Cambridge University Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bárcenas]]></surname>
<given-names><![CDATA[E.]]></given-names>
</name>
<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[Walsh]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
</person-group>
<source><![CDATA[Query reasoning on trees with types, interleaving, and counting]]></source>
<year>2011</year>
<conf-name><![CDATA[ 22International Joint Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>718-23</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="confpro">
<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>
<name>
<surname><![CDATA[Espinoza]]></surname>
<given-names><![CDATA[F. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gelbukh]]></surname>
<given-names><![CDATA[A. F.]]></given-names>
</name>
<name>
<surname><![CDATA[González-Mendoza]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<source><![CDATA[Expressive reasoning on tree structures: Recursion, inverse programs, Presburger constraints and nominals]]></source>
<year>2013</year>
<conf-name><![CDATA[ 12Mexican International Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>80-91</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Global numerical constraints on trees]]></article-title>
<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>
<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="B5">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Blackburn]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[van Benthem]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Wolter]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Handbook of Modal Logic]]></source>
<year>2006</year>
<volume>3</volume>
<publisher-loc><![CDATA[New York, NY, USA ]]></publisher-loc>
<publisher-name><![CDATA[Elsevier Science Inc.]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<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[Hayes-Roth]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Korf]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<source><![CDATA[Boosting the correspondence between description logics and propositional dynamic logics]]></source>
<year>1994</year>
<volume>1</volume>
<conf-name><![CDATA[ 12National Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>205-12</page-range><publisher-name><![CDATA[AAAI Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Untersuchungen uber das logische Schließen]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gentzen]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Mathematische Zeitschrift]]></source>
<year>1935</year>
<volume>39</volume>
<page-range>176-210</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gordon]]></surname>
<given-names><![CDATA[M. J. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Milner]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Morris]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Newey]]></surname>
<given-names><![CDATA[M. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wadsworth]]></surname>
<given-names><![CDATA[C. P.]]></given-names>
</name>
<name>
<surname><![CDATA[Aho]]></surname>
<given-names><![CDATA[A. V.]]></given-names>
</name>
<name>
<surname><![CDATA[Zilles]]></surname>
<given-names><![CDATA[S. N.]]></given-names>
</name>
<name>
<surname><![CDATA[Szymanski]]></surname>
<given-names><![CDATA[T. G.]]></given-names>
</name>
</person-group>
<source><![CDATA[A metalanguage for interactive proof in LCF]]></source>
<year>1978</year>
<conf-name><![CDATA[ FifthAnnual ACM Symposium on Principlesof Programming Languages]]></conf-name>
<conf-loc> </conf-loc>
<page-range>119-30</page-range><publisher-name><![CDATA[ACM Press]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Goré]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Ramanayake]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Labelled tree sequents, tree hypersequents and nested (deep) sequents]]></article-title>
<person-group person-group-type="editor">
<name>
<surname><![CDATA[Bolander]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Braüner]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Ghilardi]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Moss]]></surname>
<given-names><![CDATA[L. S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Advances in Modal Logic 9]]></source>
<year>2012</year>
<page-range>279-99</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[A contraction-free and cut-free sequent calculus for propositional dynamic logic]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hill]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Poggiolesi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Studia Logica]]></source>
<year>2010</year>
<volume>94</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>47-72</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hitzler]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Krötzsch]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Parsia]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Patel-Schneider]]></surname>
<given-names><![CDATA[P. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Rudolph]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[OWL 2 Web Ontology Language: Primer]]></source>
<year>2009</year>
</nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Horrocks]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Sattler]]></surname>
<given-names><![CDATA[U.]]></given-names>
</name>
<name>
<surname><![CDATA[Tobies]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Ganzinger]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
<name>
<surname><![CDATA[McAllester]]></surname>
<given-names><![CDATA[D. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Voronkov]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[Practical reasoning for expressive description logics]]></source>
<year>1999</year>
<volume>1705</volume>
<conf-name><![CDATA[ 6International Conference]]></conf-name>
<conf-loc> </conf-loc>
<page-range>161-80</page-range><publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Muńoz-Toriz]]></surname>
<given-names><![CDATA[J.-P.]]></given-names>
</name>
<name>
<surname><![CDATA[Martínez-Ruiz]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
<name>
<surname><![CDATA[Arrazola-Ramírez]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
</person-group>
<source><![CDATA[On automatic theorem proving with ML]]></source>
<year>2014</year>
<conf-name><![CDATA[ 13Mexican International Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
</nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Proof theory for modal logic]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Negri]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Philosophy Compass]]></source>
<year>2011</year>
<volume>6</volume>
<numero>8</numero>
<issue>8</issue>
<page-range>523-38</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Poggiolesi]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Sequent Calculi for Modal Logic]]></source>
<year>2008</year>
<publisher-name><![CDATA[University of Florence]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Rademaker]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Proof Theory for Description Logics]]></source>
<year>2012</year>
<publisher-name><![CDATA[Springer]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schild]]></surname>
<given-names><![CDATA[K.]]></given-names>
</name>
<name>
<surname><![CDATA[Mylopoulos]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Reiter]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[A correspondence theory for terminological logics: Preliminary report]]></source>
<year>1991</year>
<conf-name><![CDATA[ 12International Joint Conference on Artificial Intelligence]]></conf-name>
<conf-loc> </conf-loc>
<page-range>466-71</page-range><publisher-name><![CDATA[Morgan Kaufmann]]></publisher-name>
</nlm-citation>
</ref>
<ref id="B18">
<nlm-citation citation-type="journal">
<article-title xml:lang=""><![CDATA[Attributive concept descriptions with complements]]></article-title>
<person-group person-group-type="author">
<name>
<surname><![CDATA[Schmidt-Schauß]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Smolka]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
</person-group>
<source><![CDATA[Artif. Intel.]]></source>
<year>1991</year>
<volume>48</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-26</page-range></nlm-citation>
</ref>
<ref id="B19">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Sun]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Sui]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
</person-group>
<source><![CDATA[A Gentzen system for the description logic]]></source>
<year>2014</year>
<conf-name><![CDATA[ 9International Conference on Computer Science and Education]]></conf-name>
<conf-loc> </conf-loc>
<page-range>99-102</page-range></nlm-citation>
</ref>
</ref-list>
</back>
</article>
