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-trees01111nas a2200169 4500008004100000245007600041210006900117260003600186300000700222490003100229520052800260653002200788653002900810653001400839100001800853856007000871 2017 eng d00aEfficient Reasoning Algorithms for Fragments of Horn Description Logics0 aEfficient Reasoning Algorithms for Fragments of Horn Description aDaytonbWright State University a700 vDoctor of Philosophy (PhD)3 aWe characterize two fragments of Horn Description Logics and we define two specialized reasoning algorithms that effectively solve the standard reasoning tasks over each of such fragments. We believe our work to be of general interest since (1) a rather large proportion of real-world Horn ontologies belong to some of these two fragments and (2) the implementations based on our reasoning approach significantly outperform state-of-the-art reasoners. Claims (1) and (2) are extensively proven via empirically evaluation. 10aDescription Logic10aKnowledge representation10aReasoning1 aCarral, David uhttp://rave.ohiolink.edu/etdc/view?acc_num=wright149131709653093800387nas 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-trees01322nas a2200133 4500008004100000245005600041210005500097520085900152100002701011700002101038700001801059700002001077856009101097 2017 eng d00aRule-based OWL Modeling with ROWLTab Protege Plugin0 aRulebased OWL Modeling with ROWLTab Protege Plugin3 a
It has been argued that it is much easier to convey logi- cal statements using rules rather than OWL (or description logic (DL)) axioms. Based on recent theoretical developments on transformations between rules and DLs, we have developed ROWLTab, a Prot ́eg ́e plugin that allows users to enter OWL axioms by way of rules; the plugin then automatically converts these rules into OWL 2 DL axioms if possible, and prompts the user in case such a conversion is not possible without weakening the semantics of the rule. In this paper, we present ROWLTab, together with a user evaluation of its effectiveness compared to entering axioms using the standard Prot ́eg ́e interface. Our evaluation shows that modeling with ROWLTab is much quicker than the standard interface, while at the same time, also less prone to errors for hard modeling tasks.
1 aSarker, Md Kamruzzaman1 aKrisnadhi, Adila1 aCarral, David1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/rule-based-owl-modeling-rowltab-protege-plugin00880nas a2200265 4500008004100000245006900041210006900110260002500179100001700204700001900221700001800240700002100258700002000279700001800299700002900317700002000346700002400366700001900390700002100409700001600430700001900446700002000465700002000485856010900505 2016 eng d00aCollected Research Questions Concerning Ontology Design Patterns0 aCollected Research Questions Concerning Ontology Design Patterns aAmsterdambIOS Press1 aHammar, Karl1 aBlomqvist, Eva1 aCarral, David1 avan Erp, Marieke1 aFokkens, Antske1 aGangemi, Aldo1 avan Hage, Willem, Robert1 aHitzler, Pascal1 aJanowicz, Krzysztof1 aKarima, Nazifa1 aKrisnadhi, Adila1 aNarock, Tom1 aSegers, Roxane1 aSolanki, Monika1 aSvatek, Vojtech uhttps://daselab.cs.ksu.edu/publications/collected-research-questions-concerning-ontology-design-patterns01431nas a2200133 4500008003900000245010100039210006900140520088300209100001801092700002201110700001801132700002001150856012701170 2016 d00aThe Detector Final State pattern: Using the Web Ontology Language to describe a Physics Analysis0 aDetector Final State pattern Using the Web Ontology Language to 3 aThe Data and Software Preservation for Open Science (DASPOS) collaboration has developed an ontology for describing particle physics analyses. The ontology, a series of data triples, is designed to describe dataset, selection cuts, and measured quantities for an analysis. The ontology specification, written in the Web Ontology Language (OWL), is designed to be interpreted by many pre-existing tools, including search engines, and to apply to both theory and experiment published papers. This paper gives an introduction to OWL and this branch of library science from a particle physicist’s point of view, specifics of the Detector Final State Pattern, and how it is designed to be used in the field of particle physics primarily to archive and recall analyses. A general introduction to DASPOS and how its other work fits in with this topic will also be described.
1 aWatts, Gordon1 aVardeman, Charles1 aCarral, David1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/detector-final-state-pattern-using-web-ontology-language-describe-physics-analysis01027nas a2200121 4500008004100000245007700041210006900118260004500187490000800232520053500240100001800775856011200793 2016 eng d00aEfficient Reasoning Algorithms for Fragments of Horn Description Logics0 aEffi cient Reasoning Algorithms for Fragments of Horn Descriptio aDayton, OH, USAbWright State University0 vPhD3 aWe characterize two fragments of Horn Description Logics and we define two specialized reasoning algorithms that effectively solve the standard reasoning tasks over each of such fragments. We believe our work to be of general interest since (1) a rather large proportion of real-world Horn ontologies belong to some of these two fragments and (2) the implementations based on our reasoning approach significantly outperform state-of-the-art reasoners. Claims (1) and (2) are extensively proven via empirically evaluation.
1 aCarral, David uhttps://daselab.cs.ksu.edu/publications/effi%0Ecient-reasoning-algorithms-fragments-horn-description-logics01045nas a2200145 4500008004100000245005300041210005200094260007200146520055100218100002700769700001800796700002100814700002000835856004400855 2016 eng d00aModeling OWL with Rules: The ROWL Protege Plugin0 aModeling OWL with Rules The ROWL Protege Plugin aKobe, Japanb15th International Semantic Web Conference (ISWC) 20163 aAbstract. In our experience, some ontology users find it much easier to convey logical statements using rules rather than OWL (or description logic) axioms. Based on recent theoretical developments on transformations between rules and description logics, we develop ROWL, a Proteg´ e plugin that allows users to enter OWL axioms by way of rules; the plugin then automatically converts these rules into OWL DL axioms if possible, and prompts the user in case such a conversion is not possible without weakening the semantics of the rule.
1 aSarker, Md Kamruzzaman1 aCarral, David1 aKrisnadhi, Adila1 aHitzler, Pascal uhttp://ceur-ws.org/Vol-1690/paper92.pdf01161nas a2200133 4500008004100000245008000041210006900121300001200190520071700202100001800919700002000937700002000957856005000977 2016 eng d00aA Practical Acyclicity Notion for Query Answering Over Horn-SRIQ Ontologies0 aPractical Acyclicity Notion for Query Answering Over HornSRIQ On a70–853 aConjunctive query answering over expressive Horn Description Logic ontologies is a relevant and challenging problem which, in some cases, can be addressed by application of the chase algorithm. In this paper, we define a novel acyclicity notion which provides a sufficient condition for termination of the restricted chase over Horn-SRIQ TBoxes. We show that this notion generalizes most of the existing acyclicity conditions (both theoretically and empirically). Furthermore, this new acyclicity notion gives rise to a very efficient reasoning procedure. We provide evidence for this by providing a materialization based reasoner for acyclic ontologies which outperforms other state-of-the-art systems.
1 aCarral, David1 aFeier, Cristina1 aHitzler, Pascal uhttp://dx.doi.org/10.1007/978-3-319-46523-4_501299nas a2200145 4500008004100000245007100041210006700112520079600179100002000975700001800995700002301013700002701036700001801063856007201081 2015 eng d00aThe Combined Approach to Query Answering Beyond the OWL 2 Profiles0 aCombined Approach to Query Answering Beyond the OWL 2 Profiles3 aCombined approaches have become a successful technique for CQ answering over ontologies. Existing algorithms, however, are restricted to the logics underpinning the OWL 2 profiles. Our goal is to make combined approaches applicable to a wider range of ontologies. We focus on RSA: a class of Horn ontologies that extends the profiles while ensuring tractability of standard reasoning. We show that CQ answering over RSA ontologies without role composition is feasible in NP. Our reasoning procedure generalises the combined approach for ELHO and DL-LiteR using an encoding of CQ answering into fact entailment w.r.t. a logic program with function symbols and stratified negation. Our results have significant practical implications since many out-of-profile Horn ontologies are RSA.
1 aFeier, Cristina1 aCarral, David1 aStefanoni, Giorgio1 aGrau, Bernardo, Cuenca1 aHorrocks, Ian uhttp://www.cs.ox.ac.uk/isg/people/cristina.feier/ijcai_rsafinal.pdf01289nas a2200145 4500008004100000245007400041210006900115520078400184100002000968700001800988700002301006700002701029700001801056856006901074 2015 eng d00aExtending the Combined Approach Beyond Lightweight Description Logics0 aExtending the Combined Approach Beyond Lightweight Description L3 aCombined approaches have become a successful technique for CQ answering over ontologies. Existing algorithms, however, are restricted to the logics underpinning the OWL 2 profiles. Our goal is to make combined approaches applicable to a wider range of ontologies. We focus on RSA: a class of Horn ontologies that extends the profiles while ensuring tractability of standard reasoning. We show that CQ answering over RSA ontologies without role composition is feasible in NP. Our reasoning procedure generalises the combined approach for ELHO and DL-LiteR using an encoding of CQ answering into fact entailment w.r.t. a logic program with function symbols and stratified negation. Our results are significant in practice since many out-of-profile Horn ontologies are RSA.
1 aFeier, Cristina1 aCarral, David1 aStefanoni, Giorgio1 aGrau, Bernardo, Cuenca1 aHorrocks, Ian uhttp://www.cs.ox.ac.uk/isg/people/cristina.feier/pdfs/dlmain.pdf00943nas a2200145 4500008004100000245007400041210006900115260001200184520042600196100002000622700001800642700001700660700002000677856010000697 2015 eng d00aAn Ontology Design Pattern for Data Integration in the Library Domain0 aOntology Design Pattern for Data Integration in the Library Doma c10/20153 aA university’s institutional repository (IR) contains the in- tellectual output of its faculty, staff and students. Its content is exten- sive and heterogenous, which complicates data aggregation and discovery tasks. To address these challenges, we propose the use of a conceptual ontology design pattern to model information for the IR domain which is general enough to be reused across different IR datasets.
1 aObrien, Patrick1 aCarral, David1 aMixter, Jeff1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/ontology-design-pattern-data-integration-library-domain01469nas a2200301 4500008004100000245006100041210005800102260002500160490000900185520055600194100001800750700002300768700002800791700002400819700002600843700002000869700002100889700002500910700003000935700002200965700001800987700001901005700002001024700002101044700001901065700002001084856006301104 2015 eng d00aAn Ontology Design Pattern for Particle Physics Analysis0 aOntology Design Pattern for Particle Physics Analysis bCEUR-WS.orgc10/20150 v14613 aThe detector final state is the core element of particle physics analysis as it defines the physical characteristics that form the basis of the measurement presented in a published paper. Although they are a crucial part of the research process, detector final states are not yet formally described, published in papers or searchable in a convenient way. This paper aims at providing an ontology pattern for the detector final state that can be used as a building block for an ontology covering the whole particle physics analysis life cycle.
1 aCarral, David1 aCheatham, Michelle1 aDallmeir-Tiessen, Sunje1 aHerterich, Patricia1 aHildreth, Michael, D.1 aHitzler, Pascal1 aKrisnadhi, Adila1 aLassila-Perini, Kati1 aSexton-Kennedy, Elizabeth1 aVardeman, Charles1 aWatts, Gordon1 aBlomqvist, Eva1 aHitzler, Pascal1 aKrisnadhi, Adila1 aNarock, Thomas1 aSolanki, Monika uhttp://ceur-ws.org/Vol-1461/WOP2015_pattern_abstract_5.pdf01097nas 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.pdf01017nas a2200205 4500008004100000245002500041210002400066300001400090520048400104653002300588653000800611653001400619653002400633100001800657700002000675700002700695700002000722700001800742856005100760 2014 eng d00aEL-ifying Ontologies0 aELifying Ontologies a464–4793 aThe OWL 2 profiles are fragments of the ontology language OWL 2 for which standard reasoning tasks are feasible in polynomial time. Many OWL ontologies, however, contain a typically small number of out-of-profile axioms, which may have little or no influence on reasoning outcomes. We investigate techniques for rewriting axioms into the EL and RL profiles of OWL 2. We have tested our techniques on both classification and data reasoning tasks with encouraging results.
10adescription logics10aOWL10aRewriting10aTractable Reasoning1 aCarral, David1 aFeier, Cristina1 aGrau, Bernardo, Cuenca1 aHitzler, Pascal1 aHorrocks, Ian uhttp://dx.doi.org/10.1007/978-3-319-08587-6_3600998nas a2200193 4500008004100000245005400041210005100095300001200146520046200158653001300620653002800633653000800661100001800669700001600687700001800703700001600721700002400737856004300761 2014 eng d00aAn Ontology Design Pattern for Activity Reasoning0 aOntology Design Pattern for Activity Reasoning a78–813 aActivity is an important concept in many fields, and a number of activity-related ontologies have been developed. While suitable for their designated use cases, these ontologies cannot be easily generalized to other applications. This paper aims at providing a generic ontology design pattern to model the common core of activities in different domains. Such a pattern can be used as a building block to construct more specific activity ontologies.
10aActivity10aOntology Design Pattern10aOWL1 aAbdalla, Amin1 aHu, Yingjie1 aCarral, David1 aLi, Naicong1 aJanowicz, Krzysztof uhttp://ceur-ws.org/Vol-1302/paper8.pdf01073nas a2200193 4500008004100000245005900041210005900100300001400159520049700173653002300670653000800693653002400701100001800725700002000743700002700763700002000790700001800810856005100828 2014 eng d00aPushing the Boundaries of Tractable Ontology Reasoning0 aPushing the Boundaries of Tractable Ontology Reasoning a148–1633 aWe identify a class of Horn ontologies for which standard reasoning tasks such as instance checking and classification are tractable. The class is general enough to include the OWL 2 EL, QL, and RL profiles. Verifying whether a Horn ontology belongs to the class can be done in polynomial time. We show empirically that the class includes many real-world ontologies that are not included in any OWL 2 profile, and thus that polynomial time reasoning is possible for these ontologies.
10adescription logics10aOWL10aTractable Reasoning1 aCarral, David1 aFeier, Cristina1 aGrau, Bernardo, Cuenca1 aHitzler, Pascal1 aHorrocks, Ian uhttp://dx.doi.org/10.1007/978-3-319-11915-1_1001419nas a2200205 4500008004100000245008100041210006900122300001400191520078200205653002300987653000801010653002401018100001801042700002001060700002301080700002701103700002001130700001801150856004501168 2014 eng d00aIs Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs0 aYour Ontology as Hard as You Think Rewriting Ontologies into Sim a128–1403 aWe investigate cases where an ontology expressed in a seemingly hard DL can be polynomially reduced to one in a simpler logic, while preserving reasoning outcomes for classification and fact entailment. Our transformations target the elimination of inverse roles, universal and existential restrictions, and in the best case allow us to rewrite the given ontology into one of the OWL 2 profiles. Even if an ontology cannot be fully rewritten into a profile, in many cases our transformations allow us to exploit further optimisation techniques. Moreover, the elimination of some out-of-profile axioms can improve the performance of modular reasoners, such as MORe. We have tested our techniques on both classification and data reasoning tasks with encouraging results.
10adescription logics10aOWL10aTractable Reasoning1 aCarral, David1 aFeier, Cristina1 aRomero, Ana, Armas1 aGrau, Bernardo, Cuenca1 aHitzler, Pascal1 aHorrocks, Ian uhttp://ceur-ws.org/Vol-1193/paper_75.pdf01947nas a2200241 4500008004100000245006000041210005700101300001400158520126400172653002801436653000801464653001501472100001601487700002401503700001801527700002001545700001701565700002101582700002001603700001501623700001601638856005101654 2013 eng d00aA Geo-ontology Design Pattern for Semantic Trajectories0 aGeoontology Design Pattern for Semantic Trajectories a438–4563 aTrajectory data have been used in a variety of studies, including human behavior analysis, transportation management, and wildlife tracking. While each study area introduces a different perspective, they share the need to integrate positioning data with domain-specific information. Semantic annotations are necessary to improve discovery, reuse, and integration of trajectory data from different sources. Consequently, it would be beneficial if the common structure encountered in trajectory data could be annotated based on a shared vocabulary, abstracting from domain-specific aspects. Ontology design patterns are an increasingly popular approach to define such flexible and self-contained building blocks of annotations. They appear more suitable for the annotation of interdisciplinary, multi-thematic, and multi-perspective data than the use of foundational and domain ontologies alone. In this paper, we introduce such an ontology design pattern for semantic trajectories. It was developed as a community effort across multiple disciplines and in a data-driven fashion. We discuss the formalization of the pattern using the Web Ontology Language (OWL) and apply the pattern to two different scenarios, personal travel and wildlife monitoring.
10aOntology Design Pattern10aOWL10aTrajectory1 aHu, Yingjie1 aJanowicz, Krzysztof1 aCarral, David1 aScheider, Simon1 aKuhn, Werner1 aBerg-Cross, Gary1 aHitzler, Pascal1 aDean, Mike1 aKolas, Dave uhttp://dx.doi.org/10.1007/978-3-319-01790-7_2401810nas a2200289 4500008004100000245006000041210005700101260001300158300001200171490000900183520099400192653001601186653002901202653000801231100001801239700002001257700002401277700002201301700002101323700002001344700002101364700001901385700002401404700001901428700002301447856005001470 2013 eng d00aAn Ontology Design Pattern for Cartographic Map Scaling0 aOntology Design Pattern for Cartographic Map Scaling bSpringer a76–930 v78823 aThe 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_600387nas a2200121 4500008004100000245005600041210005600097300001400153100001500167700001800182700002000200856004500220 2013 eng d00aSROIQ Syntax Approximation by Using Nominal Schemas0 aSROIQ Syntax Approximation by Using Nominal Schemas a988–9991 aWang, Cong1 aCarral, David1 aHitzler, Pascal uhttp://ceur-ws.org/Vol-1014/paper_31.pdf01105nas a2200169 4500008004100000245009900041210006900140300001200209520055900221653002300780653000900803653002000812100001800832700001500850700002000865856005000885 2013 eng d00aTowards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas0 aTowards an Efficient Algorithm to Reason over Description Logics a65–793 aExtending description logics with so-called nominal schemas has been shown to be a major step towards integrating description logics with rules paradigms. However, establishing efficient algorithms for reasoning with nominal schemas has so far been a challenge. In this paper, we present an algorithm to reason with the description logic fragment ELROVn, a fragment that extends EL++ with nominal schemas. We also report on an implementation and experimental evaluation of the algorithm, which shows that our approach is indeed rather efficient.
10adescription logics10aEL++10aNominal Schemas1 aCarral, David1 aWang, Cong1 aHitzler, Pascal uhttp://dx.doi.org/10.1007/978-3-642-39666-3_601166nas a2200157 4500008004100000245003800041210003800079300001400117520074700131653002300878653000800901653001000909100001800919700002000937856005100957 2012 eng d00aExtending Description Logic Rules0 aExtending Description Logic Rules a345–3593 aDescription Logics – the logics underpinning the Web Ontology Language OWL – and rules are currently the most prominent paradigms used for modeling knowledge for the Semantic Web. While both of these approaches are based on classical logic, the paradigms also differ significantly, so that naive combinations result in undesirable properties such as undecidability. Recent work has shown that many rules can in fact be expressed in OWL. In this paper we extend this work to include some types of rules previously excluded. We formally define a set of first order logic rules, C-Rules, which can be expressed within OWL extended with role conjunction. We also show that the use of nominal schemas results in even broader coverage.
10adescription logics10aOWL10aRules1 aCarral, David1 aHitzler, Pascal uhttp://dx.doi.org/10.1007/978-3-642-30284-8_3001221nas a2200169 4500008004100000245007100041210006800112260002500180490000800205520069600213100001800909700002100927700002000948700001800968700002200986856004301008 2012 eng d00aIntegrating {OWL} and Rules: A Syntax Proposal for Nominal Schemas0 aIntegrating OWL and Rules A Syntax Proposal for Nominal Schemas bCEUR-WS.orgc05/20120 v8493 aThis paper proposes an addition to OWL 2 syntax to incorporate nominal schemas, which is a new description-logic style extension of OWL 2 which was recently proposed, and which makes is possible to express “variable nominal classes” within axioms in an OWL 2 ontology. Nominal schemas make it possible to express DL-safe rules of arbitrary arity within the extended OWL paradigm, hence covering the well-known DL-safe SWRL language. To express this feature, we extend OWL 2 syntax to include necessary and minimal modifications to both Functional and Manchester syntax grammars and mappings from these two syntaxes to Turtle/RDF. We also include several examples to clarify the proposal.1 aCarral, David1 aKrisnadhi, Adila1 aHitzler, Pascal1 aKlinov, Pavel1 aHorridge, Matthew uhttp://ceur-ws.org/Vol-849/paper_6.pdf01048nas a2200169 4500008004100000245001700041210001700058260001700075520060700092100001800699700002500717700002100742700002300763700002000786700001500806856005700821 2012 eng d00aKonf Connect0 aKonf Connect aLyon, France3 aWe present an application called Konf-Connect to improve the conference attending experience of the people who attend a conference. This tool provides search facilities to nd people with similar interests. The application makes use of Semantic Web dog food dataset to gather information regarding the conference at hand. This is helpful for people attending the conference who are looking for networking opportunities with people having expertise in the specic areas of interest. The application can also be extended to be used as general purpose expert search system.
1 aCarral, David1 aJoshi, Amit, Krishna1 aKrisnadhi, Adila1 aMutharaju, Raghava1 aSengupta, Kunal1 aWang, Cong uhttps://daselab.cs.ksu.edu/publications/konf-connect00546nas a2200169 4500008004100000245006900041210006600110300001400176653001700190653002300207653002900230653000800259100001800267700002400285700002000309856004700329 2012 eng d00aA logical geo-ontology design pattern for quantifying over types0 alogical geoontology design pattern for quantifying over types a239–24810aBiodiversity10adescription logics10aOntology Design Patterns10aOWL1 aCarral, David1 aJanowicz, Krzysztof1 aHitzler, Pascal uhttp://doi.acm.org/10.1145/2424321.242435200493nas a2200145 4500008003900000245004500039210004500084260002200129490004100151100001500192700002100207700001800228700002000246856008100266 2012 d00aReasoning Approaches for Nominal Schemas0 aReasoning Approaches for Nominal Schemas aNara, JapanbJIST0 vPoster and Demonstration Proceedings1 aWang, Cong1 aKrisnadhi, Adila1 aCarral, David1 aHitzler, Pascal uhttps://daselab.cs.ksu.edu/publications/reasoning-approaches-nominal-schemas01833nas 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_20