<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aaron Eberhart</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Hilmar Lapp</style></author><author><style face="normal" font="default" size="100%">Sebastian Rudolph</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Seed Patterns for Modeling Trees</style></title><secondary-title><style face="normal" font="default" size="100%">Advances in Pattern-Based Ontology Engineering</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><pages><style face="normal" font="default" size="100%">48-67</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">Trees – 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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient Reasoning Algorithms for Fragments of Horn Description Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Computer Science and Engineering</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Description Logic</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge representation</style></keyword><keyword><style  face="normal" font="default" size="100%">Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://rave.ohiolink.edu/etdc/view?acc_num=wright1491317096530938</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Wright State University</style></publisher><pub-location><style face="normal" font="default" size="100%">Dayton</style></pub-location><volume><style face="normal" font="default" size="100%">Doctor of Philosophy (PhD)</style></volume><pages><style face="normal" font="default" size="100%">70</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We 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.
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Hilmar Lapp</style></author><author><style face="normal" font="default" size="100%">Sebastian Rudolph</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">On the Ontological Modeling of Trees</style></title><secondary-title><style face="normal" font="default" size="100%">8th Workshop on Ontology Design and Patterns - WOP2017</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Md Kamruzzaman Sarker</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Rule-based OWL Modeling with ROWLTab Protege Plugin</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2017</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>5</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Karl Hammar</style></author><author><style face="normal" font="default" size="100%">Eva Blomqvist</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Marieke van Erp</style></author><author><style face="normal" font="default" size="100%">Antske Fokkens</style></author><author><style face="normal" font="default" size="100%">Aldo Gangemi</style></author><author><style face="normal" font="default" size="100%">Willem Robert van Hage</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author><author><style face="normal" font="default" size="100%">Nazifa Karima</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Tom Narock</style></author><author><style face="normal" font="default" size="100%">Roxane Segers</style></author><author><style face="normal" font="default" size="100%">Monika Solanki</style></author><author><style face="normal" font="default" size="100%">Vojtech Svatek</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Collected Research Questions Concerning Ontology Design Patterns</style></title><secondary-title><style face="normal" font="default" size="100%">Ontology Engineering with Ontology Design Patterns: Foundations and Applications</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><publisher><style face="normal" font="default" size="100%">IOS Press</style></publisher><pub-location><style face="normal" font="default" size="100%">Amsterdam</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Gordon Watts</style></author><author><style face="normal" font="default" size="100%">Charles Vardeman</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Detector Final State pattern: Using the Web Ontology Language to describe a Physics Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Presented at the 17th International workshop on Advanced Computing and Analysis Techniques in physics research (ACAT), Valparaiso, Chile, January 2016.</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;
</style></abstract><notes><style face="normal" font="default" size="100%">&lt;p&gt;Presented at the&amp;nbsp;&lt;span&gt;17&lt;sup&gt;th&lt;/sup&gt; International workshop on Advanced Computing and Analysis Techniques in physics research (ACAT), Valparaiso, Chile, January 2016.&lt;/span&gt;&lt;/p&gt;
</style></notes></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>32</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Efficient Reasoning Algorithms for Fragments of Horn Description Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Department of Computer Science and Engineering, Wright State University</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><publisher><style face="normal" font="default" size="100%">Wright State University</style></publisher><pub-location><style face="normal" font="default" size="100%">Dayton, OH, USA</style></pub-location><volume><style face="normal" font="default" size="100%">PhD</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;
</style></abstract><work-type><style face="normal" font="default" size="100%">Dissertation</style></work-type></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Md Kamruzzaman Sarker</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Modeling OWL with Rules: The ROWL Protege Plugin</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1690/paper92.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">15th International Semantic Web Conference (ISWC) 2016</style></publisher><pub-location><style face="normal" font="default" size="100%">Kobe, Japan</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Abstract. 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Practical Acyclicity Notion for Query Answering Over Horn-SRIQ Ontologies</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web - {ISWC} 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part {I}</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2016</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-46523-4_5</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">70–85</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Conjunctive 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Giorgio Stefanoni</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">The Combined Approach to Query Answering Beyond the OWL 2 Profiles</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cs.ox.ac.uk/isg/people/cristina.feier/ijcai_rsafinal.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Combined 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Giorgio Stefanoni</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending the Combined Approach Beyond Lightweight Description Logics</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 28th International Workshop on Description Logics (DL)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://www.cs.ox.ac.uk/isg/people/cristina.feier/pdfs/dlmain.pdf</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Combined 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Patrick Obrien</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Jeff Mixter</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Ontology Design Pattern for Data Integration in the Library Domain</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 6th Workshop on Ontology and Semantic Web Patterns (WOP2015) co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, PA, USA, October 11, 2015</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2015</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;A 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Michelle Cheatham</style></author><author><style face="normal" font="default" size="100%">Sunje Dallmeir-Tiessen</style></author><author><style face="normal" font="default" size="100%">Patricia Herterich</style></author><author><style face="normal" font="default" size="100%">Michael D. Hildreth</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Kati Lassila-Perini</style></author><author><style face="normal" font="default" size="100%">Elizabeth Sexton-Kennedy</style></author><author><style face="normal" font="default" size="100%">Charles Vardeman</style></author><author><style face="normal" font="default" size="100%">Gordon Watts</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Eva Blomqvist</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Thomas Narock</style></author><author><style face="normal" font="default" size="100%">Monika Solanki</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Ontology Design Pattern for Particle Physics Analysis</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 6th Workshop on Ontology and Semantic Web Patterns (WOP 2015) co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pensylvania, USA, October 11, 2015</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2015</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2015</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1461/WOP2015_pattern_abstract_5.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">1461</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Sebastian Rudolph</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">C. Maria Keet</style></author><author><style face="normal" font="default" size="100%">Valentina A. M. Tamma</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">All But Not Nothing: Left-Hand Side Universals for Tractable OWL Profiles</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 11th International Workshop on OWL: Experiences and Directions (OWLED 2014) co-located with 13th International Semantic Web Conference on (ISWC 2014), Riva del Garda, Italy, October 17-18, 2014.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">Horn Logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year><pub-dates><date><style  face="normal" font="default" size="100%">10/2014</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1265/owled2014_submission_13.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">1265</style></volume><pages><style face="normal" font="default" size="100%">97-108</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">We 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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">EL-ifying Ontologies</style></title><secondary-title><style face="normal" font="default" size="100%">Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 19-22, 2014. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rewriting</style></keyword><keyword><style  face="normal" font="default" size="100%">Tractable Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-08587-6_36</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">464–479</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Amin Abdalla</style></author><author><style face="normal" font="default" size="100%">Yingjie Hu</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Naicong Li</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">An Ontology Design Pattern for Activity Reasoning</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the 5th Workshop on Ontology and Semantic Web Patterns (WOP2014) co-located with the 13th International Semantic Web Conference {(ISWC} 2014), Riva del Garda, Italy, October 19, 2014.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Activity</style></keyword><keyword><style  face="normal" font="default" size="100%">Ontology Design Pattern</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1302/paper8.pdf</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">78–81</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Activity 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pushing the Boundaries of Tractable Ontology Reasoning</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part II</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Tractable Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-11915-1_10</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">148–163</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">Ana Armas Romero</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs</style></title><secondary-title><style face="normal" font="default" size="100%">Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014.</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Tractable Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1193/paper_75.pdf</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">128–140</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Yingjie Hu</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Simon Scheider</style></author><author><style face="normal" font="default" size="100%">Werner Kuhn</style></author><author><style face="normal" font="default" size="100%">Gary Berg-Cross</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Mike Dean</style></author><author><style face="normal" font="default" size="100%">Dave Kolas</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A Geo-ontology Design Pattern for Semantic Trajectories</style></title><secondary-title><style face="normal" font="default" size="100%">Spatial Information Theory - 11th International Conference, COSIT 2013, Scarborough, UK, September 2-6, 2013. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Ontology Design Pattern</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Trajectory</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-01790-7_24</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">438–456</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Trajectory 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Simon Scheider</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author><author><style face="normal" font="default" size="100%">Charles Vardeman</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Philipp Cimiano</style></author><author><style face="normal" font="default" size="100%">Óscar Corcho</style></author><author><style face="normal" font="default" size="100%">Valentina Presutti</style></author><author><style face="normal" font="default" size="100%">Laura Hollink</style></author><author><style face="normal" font="default" size="100%">Sebastian Rudolph</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">An Ontology Design Pattern for Cartographic Map Scaling</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Map Scaling</style></keyword><keyword><style  face="normal" font="default" size="100%">Ontology Design Patterns</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-38288-8_6</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><volume><style face="normal" font="default" size="100%">7882</style></volume><pages><style face="normal" font="default" size="100%">76–93</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cong Wang</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">SROIQ Syntax Approximation by Using Nominal Schemas</style></title><secondary-title><style face="normal" font="default" size="100%">Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-1014/paper_31.pdf</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">988–999</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cong Wang</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas</style></title><secondary-title><style face="normal" font="default" size="100%">Web Reasoning and Rule Systems - 7th International Conference, {RR} 2013, Mannheim, Germany, July 27-29, 2013. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">EL++</style></keyword><keyword><style  face="normal" font="default" size="100%">Nominal Schemas</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2013</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-39666-3_6</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">65–79</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Extending 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending Description Logic Rules</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rules</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-30284-8_30</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">345–359</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Description 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pavel Klinov</style></author><author><style face="normal" font="default" size="100%">Matthew Horridge</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Integrating OWL and Rules: A Syntax Proposal for Nominal Schemas</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of OWL: Experiences and Directions Workshop 2012, Heraklion, Crete, Greece, May 27-28, 2012</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">05/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-849/paper_6.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><volume><style face="normal" font="default" size="100%">849</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">This 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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Joshi, Amit Krishna</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Raghava Mutharaju</style></author><author><style face="normal" font="default" size="100%">Kunal Sengupta</style></author><author><style face="normal" font="default" size="100%">Cong Wang</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Konf Connect</style></title><secondary-title><style face="normal" font="default" size="100%">Metadata Challenge at the 21st International Conference on World Wide Web (WWW 2012)</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><pub-location><style face="normal" font="default" size="100%">Lyon, France</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We present an application called Konf-Connect to improve&amp;nbsp;the conference attending experience of the people who attend a conference. This tool provides search facilities to nd people with similar&amp;nbsp;interests. The application makes use of Semantic Web dog food dataset&amp;nbsp;to gather information regarding the conference at hand. This is helpful for people attending the conference who are looking for networking&amp;nbsp;opportunities with people having expertise in the specic areas of interest. The application can also be extended to be used as general purpose&amp;nbsp;expert search system.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A logical geo-ontology design pattern for quantifying over types</style></title><secondary-title><style face="normal" font="default" size="100%">SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Biodiversity</style></keyword><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">Ontology Design Patterns</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://doi.acm.org/10.1145/2424321.2424352</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">239–248</style></pages><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Cong Wang</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Reasoning Approaches for Nominal Schemas</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><publisher><style face="normal" font="default" size="100%">JIST</style></publisher><pub-location><style face="normal" font="default" size="100%">Nara, Japan</style></pub-location><volume><style face="normal" font="default" size="100%">Poster and Demonstration Proceedings</style></volume></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matthias Knorr</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Frederick Maier</style></author><author><style face="normal" font="default" size="100%">Cong Wang</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Markus Krötzsch</style></author><author><style face="normal" font="default" size="100%">Umberto Straccia</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Recent Advances in Integrating OWL and Rules</style></title><secondary-title><style face="normal" font="default" size="100%">Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rules</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-33203-6_20</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Austria, Vienna</style></pub-location><volume><style face="normal" font="default" size="100%">7497</style></volume><pages><style face="normal" font="default" size="100%">225-228</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">As 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.</style></abstract></record></records></xml>