01631nas a2200181   4500008004100000245004400041210004400085300000600129490000700135520112800142653002901270653002301299653001501322100002201337700002301359700002001382856004701402       2013                        eng d00aComplexities of Horn Description Logics0 aComplexities of Horn Description Logics  a20 v143 aDescription Logics (DLs) have become a prominent paradigm for representing knowledge bases in a variety of application areas. Central to leveraging them for corresponding systems is the provision of a favourable balance between expressivity of the knowledge representation formalism on the one hand, and runtime performance of reasoning algorithms on the other. Due to this, Horn description logics (Horn DLs) have attracted attention since their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large sets of instance data (ABoxes). However, the natural question whether Horn DLs also provide advantages for schema (TBox) reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn DLs. While the combined complexity for many Horn DLs studied herein turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning. We also provide convenient normal forms for Horn DLs.10acomputational complexity10adescription logics10aHorn logic1 aKrötzsch, Markus1 aRudolph, Sebastian1 aHitzler, Pascal  uhttp://doi.acm.org/10.1145/2422085.242208700520nam a2200169   4500008004100000245002600041210002600067260003000093100002000123700002200143700002300165700001300188700001500201700001700216700001500233856010200248       2013                        eng d00a语义Web技术基础0 a语义Web技术基础  bTsinghua University Press1 aHitzler, Pascal1 aKrötzsch, Markus1 aRudolph, Sebastian1 aYu, Yong1 aQi, Guilin1 aWang, Haofen1 aLiu, Chang  uhttps://daselab.cs.ksu.edu/publications/%E8%AF%AD%E4%B9%89web%E6%8A%80%E6%9C%AF%E5%9F%BA%E7%A1%8000499nas a2200157   4500008004100000245005700041210005400098260001500152300002300167100002000190700002200210700001800232700003100250700002300281856003700304       2012                        eng d00aOWL 2 Web Ontology Language: Primer (Second Edition)0 aOWL 2 Web Ontology Language Primer Second Edition  c12/11/2012  aW3C Recommendation1 aHitzler, Pascal1 aKrötzsch, Markus1 aParsia, Bijan1 aPatel-Schneider, Peter, F.1 aRudolph, Sebastian  uhttp://www.w3.org/TR/owl2-primer01833nas a2200253   4500008004100000245005100041210004900092260003900141300001200180490000900192520112700201653002301328653000801351653001001359100002001369700001801389700002001407700002101427700002101448700001501469700002201484700002201506856005101528       2012                        eng d00aRecent Advances in Integrating {OWL} and Rules0 aRecent Advances in Integrating OWL and Rules  aAustria, ViennabSpringerc09/2012  a225-2280 v74973 aAs part of the quest for a unifying logic for the Semantic Web Technology Stack, a central issue is finding suitable ways of integrating description logics based on the Web Ontology Language (OWL) with rule-based approaches based on logic programming. Such integration is difficult since naive approaches typically result in the violation of one or more desirable design principles. For example, while both OWL 2 DL and RIF Core (a dialect of the Rule Interchange Format RIF) are decidable, their naive union is not, unless carefully chosen syntactic restrictions are applied.

