01534nas a2200241 4500008004100000245007700041210006900118260004100187520073700228653002000965653001500985653001901000653001301019653002001032653001801052100001901070700002001089700001901109700001601128700002101144700002001165856010701185 2019 eng d00aA Method for Automatically Generating Schema Diagrams for OWL Ontologies0 aMethod for Automatically Generating Schema Diagrams for OWL Onto aVilla Clara, CubabSpringerc06/20193 a
Interest in Semantic Web technologies, including knowledge graphs and ontologies, is increasing rapidly in industry and academics. In order to support ontology engineers and domain experts, it is necessary to provide them with robust tools that facilitate the ontology engineering process. Often, the schema diagram of an ontology is the most important tool for quickly conveying the overall purpose of an ontology. In this paper, we present a method for programmatically generating a schema diagram from an OWL file. We evaluate its ability to generate schema diagrams similar to manually drawn schema diagrams and show that it outperforms VOWL and OWLGrEd. In addition, we provide a prototype implementation of this tool.
10adesign patterns10aevaluation10aimplementation10aontology10aschema diagrams10avisualization1 aShimizu, Cogan1 aEberhart, Aaron1 aKarima, Nazifa1 aHirt, Quinn1 aKrisnadhi, Adila1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/method-automatically-generating-schema-diagrams-owl-ontologies01097nas 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.pdf01833nas 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_2001446nas 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.196349601673nas 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.pdf