00850nas a2200169 4500008004100000245003700041210003700078260001400115300001000129520037000139100002000509700001800529700002000547700001700567700002300584856007300607 2021 eng d00aSeed Patterns for Modeling Trees0 aSeed Patterns for Modeling Trees bIOS Press a48-673 aTrees – i.e., the type of data structure known under this name – are central to many aspects of knowledge organization. We investigate some central design choices concerning the ontological modeling of such trees. In particular, we consider the limits of what is expressible in the Web Ontology Language and provide a reusable ontology design pattern for trees.1 aEberhart, Aaron1 aCarral, David1 aHitzler, Pascal1 aLapp, Hilmar1 aRudolph, Sebastian uhttps://daselab.cs.ksu.edu/publications/seed-patterns-modeling-trees00387nas a2200121 4500008004100000245004100041210003400082100001800116700002000134700001700154700002300171856007100194 2017 eng d00aOn the Ontological Modeling of Trees0 aOntological Modeling of Trees1 aCarral, David1 aHitzler, Pascal1 aLapp, Hilmar1 aRudolph, Sebastian uhttps://daselab.cs.ksu.edu/publications/ontological-modeling-trees01097nas a2200229 4500008004100000245008000041210006900121260002500190300001100215490000900226520039900235653002300634653001600657653000800673100001800681700002100699700002300720700002000743700001600763700002800779856006000807 2014 eng d00aAll But Not Nothing: Left-Hand Side Universals for Tractable {OWL} Profiles0 aAll But Not Nothing LeftHand Side Universals for Tractable OWL P bCEUR-WS.orgc10/2014 a97-1080 v12653 aWe show that occurrences of the universal quantifier in the left-hand side of general concept inclusions can be rewritten into EL++ axioms under certain circumstances. I.e., this intuitive modeling feature is available for OWL EL while retaining tractability. Furthermore, this rewriting makes it possible to reason over corresponding extensions of EL++ and Horn-SROIQ using standard reasoners.10adescription logics10aHorn Logics10aOWL1 aCarral, David1 aKrisnadhi, Adila1 aRudolph, Sebastian1 aHitzler, Pascal1 aKeet, Maria1 aTamma, Valentina, A. M. uhttp://ceur-ws.org/Vol-1265/owled2014_submission_13.pdf01631nas 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.242208701810nas a2200289 4500008004100000245006000041210005700101260001300158300001200171490000900183520099400192653001601186653002901202653000801231100001801239700002001257700002401277700002201301700002101323700002001344700002101364700001901385700002401404700001901428700002301447856005001470 2013 eng d00aAn Ontology Design Pattern for Cartographic Map Scaling0 aOntology Design Pattern for Cartographic Map Scaling bSpringer a76–930 v78823 a
The concepts of scale is at the core of cartographic abstraction and mapping. It defines which geographic phenomena should be displayed, which type of geometry and map symbol to use, which measures can be taken, as well as the degree to which features need to be exaggerated or spatially displaced. In this work, we present an ontology design pattern for map scaling using the Web Ontology Language (OWL) within a particular extension of the OWL RL profile. We explain how it can be used to describe scaling applications, to reason over scale levels, and geometric representations. We propose an axiomatization that allows us to impose meaningful constraints on the pattern, and, thus, to go beyond simple surface semantics. Interestingly, this includes several functional constraints currently not expressible in any of the OWL profiles. We show that for this specific scenario, the addition of such constraints does not increase the reasoning complexity which remains tractable.
10aMap Scaling10aOntology Design Patterns10aOWL1 aCarral, David1 aScheider, Simon1 aJanowicz, Krzysztof1 aVardeman, Charles1 aKrisnadhi, Adila1 aHitzler, Pascal1 aCimiano, Philipp1 aCorcho, Óscar1 aPresutti, Valentina1 aHollink, Laura1 aRudolph, Sebastian uhttp://dx.doi.org/10.1007/978-3-642-38288-8_600520nam 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-primer01393nas 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)201201042nas a2200193 4500008004100000020002200041245008200063210006900145260002200214300001200236490000900248520043600257100002100693700002000714700002000734700002300754700002300777856004800800 2011 eng d a978-3-642-23579-500aLocal Closed World Semantics: Grounded Circumscription for Description Logics0 aLocal Closed World Semantics Grounded Circumscription for Descri bSpringerc08/2011 a263-2680 v69023 aWe present an improved local closed world extension for description logics. It is based on circumscription, and deviates from previous circumscriptive description logics in that extensions of minimized predicates may contain only extensions of named individuals in the knowledge base. Besides an (arguably) higher intuitive appeal, the improved semantics is applicable to expressive description logics without loss of decidability.1 aKrisnadhi, Adila1 aSengupta, Kunal1 aHitzler, Pascal1 aRudolph, Sebastian1 aGutierrez, Claudio uhttp://dx.doi.org/10.1007/978-3-642-23580-101673nas a2200229 4500008004100000245005800041210005500099260002500154490000800179520100400187653002001191653001701211653001701228653002201245100002101267700002001288700002001308700002101328700002301349700002701372856004401399 2011 eng d00aLocal Closed World Semantics: Keep it simple, stupid!0 aLocal Closed World Semantics Keep it simple stupid bCEUR-WS.orgc07/20110 v7453 aA combination of open and closed-world reasoning (usually called local closed world reasoning) is a desirable capability of knowledge representation formalisms for Semantic Web applications. However, none of the proposals made to date for extending description logics with local closed world capabilities has had any significant impact on applications. We believe that one of the key reasons for this is that current proposals fail to provide approaches which are intuitively accessible for application developers and at the same time are applicable, as extensions, to expressive description logics such as SROIQ, which underlies the Web Ontology Language OWL. In this paper we propose a new approach which overcomes key limitations of other major proposals made to date. It is based on an adaptation of circumscriptive description logics which, in contrast to previously reported circumscription proposals, is applicable to SROIQ without rendering reasoning over the resulting language undecidable.10acircumscription10aclosed world10adecidability10aDescription Logic1 aKrisnadhi, Adila1 aSengupta, Kunal1 aHitzler, Pascal1 aRosati, Riccardo1 aRudolph, Sebastian1 aZakharyaschev, Michael uhttp://ceur-ws.org/Vol-745/paper_12.pdf01014nas 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.pdf01542nas a2200181 4500008004100000245006100041210006100102260003000163300001300193490000900206520099500215100001801210700001601228700002001244700002301264700002301287856005001310 2011 eng d00aParaconsistent Semantics for Hybrid MKNF Knowledge Bases0 aParaconsistent Semantics for Hybrid MKNF Knowledge Bases aGalway, IrelandbSpringer a93–1070 v69023 aHybrid MKNF knowledge bases, originally based on the stable model semantics, is a mature method of combining rules and Description Logics (DLs). The well-founded semantics for such knowledge bases has been proposed subsequently for better efficiency of reasoning. However, integration of rules and DLs may give rise to inconsistencies, even if they are respectively consistent. Accordingly, reasoning systems based on the previous two semantics will break down. In this paper, we employ the four-valued logic proposed by Belnap, and present a paraconsistent semantics for Hybrid MKNF knowledge bases, which can detect inconsistencies and handle it effectively. Besides, we transform our proposed semantics to the stable model semantics via a linear transformation operator, which indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide a fixpoint algorithm for computing paraconsistent MKNF models.
1 aHuang, Shasha1 aLi, Qingguo1 aHitzler, Pascal1 aRudolph, Sebastian1 aGutierrez, Claudio uhttp://dx.doi.org/10.1007/978-3-642-23580-1_800562nas a2200145 4500008004100000245007300041210006900114260002800183100001800211700002300229700002200252700002300274700002000297856009900317 2009 eng d00aAn Evolutionary Computing Approach for Reasoning in the Semantic Web0 aEvolutionary Computing Approach for Reasoning in the Semantic We aLeiden, The Netherlands1 aTagni, Gaston1 aGueret, Christophe1 aSchlobach, Stefan1 aRudolph, Sebastian1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/evolutionary-computing-approach-reasoning-semantic-web00481nam 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