We report on recent advances and ongoing work by the authors in integrating OWL and rulesWe take an OWL-centric perspective, which means that we take OWL 2 DL as a starting point and pursue the question of how features of rulebased formalisms can be added without jeopardizing decidability. We also report on incorporating the closed world assumption and on reasoning algorithms. This paper essentially serves as an entry point to the original papers, to which we will refer throughout, where detailed expositions of the results can be found.10adescription logics10aOWL10aRules1 aKnorr, Matthias1 aCarral, David1 aHitzler, Pascal1 aKrisnadhi, Adila1 aMaier, Frederick1 aWang, Cong1 aKrötzsch, Markus1 aStraccia, Umberto  uhttp://dx.doi.org/10.1007/978-3-642-33203-6_2001139nas a2200169   4500008004100000245006800041210006600109260002200175300001200197490000900209520056900218100002100787700002000808700002200828700002200850856009700872       2012                        eng d00aA Tableau Algorithm for Description Logics with Nominal Schemas0 aTableau Algorithm for Description Logics with Nominal Schemas  bSpringerc09/2012  a234-2370 v74973 a<p>We present a tableau algorithm for the description logic&nbsp;ALCOV. This description logic is obtained by extending the description&nbsp;logic ALCO with the expressive nominal schema construct that enables&nbsp;DL-safe datalog with predicates of arbitrary arity to be covered within&nbsp;the description logic framework. The tableau algorithm provides a basis to implement a delayed grounding strategy which was not facilitated&nbsp;by earlier versions of decision procedures for satisfiability in expressive&nbsp;description logics with nominal schemas.</p>
1 aKrisnadhi, Adila1 aHitzler, Pascal1 aKrötzsch, Markus1 aStraccia, Umberto  uhttps://daselab.cs.ksu.edu/publications/tableau-algorithm-description-logics-nominal-schemas01393nas a2200181   4500008004100000245011800041210006900159490000600228520078700234653001201021653002201033653002301055653002101078100002301099700002201122700002001144856004701164       2012                        eng d00aType-Elimination-Based Reasoning for the Description Logic SHIQbs using Decision Diagrams and Disjunctive Datalog0 aTypeEliminationBased Reasoning for the Description Logic SHIQbs 0 v83 aWe propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) that represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst-case optimal w.r.t. combined and data complexity.10adatalog10adecision diagrams10adescription logics10atype elimination1 aRudolph, Sebastian1 aKrötzsch, Markus1 aHitzler, Pascal  uhttp://dx.doi.org/10.2168/LMCS-8(1:12)201201446nas a2200313   4500008004100000020002200041245008300063210006900146260001700215300001200232520051700244653001200761653002200773653003100795653001000826653001700836653002600853100002200879700002100901700002100922700002000943700002600963700002400989700001601013700002101029700001901050700001601069856004701085       2011                        eng d  a978-1-4503-0632-400aA Better Uncle for {OWL}: Nominal Schemas for Integrating Rules and Ontologies0 aBetter Uncle for OWL Nominal Schemas for Integrating Rules and O  bACMc03/2011  a645-6543 aWe propose a description-logic style extension of OWL 2 with nominal schemas which can be used like "variable nominal classes" within axioms. This feature allows ontology languages to express arbitrary DL-safe rules (as expressible in SWRL or RIF) in their native syntax. We show that adding nominal schemas to OWL 2 does not increase the worst-case reasoning complexity, and we identify a novel tractable language SROELV3(\cap, x) that is versatile enough to capture the lightweight languages OWL EL and OWL RL.10adatalog10aDescription Logic10aSemantic Web Rule Language10aSROIQ10atractability10aWeb Ontology Language1 aKrötzsch, Markus1 aMaier, Frederick1 aKrisnadhi, Adila1 aHitzler, Pascal1 aSrinivasan, Sadagopan1 aRamamritham, Krithi1 aKumar, Arun1 aRavindra, M., P.1 aBertino, Elisa1 aKumar, Ravi  uhttp://doi.acm.org/10.1145/1963405.196349600673nam a2200181   4500008004100000022002200041245006500063210006400128260004100192100002500233700002100258700002400279700001700303700002000320700002200340700002100362856010800383       2011                        eng d  a978-3-935025-85-000aLogik und Logikprogrammierung Band 2: Aufgaben und Lösungen0 aLogik und Logikprogrammierung Band 2 Aufgaben und Lösungen  aHeidelberg, GermanybSynchron Verlag1 aHölldobler, Steffen1 aBader, Sebastian1 aFronhöfer, Bertram1 aHans, Ursula1 aHitzler, Pascal1 aKrötzsch, Markus1 aPietzsch, Tobias  uhttps://daselab.cs.ksu.edu/publications/logik-und-logikprogrammierung-band-2-aufgaben-und-l%C3%B6sungen01014nas a2200193   4500008004100000245006500041210006500106260002500171490000800196520041700204100002200621700002100643700002100664700002000685700002100705700002300726700002700749856004400776       2011                        eng d00aNominal Schemas for Integrating Rules and Description Logics0 aNominal Schemas for Integrating Rules and Description Logics  bCEUR-WS.orgc07/20110 v7453 aWe propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic
syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal
schemas.1 aKrötzsch, Markus1 aMaier, Frederick1 aKrisnadhi, Adila1 aHitzler, Pascal1 aRosati, Riccardo1 aRudolph, Sebastian1 aZakharyaschev, Michael  uhttp://ceur-ws.org/Vol-745/paper_39.pdf00481nam a2200145   4500008004100000022001800041245004500059210004500104260003100149300000800180100002000188700002200208700002300230856008200253       2009                        eng d  a978142009050500aFoundations of Semantic Web Technologies0 aFoundations of Semantic Web Technologies  bChapman and Hall/CRC Press  a4551 aHitzler, Pascal1 aKrötzsch, Markus1 aRudolph, Sebastian  uhttps://daselab.cs.ksu.edu/publications/foundations-semantic-web-technologies00485nas a2200157   4500008004100000245004000041210003900081260001500120300002300135100002000158700002200178700001800200700003100218700002300249856005500272       2009                        eng d00aOWL 2 Web Ontology Language: Primer0 aOWL 2 Web Ontology Language Primer  c10/27/2009  aW3C Recommendation1 aHitzler, Pascal1 aKrötzsch, Markus1 aParsia, Bijan1 aPatel-Schneider, Peter, F.1 aRudolph, Sebastian  uhttp://www.w3.org/TR/2009/REC-owl2-primer-2009102700455nam a2200157   4500008004100000022002200041245002800063210002800091260002200119300000800141100002000149700002200169700002300191700001500214856006800229       2008                        eng d  a978-3-540-33993-900aSemantic Web Grundlagen0 aSemantic Web Grundlagen  bSpringer textbook  a2771 aHitzler, Pascal1 aKrötzsch, Markus1 aRudolph, Sebastian1 aSure, York  uhttps://daselab.cs.ksu.edu/publications/semantic-web-grundlagen