%0 Conference Paper %D Submitted %T Bridging RDF and Property Graphs: Linking KnowWhereGraph and SPOKE %A Shirly Stephen %A Cogan Shimizu %A Pascal Hitzler %A Karthik Soman %A Peter W Rose %A John H Morris %A Sergio E Baranzini %A Krzysztof Janowicz %A Antrea Christou %A Abhilekha Dalal %A Kitty Currier %A Mark Schildhauer %G eng %0 Conference Paper %D Submitted %T Explaining Deep Learning Hidden Neuron Activations using Concept Induction %A Abhilekha Dalal %A Md Kamruzzaman Sarker %A Adrita Barua %A Pascal Hitzler %X

One of the current key challenges in Explainable AI is in correctly interpreting activations of hidden neurons. It seems evident that accurate interpretations thereof would provide insights into the question what a deep learning system has internally detected as relevant on the input, thus lifting some of the black box character of deep learning systems.

The state of the art on this front indicates that hidden node activations appear to be interpretable in a way that makes sense to humans, at least in some cases. Yet, systematic automated methods that would be able to first hypothesize an interpretation of hidden neuron activations, and then verify it, are mostly missing. 

In this paper, we provide such a method and demonstrate that it provides meaningful interpretations. It is based on using large-scale background knowledge -- a class hierarchy of approx. 2 million classes curated from the Wikipedia Concept Hierarchy -- together with a symbolic reasoning approach called concept induction based on description logics that was originally developed for applications in the Semantic Web field. 

Our results show that we can automatically attach meaningful labels from the background knowledge to individual neurons in the dense layer of a Convolutional Neural Network through a hypothesis and verification process.

%G eng %0 Conference Paper %D Submitted %T KnowWhereGraph-Lite: A Perspective of the KnowWhereGraph %A Cogan Shimizu %A Shirly Stephen %A Antrea Christou %A Kitty Currier %A Mohammad Saeid Mahdavinejad %A Sanaz Saki Norouzi %A Abhilekha Dalal %A Adrita Barua %A Colby K. Fisher %A Anthony D’Onofrio %A Thomas Thelen %A Krzysztof Janowicz %A Dean Rehberger %A Mark Schildhauer %A Pascal Hitzler %G eng %0 Book Section %D In Press %T Ontology-based Data Organization for the Enslaved Project %A Cogan Shimizu %A Pascal Hitzler %G eng %0 Report %D 2023 %T Conversational Ontology Alignment with ChatGPT %A Sanaz Saki Norouzi %A Mohammad Saeid Mahdavinejad %A Pascal Hitzler %G eng %0 Report %D 2023 %T The KnowWhereGraph Ontology %A Cogan Shimizu %A Shirly Stephen %A Kitty Currier %A Pascal Hitzler %A Rui Zhu %A Krzysztof Janowicz %A Mark Schildhauer %A Mohammad Saeid Mahdavinejad %A Abhilekha Dalal %A Adrita Barua %A Ling Cai %A Gengchen Mai %A Zhangyu Wang %A Yuanyuan Tian %A Sanaz Saki Norouzi %A Zilong Liu %A Meilin Shi %A Colby K. Fisher %G eng %0 Conference Paper %D 2023 %T The KnowWhereGraph Ontology: A Showcase %A Cogan Shimizu %A Shirly Stephen %A Rui Zhu %A Kitty Currier %A Mark Schildhauer %A Dean Rehberger %A Pascal Hitzler %A Krzysztof Janowicz %A Colby K. Fisher %A Mohammad Saeid Mahdavinejad %A Antrea Christou %A Adrita Barua %A Abhilekha Dalal %A Sanaz Saki Norouzi %A Zilong Liu %A Meilin Shi %A Ling Cai %A Gengchen Mai %A Zhangyu Wang %A Yuanyuan Tian %G eng %0 Report %D 2023 %T MMODS-O: A Modular Ontology for the Metadata Object Description Schema (MODS) – Documentation %A Rushrukh Rayan %A Cogan Shimizu %A Pascal Hitzler %X

We are presenting the documentation for MMODS-O, an ontology derived from the Metadata Object Description Schema (MODS, version 3.8), which is an XML Schema by The Library of Congress. The XML Schema concerns metadata pertaining to bibliographic elements, however it is also used for other purposes, for instance LCACommons which is an interagency community that focues on Life Cycle Analysis, National Agricultural Library -- require the metadata to be in MODS format.  Our motivation for developing this ontology -- including how it relates to previous attempts -- will be described elsewhere. This documentation is intended for readers who are familiar with MODS XML schema.

%G eng %0 Conference Paper %D 2023 %T A Modular Ontology for MODS – Metadata Object Description Schema %A Rushrukh Rayan %A Cogan Shimizu %A Heidi Sieverding %A Pascal Hitzler %X

The Metadata Object Description Schema (MODS) was developed to describe bibliographic concepts and metadata and is maintained by the Library of Congress. Its authoritative version is given as an XML schema based on an XML mindset which means that it has significant limitations for use in a knowledge graphs context. We have therefore developed the Modular MODS Ontology (MMODS-O) which incorporates all elements and attributes of the MODS XML schema. In designing the ontology, we adopt the recent Modular Ontology Design Methodology (MOMo) with the intention to strike a balance between modularity and quality ontology design on the one hand, and conservative backward compatibility with MODS on the other. 

%G eng %0 Conference Paper %D 2023 %T An Ontology Design Pattern for Role-Dependent Names %A Rushrukh Rayan %A Cogan Shimizu %A Pascal Hitzler %X

We present an ontology design pattern for modeling Names as part of Roles, to capture scenarios where an Agent performs different Roles using different Names associated with the different Roles. Examples of an Agent performing a Role using different Names are rather ubiq- uitous, e.g., authors who write under different pseudonyms, or different legal names for citizens of more than one country. The proposed pattern is a modified merger of a standard Agent Role and a standard Name pattern stub.

%G eng %0 Report %D 2023 %T Openness and Transparency in Academic Publishing: A Decade of Data from the Semantic Web Journal %A Pascal Hitzler %A Krzysztof Janowicz %A Cogan Shimizu %A Abhilekha Dalal %A Aaron Eberhart %A Andrew Eells %A Sanaz Saki Norouzi %G eng %0 Journal Article %J Semantic Web %D 2022 %T Diverse data! Diverse schemata? %A Krzysztof Janowicz %A Cogan Shimizu %A Pascal Hitzler %A Gengchen Mai %A Shirly Stephen %A Rui Zhu %A Ling Cai %A Lu Zhou %A Mark Schildhauer %A Zilong Liu %A Zhangyu Wang %A Meilin Shi %B Semantic Web %V 13 %P 1–3 %G eng %U https://doi.org/10.3233/SW-210453 %R 10.3233/SW-210453 %0 Journal Article %J Journal of Logic and Computation %D 2022 %T An efficient algorithm for reasoning over OWL EL ontologies with nominal schemas %A Carral, David %A Zalewski, Joseph %A Hitzler, Pascal %X

{Nominal schemas have been proposed as an extension to Description Logics (DL), the knowledge representation paradigm underlying the Web Ontology Language (OWL). They provide for a very tight integration of DL and rules. Nominal schemas can be understood as syntactic sugar on top of OWL. However, this naive perspective leads to inefficient reasoning procedures. In order to develop an efficient reasoning procedure for the language \\$\\{\\mathcal \\{E\\}\\mathcal \\{L\\}\\mathcal \\{V\\}^\\{++\\}\\}\\$, which results from extending the OWL profile language OWL EL with nominal schemas, we propose a transformation from \\$\\{\\mathcal \\{E\\}\\mathcal \\{L\\}\\mathcal \\{V\\}^\\{++\\}\\}\\$ ontologies into Datalog-like rule programs that can be used for satisfiability checking and assertion retrieval. The use of this transformation enables the use of powerful Datalog engines to solve reasoning tasks over \\$\\{\\mathcal \\{E\\}\\mathcal \\{L\\}\\mathcal \\{V\\}^\\{++\\}\\}\\$ ontologies. We implement and then evaluate our approach on several real-world, data-intensive ontologies, and find that it can outperform state-of-the-art reasoners such as Konclude and ELK. As a lesser side result we also provide a self-contained description of a rule-based algorithm for \\$\\{\\mathcal \\{E\\}\\mathcal \\{L\\}^\\{++\\}\\}\\$, which does not require a normal form transformation.}

%B Journal of Logic and Computation %8 05 %G eng %U https://doi.org/10.1093/logcom/exac032 %R 10.1093/logcom/exac032 %0 Journal Article %J AI Magazine %D 2022 %T Know, Know Where, KnowWhereGraph: A Densely Connected, Cross-Domain Knowledge Graph and Geo-Enrichment Service Stack for Applications in Environmental Intelligence %A Krzysztof Janowicz %A Pascal Hitzler %A Wenwen Li %A Dean Rehberger %A Mark Schildhauer %A Rui Zhu %A Cogan Shimizu %A Colby K. Fisher %A Ling Cai %A Gengchen Mai %A Joseph Zalewski %A Lu Zhou %A Shirly Stephen %A Seila Gonzalez %A Bryce Mecum %A Anna Lopez Carr %A Andrew Schroeder %A Dave Smith %A Dawn Wright %A Sizhe Wang %A Yuanyuan Tian %A Zilong Liu %A Meilin Shi %A Anthony D’Onofrio %A Zhining Gu %B AI Magazine %G eng %0 Conference Paper %B The Semantic Web - 19th International Conference, ESWC 2022, Hersonissos, Crete, Greece, May 29 - June 2, 2022 %D 2022 %T LD Connect: A Linked Data Portal for IOS Press Scientometrics %A Zilong Liu %A Meilin Shi %A Krzysztof Janowicz %A Gengchen Mai %A Rui Zhu %A Stephanie Delbeque %A Pascal Hitzler %B The Semantic Web - 19th International Conference, ESWC 2022, Hersonissos, Crete, Greece, May 29 - June 2, 2022 %I Springer %8 2022 %G eng %0 Book Section %B Neuro-Symbolic Artificial Intelligence: The State of the Art %D 2022 %T Neural-Symbolic Learning and Reasoning: A Survey and Interpretation %A Tarek R. Besold %A Artur S. d'Avila Garcez %A Sebastian Bader %A Howard Bowman %A Pedro Domingos %A Pascal Hitzler %A Kai-Uwe Kühnberger %A Luís C. Lamb %A Daniel Lowd %A Priscila Machado Vieira Lima %A Leo de Penning %A Gadi Pinkas %A Hoifung Poon %A Gerson Zaverucha %B Neuro-Symbolic Artificial Intelligence: The State of the Art %I IOS Press %C Amsterdam %G eng %0 Journal Article %J National Science Review %D 2022 %T Neuro-symbolic approaches in artificial intelligence %A Pascal Hitzler %A Aaron Eberhart %A Monireh Ebrahimi %A Md Kamruzzaman Sarker %A Lu Zhou %B National Science Review %V 9 %8 06/2022 %G eng %U https://academic.oup.com/nsr/article/9/6/nwac035/6542460 %N 6 %R https://doi.org/10.1093/nsr/nwac035 %0 Journal Article %J AI Communications %D 2022 %T Neuro-Symbolic Artificial Intelligence: Current Trends %A Md Kamruzzaman Sarker %A Lu Zhou %A Aaron Eberhart %A Pascal Hitzler %B AI Communications %V 34 %8 2022 %G eng %N 3 %& 197 %0 Book %B Frontiers in Artificial Intelligence and Applications %D 2022 %T Neuro-Symbolic Artificial Intelligence - The State of the Art %A Pascal Hitzler %A Md Kamruzzaman Sarker %B Frontiers in Artificial Intelligence and Applications %I IOS Press %C Amsterdam %G eng %U https://www.iospress.com/catalog/books/neuro-symbolic-artificial-intelligence-the-state-of-the-art %0 Journal Article %J Semantic Web %D 2021 %T Advancing Agriculture through Semantic Data Management %A Pascal Hitzler %A Krzysztof Janowicz %A Ajay Sharda %A Cogan Shimizu %B Semantic Web %V 12 %G eng %N 4 %9 Editorial %& 1 %0 Conference Proceedings %B Workshop on Ontology Design and Patterns %D 2021 %T Aligning Patterns to the Wikibase Model %A Andrew Eells %A Cogan Shimizu %A Lu Zhou %A Pascal Hitzler %A Seila Gonzalez Estrecha %A Dean Rehberger %B Workshop on Ontology Design and Patterns %G eng %0 Conference Paper %B International Semantic Web Conference Poster and Demos %D 2021 %T Automatically Generating Human Readable Documentation for Ontology Design Patterns %A Cogan Shimizu %A Pascal Hitzler %B International Semantic Web Conference Poster and Demos %G eng %0 Conference Paper %B KGSWC-2021 %D 2021 %T Bridging Upper Ontology and Modular Ontology Modeling: A Tool and Evaluation %A Abhilekha Dalal %A Cogan Shimizu %A Pascal Hitzler %X

Ontologies are increasingly used as schema for knowledge graphs in many application areas. As such, there are a variety of different approaches for their development. In this paper, we describe and evaluate UAO (for Upper Ontology Alignment Tool), which is an extension to CoModIDE, a graphical prote'ge' plugin for modular ontology modeling. UAO enables ontology engineers to combine modular ontology modeling with a more traditional ontology modeling approach based on upper ontologies. We posit -- and our evaluation supports this claim -- that the tool does indeed makes it easier to combine both approaches. Thus, UAO enables a best-of-both-worlds approach. The evaluation consists of a user study, and the results show that performing typical manual alignment modeling tasks is relatively easier with UAO than doing it with porte'ge' alone, in terms of the time required to complete the task and improving the correctness of the output. Additionally, our test subjects provided significantly higher ratings on the System Utilization Scale for UOA.

%B KGSWC-2021 %G eng %0 Manuscript %D 2021 %T On the Capabilities of Pointer Networks for Deep Deductive Reasoning %A Monireh Ebrahimi %A Aaron Eberhart %A Pascal Hitzler %B arXiv %G eng %6 arXiv:2106.09225 %0 Conference Paper %B DaMaLOS 2021 @ ISWC %D 2021 %T Environmental Observations in Knowledge Graphs %A Rui Zhu %A Shirly Stephen Ambrose %A Lu Zhou %A Cogan Shimizu %A Ling Cai %A Gengchen Mai %A Krzysztof Janowicz %A Pascal Hitzler %A Mark Schildhauer %X

The notion of Linked Open Science rests on the assumption that Linked Data principles contribute to science and scientific data management in several distinct ways (e.g., by adding rich semantics to improve retrieval and reuse of data). This begs the question of the right level of granularity for such semantic enrichment. On the one extreme of the spectrum, one may provide semantic annotations on the level of entire datasets to improve retrieval while leaving the actual data untouched. On the other end, one may semantically describe every single datum, such as a particular observation leading to data that supports reasoning, automated conflation, and so on, while, at the same time, dramatically increasing the size of data, including redundancy. This paper reports on our experience in modeling heterogeneous environmental data using a semantically-enabled observation framework, namely the SOSA ontology and its extensions to handle observation collections. We discuss different means of using these observation collections and compare their pros and cons in terms of data size and ease of querying. 

%B DaMaLOS 2021 @ ISWC %G eng %0 Conference Paper %B ESWC 2021 %D 2021 %T Expressibility of OWL Axioms with Patterns %A Aaron Eberhart %A Cogan Shimizu %A Sulogna Chowdhury %A Md Kamruzzaman Sarker %A Pascal Hitzler %X

The high expressivity of the Web Ontology Language (OWL) makes it possible to describe complex relationships between classes, roles, and individuals in an ontology. However, this high expressivity can be an obstacle to correct usage and wide adoption. Past attempts to ameliorate this have included the development of specific, presumably human-friendly syntaxes, such as the Manchester syntax or graphical interfaces for OWL axioms, albeit with limited success. If modelers want to develop suitable OWL axioms it is important to make this as easy as possible. In this paper, we adopt an idea from the Protégé plug-in, OWLAx, which provides a simple, clickable interface to automatically input axioms of a limited number of types by following simple axiom patterns. In particular, each of these axiom patterns contains at most three classes or roles. We hypothesize that most of the axioms in existing ontologies could be expressed semantically in terms of simple patterns like these, which would mean that more complex patterns can be used very sparingly. Our findings, based on an analysis of 518 ontologies from six public ontology repositories, confirm this hypothesis: Over 90% of class axioms in the average ontology are indeed expressible with our simple patterns. We provide a detailed analysis of our findings.

%B ESWC 2021 %G eng %0 Conference Paper %B International Semantic Web Conference %D 2021 %T InK Browser - The Interactive Knowledge Browser %A Joseph Zalewski %A Lu Zhou %A Cogan Shimizu %A Pascal Hitzler %X

We present an improved implementation of the Interactive Knowledge Browser (InK Browser), a tool for exploring knowledge graphs visually, using a schema diagram.

%B International Semantic Web Conference %V 20 %G eng %0 Journal Article %J Semantic Web %D 2021 %T Modular Ontology Modeling %A Cogan Shimizu %A Karl Hammar %A Pascal Hitzler %B Semantic Web %G eng %0 Conference Paper %B AAAI-MAKE 2021 %D 2021 %T Neuro-Symbolic Deductive Reasoning for Cross-Knowledge Graph Entailment %A Monireh Ebrahimi %A Md Kamruzzaman Sarker %A Federico Bianchi %A Ning Xie %A Aaron Eberhart %A Derek Doran %A HyeongSik Kim %A Pascal Hitzler %B AAAI-MAKE 2021 %I AAAI %G eng %0 Journal Article %J Semantic Web %D 2021 %T Open Science data and the Semantic Web journal %A Pascal Hitzler %A Krzysztof Janowicz %A Cogan Shimizu %A Lu Zhou %A Andrew Eells %B Semantic Web %V 12(3) %8 2021 %G eng %9 Editorial %& 401-402 %R 10.3233/SW-210427 %0 Conference Paper %B The 10th International Joint Conference on Knowledge Graphs, IJCKG 2021, December 6-8, 2021, Virtual Event, Thailand %D 2021 %T A Pattern for Features on a Hierarchical Spatial Grid %A Cogan Shimizu %A Rui Zhu %A Gengchen Mai %A Mark Schildhauer %A Krzysztof Janowicz %A Pascal Hitzler %B The 10th International Joint Conference on Knowledge Graphs, IJCKG 2021, December 6-8, 2021, Virtual Event, Thailand %I ACM %G eng %0 Conference Paper %B 13th Workshop on Ontology Design and Patterns %D 2021 %T A Pattern for Modeling Causal Relations Between Events %A Cogan Shimizu %A Rui Zhu %A Genchen Mai %A Mark Schildhauer %A Krzysztof Janowicz %A Pascal Hitzler %B 13th Workshop on Ontology Design and Patterns %G eng %0 Book Section %B Advances in Pattern-Based Ontology Engineering %D 2021 %T Seed Patterns for Modeling Trees %A Aaron Eberhart %A David Carral %A Pascal Hitzler %A Hilmar Lapp %A Sebastian Rudolph %X 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. %B Advances in Pattern-Based Ontology Engineering %I IOS Press %P 48-67 %G eng %0 Report %D 2021 %T Semantic Compression with Region Calculi in Nested Hierarchical Grids (Technical Report) %A Joseph Zalewski %A Pascal Hitzler %A Krzysztof Janowicz %K Hierarchical Grids %K Knowledge Graphs %K RCC5 %X

We propose the combining of region connection calculi with nested hierarchical grids for representing spatial region data in the context of knowledge graphs, thereby avoiding reliance on vector representations. We present a resulting region calculus, and provide qualitative and formal evidence that this representation can be favorable with large data volumes in the context of knowledge graphs; in particular we study means of efficiently choosing which triples to store to minimize space requirements when data is represented this way, and we provide an algorithm for finding the smallest possible set of triples for this purpose including an asymptotic measure of the size of this set for a special case. We prove that a known constraint calculus is adequate for the reconstruction of all triples describing a region from such a pruned representation, but problematic for reasoning with hierarchical grids in general.

%G eng %0 Conference Paper %B Proceedings of the 29th International Conference on Advances in Geographic Information Systems %D 2021 %T Semantic Compression with Region Calculi in Nested Hierarchical Grids %A Zalewski, Joseph %A Hitzler, Pascal %A Janowicz, Krzysztof %K Hierarchical Grids %K Knowledge Graphs %K RCC5 %X

We propose the combining of region connection calculi with nested hierarchical grids for representing spatial region data in the context of knowledge graphs, thereby avoiding reliance on vector representations. We present a resulting region calculus, and provide qualitative and formal evidence that this representation can be favorable with large data volumes in the context of knowledge graphs; in particular we study means of efficiently choosing which triples to store to minimize space requirements when data is represented this way, and we provide an algorithm for finding the smallest possible set of triples for this purpose including an asymptotic measure of the size of this set for a special case. We prove that a known constraint calculus is adequate for the reconstruction of all triples describing a region from such a pruned representation, but problematic for reasoning with hierarchical grids in general.

%B Proceedings of the 29th International Conference on Advances in Geographic Information Systems %I Association for Computing Machinery %C New York, NY, USA %P 305–308 %@ 9781450386647 %G eng %U https://doi.org/10.1145/3474717.3483965 %R 10.1145/3474717.3483965 %0 Conference Paper %B The 10th International Joint Conference on Knowledge Graphs, IJCKG 2021, December 6-8, 2021, Virtual Event, Thailand %D 2021 %T SOSA-SHACL: Shapes Constraint for the Sensor, Observation, Sample, and Actuator Ontology %A Rui Zhu %A Cogan Shimizu %A Shirly Stephen %A Lu Zhou %A Ling Cai %A Gengchen Mai %A Krzysztof Janowicz %A Mark Schildhauer %A Pascal Hitzler %B The 10th International Joint Conference on Knowledge Graphs, IJCKG 2021, December 6-8, 2021, Virtual Event, Thailand %I ACM %G eng %0 Conference Proceedings %B International Conference on Cognitive Modeling %D 2021 %T Toward Undifferentiated Cognitive Models %A Colin Kupitz %A Aaron Eberhart %A Daniel Schmidt %A Christopher Stevens %A Cogan Shimizu %A Pascal Hitzler %A Dario Salvucci %A Benji Maruyama %A Chris Myers %X Autonomous systems are a new frontier for pushing sociotechnical advancement. Such systems will eventually become pervasive, involved in everything from manufacturing, healthcare, defense, and even research itself. However, proliferation is stifled by the high development costs and the resulting inflexibility of the produced systems. The current time needed to create and integrate state of the art autonomous systems that operate as team members in complex situations is a 3-15 year development period, often requiring humans to adapt to limitations in the resulting systems. A new research thrust in interactive task learning (ITL) has begun, calling for natural human-autonomy interaction to facilitate system flexibility and minimize users’ complexity in providing autonomous systems with new tasks. We discuss the development of an undifferentiated agent with a modular framework as a method of approaching that goal. %B International Conference on Cognitive Modeling %7 19 %G eng %0 Book Section %B Advances in Ontology Design Patterns %D 2021 %T Towards a Modular Ontology for Space Weather Research %A Cogan Shimizu %A Ryan McGranaghan %A Aaron Eberhart %A Adam C. Kellerman %B Advances in Ontology Design Patterns %I IOS Press %G eng %0 Journal Article %J Applied Intelligence %D 2021 %T Towards Bridging the Neuro-Symbolic Gap: Deep Deductive Reasoners %A Monireh Ebrahimi %A Aaron Eberhart %A Federico Bianchi %A Pascal Hitzler %B Applied Intelligence %G eng %0 Thesis %B Department of Computer Science %D 2021 %T Towards generalizable neuro-symbolic reasoners %A Monireh Ebrahimi %B Department of Computer Science %I Kansas State University %C Manhattan, KS %V PhD %8 08/2021 %G eng %U https://krex.k-state.edu/dspace/handle/2097/41621 %9 Dissertation %0 Thesis %B Department of Computer Science %D 2020 %T Advances in modular ontology engineering: methodology and infrastructure %A Cogan Shimizu %X

Modular ontology engineering is a methodology for producing highly reusable knowledge graph schema. Over the course of this dissertation, we outline a number of contributions that have improved the process to what we see today. These contributions fall within four categories: conveying meaning through schema diagrams, the composition of a modular ontology, the modular ontology engineering methodology, and modular graphical modeling.

First, we created an improved method and tool for generating schema diagrams similar to those manually generated by humans and show that most of OWL, as it is used in real world ontologies, are expressible in this format.

Next, we examined and improved the ontology design pattern development process. This was accomplished through the development of both patterns and modules, extensions to the ontology design pattern representation language, and a tool that significantly improves the usability of these annotations. This work culminated in MODL: a modular ontology design library, which is a distributable set of curated, well-documented ODPs, both novel and drawn from the ontology design pattern portal.

These advances were combined, and building upon the state of the art, to create the Comprehensive Modular Ontology Design IDE (CoModIDE), which is a plugin for the industry-standard ontology editor, Protege. 

Finally, as a culmination of the tool and the methodology, we evaluated CoModIDE, where it was shown to significantly improve outcomes for experienced and new ontology developers when developing modular ontologies.

Altogether, these research topics, resulted in a methodology, that when executed, produced actually reusable, extendable, and adaptable ontologies. 

%B Department of Computer Science %I Kansas State University %C Manhattan %V Ph.D. %P 175 %8 08/2020 %G eng %9 Cumulative %0 Conference Proceedings %B Ontology Matching %D 2020 %T AROA Results of OAEI 2020 %A Lu Zhou %A Pascal Hitzler %B Ontology Matching %I Springer %8 12/2020 %G eng %0 Conference Proceedings %B Proceedings of the AAAI 2020 Spring Symposium on Combining Machine Learning and Knowledge Engineering in Practice %D 2020 %T Completion Reasoning Emulation for the Description Logic EL+ %A Aaron Eberhart %A Monireh Ebrahimi %A Lu Zhou %A Cogan Shimizu %A Pascal Hitzler %K Deep Learning %K Description Logic %K EL+ %K LSTM %K NeSy %K Reasoning %X

We present a new approach to integrating deep learning with knowledge-based systems that we believe shows promise. Our approach seeks to emulate reasoning structure, which can be inspected part-way through, rather than simply learning reasoner answers, which is typical in many of the black-box systems currently in use. We demonstrate that this idea is feasible by training a long short-term memory (LSTM) artificial neural network to learn EL+ reasoning patterns with two different data sets. We also show that this trained system is resistant to noise by corrupting a percentage of the test data and comparing the reasoner's and LSTM's predictions on corrupt data with correct answers.

%B Proceedings of the AAAI 2020 Spring Symposium on Combining Machine Learning and Knowledge Engineering in Practice %I CEUR-WS.org %C Stanford University, Palo Alto, California, USA %V 2600 %8 03/2020 %G eng %U http://ceur-ws.org/Vol-2600/paper5.pdf %0 Generic %D 2020 %T Counterfactual reasoning over large-scale human performance optimization experiments %A Ion Juvina %A William R. Aue %A Brandon Minnery %A Pascal Hitzler %A Srikanth Nadella %A Md Kamruzzaman Sarker %B Virtual poster presented at the annual meeting of the Psychonomic Society, November 2020 %0 Conference Paper %B CIKM'20: The 29th ACM International Conference on Information and Knowledge Management, Virtual Event, Ireland, October 19-23, 2020 %D 2020 %T CSSA'20: Workshop on Combining Symbolic and Sub-Symbolic Methods and their Applications %A Mehwish Alam %A Paul Groth %A Pascal Hitzler %A Heiko Paulheim %A Harald Sack %A Volker Tresp %B CIKM'20: The 29th ACM International Conference on Information and Knowledge Management, Virtual Event, Ireland, October 19-23, 2020 %I ACM %P 3523-3524 %G eng %0 Generic %D 2020 %T Data Integration with Knowledge Graphs: A Space Weather Use-case %A Cogan Shimizu %A Ryan McGranaghan %A Adam C. Kellerman %C American Geophysical Union (AGU) Fall Meeting 2020 %G eng %0 Conference Paper %B KGSWC %D 2020 %T A Domain Ontology for Task Instructions %A Aaron Eberhart %A Cogan Shimizu %A Christopher Stevens %A Pascal Hitzler %A Christopher W. Myers %A Benji Maruyam %X Knowledge graphs and ontologies represent information in a variety of different applications. One use case, the Intelligence, Surveillance, & Reconnaissance: Mutli-Attribute Task Battery (ISR-MATB), comes from Cognitive Science, where researchers use interdisciplinary methods to understand the mind and cognition. The ISR-MATB is a set of tasks that a cognitive or human agent perform which test visual, auditory, and memory capabilities. An ontology can represent a cognitive agent’s background knowledge of the task it was instructed to perform and act as an interchange format between different Cognitive Agent tasks similar to ISR-MATB. We present several modular patterns for representing ISR-MATB task instructions, as well as a unified diagram that links them together. %B KGSWC %G eng %0 Conference Paper %B 29th ACM International Conference on Information and Knowledge Management %D 2020 %T The Enslaved Dataset: A Real-world Complex Ontology Alignment Benchmark using Wikibase %A Lu Zhou %A Cogan Shimizu %A Pascal Hitzler %A Alicia M Sheill %A Seila Gonzalez Estrecha %A Catherine Foley %A Duncan Tarr %A Dean Rehberger %B 29th ACM International Conference on Information and Knowledge Management %I ACM %8 10/2020 %G eng %0 Journal Article %J Journal of Web Semantics %D 2020 %T The Enslaved Ontology: Peoples of the Historic Slave Trade %A Cogan Shimizu %A Pascal Hitzler %A Quinn Hirt %A Dean Rehberger %A Seila Gonzalez Estrecha %A Catherine Foley %A Alicia M. Sheill %A Walter Hawthorne %A Jeff Mixter %A Ethan Watrall %A Ryan Carty %A Duncan Tarr %K data integration %K digital humanities %K history of the slave trade %K modular ontology %K Ontology Design Patterns %X

We present the Enslaved Ontology (V1.0) which was developed for integrating data about the historic slave trade from diverse sources in a use case driven by historians. Ontology development followed modular ontology design principles as derived from ontology design pattern application best practices and the eXtreme Design Methodology. Ontology content focuses on data about historic persons and the event records from which this data can be taken. It also incorporates provenance modeling and some temporal and spatial aspects. The ontology is available as serialized in the Web Ontology Language OWL, and carries modularization annotations using the Ontology Pattern Language (OPLa). It is available under the Creative Commons CC BY 4.0 license.

%B Journal of Web Semantics %V 63 %8 08/2020 %G eng %R https://doi.org/10.1016/j.websem.2020.100567 %0 Conference Paper %B Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, SPIE %D 2020 %T A Framework for Explainable Deep Neural Models Using External Knowledge Graphs %A Zachary A. Daniels %A Logan D. Frank %A Christopher J. Menart %A Michael Raymer %A Pascal Hitzler %B Artificial Intelligence and Machine Learning for Multi-Domain Operations Applications, SPIE %G eng %0 Generic %D 2020 %T A Functional API for OWL %A Aaron Eberhart %A Pascal Hitzler %X We present (f OWL), a minimalistic, functional programming style ontology editor that is based directly on the OWL 2 Structural Specification. (f OWL) is written from scratch, entirely in Clojure, having no other dependencies. Ontologies in (f OWL) are implemented as standalone and homogeneous data structures, which means that the same exact functions written for single axioms or expressions often work identically on any part of an ontology, even the entire ontology itself. The lazy functional style of Clojure also allows for intuitive and simple ontology creation and modification with a minimal memory footprint. All of this is possible without ever needing to use a single class, except of course in the Ontologies one creates! %B The 19th International Semantic Web Conference %V 2721 %0 Conference Paper %B International conference on information and knowledge management %D 2020 %T GeoLink Cruises: A Non-Synthetic Benchmark for Co-Reference Resolution on Knowledge Graphs %A Reihaneh Amini %A Lu Zhou %A Pascal Hitzler %B International conference on information and knowledge management %I ACM DL %8 10/2020 %G eng %0 Journal Article %J Data Intelligence %D 2020 %T GeoLink Dataset: A Complex Alignment Benchmark from Real-world Ontology %A Lu Zhou %A Michelle Cheatham %A Adila Krisnadhi %A Pascal Hitzler %B Data Intelligence %G eng %0 Journal Article %J Semantic Web %D 2020 %T Gold-Level Open Access at the Semantic Web Journal %A Krzysztof Janowicz %A Pascal Hitzler %B Semantic Web %V 11 %G eng %U http://www.semantic-web-journal.net/content/gold-level-open-access-semantic-web-journal %N 1 %0 Book %B Studies on the Semantic Web %D 2020 %T Knowledge Graphs for eXplainable Artificial Intelligence: Foundations, Applications and Challenges %A Ilaria Tiddi %A Freddy Lécué %A Pascal Hitzler %B Studies on the Semantic Web %I IOS Press %C Amsterdam %V 47 %G eng %U https://www.iospress.nl/book/knowledge-graphs-for-explainable-artificial-intelligence-foundations-applications-and-challenges/ %0 Conference Paper %B The Semantic Web - 17th International Conference, ESWC 2020, Heraklion, Crete, Greece, May 31-June 4, 2020, Proceedings %D 2020 %T Modular Graphical Ontology Engineering Evaluated %A Cogan Shimizu %A Karl Hammar %A Pascal Hitzler %E Andreas Harth %E Sabrina Kirrane %E Axel-Cyrille Ngonga Ngomo %E Heiko Paulheim %E Anisa Rula %E Anna Lisa Gentile %E Peter Haase %E Michael Cochez %B The Semantic Web - 17th International Conference, ESWC 2020, Heraklion, Crete, Greece, May 31-June 4, 2020, Proceedings %I Springer %V 12123 %P 20–35 %G eng %U https://doi.org/10.1007/978-3-030-49461-2\2 %R 10.1007/978-3-030-49461-2\2 %0 Book Section %B Applications and Practices in Ontology Design, Extraction, and Reasoning %D 2020 %T Modular Ontology Modeling: A Tutorial %A Cogan Shimizu %A Pascal Hitzler %A Adila Krisnadhi %X

We provide an in-depth example of modular ontology engineering with ontology design patterns. The style and content of this chapter is adapted from previous work and tutorials on Modular Ontology Modeling. It o ers expanded steps and updated tool information. The tutorial is largely self-contained, but assumes that the reader is familiar with the Web Ontology Language OWL; however, we do briefly review some foundational concepts. By the end of the tutorial, we expect
the reader to have an understanding of the underlying motivation and methodology for producing a modular ontology.

%B Applications and Practices in Ontology Design, Extraction, and Reasoning %I IOS Press %V 49 %G eng %& 1 %0 Conference Paper %B The 19th International Semantic Web Conference %D 2020 %T Modular Ontology Modeling Meets Upper Ontologies: The Upper Ontology Alignment Tool %A Abhilekha Dalal %A Cogan Shimizu %A Pascal Hitzler %X

We provide an extension to the Prote'ge'-based modular ontology engineering tool CoModIDE, in order to make it possible for ontology engineers to adhere to traditional ontology modeling processes based on upper or foundational ontologies. As a bridge between the more recently proposed modular ontology modeling approach and more classical ones based on foundational ontologies, it enables a best-of-both-worlds approach for ontology engineering.

%B The 19th International Semantic Web Conference %V 2721 %P 119-124 %8 10/2020 %G eng %0 Thesis %B Department of Computer Science %D 2020 %T Modular Ontology Modeling Meets Upper Ontologies: The Upper Ontology Alignment Tool %A Abhilekha Dalal %X

Ontology modeling has become a primary approach to schema generation for data integration and knowledge graphs in many application areas. The quest for efficient approaches to model useful and re-useable ontologies has led to different ontology creation proposals over the years. The project focuses on two major approaches, modeling using a top-level ontology, and the other is modular ontology modeling.

The traditional approach is based on top-level ontology, and the strategy is to utilize ontology that is comprehensive enough to cover a broad spectrum of domains through their universal terminologies. In this way, all domain ontologies share a common top-level formal ontology in which their respective root nodes can be defined, and hence consistency is assured across the knowledge graph. Nevertheless, the most recent approach is quite different and is a refinement of the eXtreme Ontology Design methodology based on the ontology design patterns. Whole ontology is viewed as a collection of interconnected modules, and modules are developed around the classified fundamental notions according to experts' terminology or the use-case. Having developed modules in a fashion of divide and conquer, these modules are shareable and reusable among some other ontology if needed, and consequently, the ontology being FAIR is justified (findable, accessible, interoperable, and reusable).

Although, it has been argued that there are advantages to either paradigm, it is possible to have a combination of both approaches mentioned earlier, depending upon the use-case or the preferences of the ontology engineers. We provide an extension to the Protégé - based modular ontology engineering tool CoModIDE, in order to make it possible for ontology engineers to follow traditional, ad-hoc ontology modeling approach, alongside more modern paradigms such as modular ontology engineering. The project focuses on domain-level ontology developers or organizations dealing with ontology development, which may get help through the plugin in minimizing the tooling gap to unite paradigms and develop robust, flexible ontologies suitable to their needs. As a bridge between the more recently proposed modular ontology modeling approach and more classical ones based on foundational ontologies, it enables a best-of-both-worlds approach for ontology engineering. 

%B Department of Computer Science %I Kansas State University %C Manhattan %V Masters %P 35 %8 11/2020 %G eng %0 Journal Article %J PLoS ONE %D 2020 %T Multimodal mental health analysis in social media %A Amir Hossein Yazdavar %A Mohammad Saeid Mahdavinejad %A Goonmeet Baja %A William Romine %A Amit Sheth %A Amir Hassan Monadjemi %A Krishnaprasad Thirunarayan %A John M. Meddar %A Annie Myers %A Jyotishman Pathak %A Pascal Hitzler %K Explainable Machine Learning %K Hypothesis Testing %K National Language Processing %K Prediction %K Regression %X

p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 9.5px Helvetica}

Depression is a major public health concern in the U.S. and globally. While successful early

identification and treatment can lead to many positive health and behavioral outcomes,

depression, remains undiagnosed, untreated or undertreated due to several reasons,

including denial of the illness as well as cultural and social stigma. With the ubiquity of social

media platforms, millions of people are now sharing their online persona by expressing their

thoughts, moods, emotions, and even their daily struggles with mental health on social

media. Unlike traditional observational cohort studies conducted through questionnaires

and self-reported surveys, we explore the reliable detection of depressive symptoms from

tweets obtained, unobtrusively. Particularly, we examine and exploit multimodal big (social)

data to discern depressive behaviors using a wide variety of features including individuallevel

demographics. By developing a multimodal framework and employing statistical techniques

to fuse heterogeneous sets of features obtained through the processing of visual,

textual, and user interaction data, we significantly enhance the current state-of-the-art

approaches for identifying depressed individuals on Twitter (improving the average F1-

Score by 5 percent) as well as facilitate demographic inferences from social media. Besides

providing insights into the relationship between demographics and mental health, our

research assists in the design of a new breed of demographic-aware health interventions.

%B PLoS ONE %G eng %U https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226248&type=printable %0 Journal Article %J Semantic Web %D 2020 %T Neural-Symbolic Integration and the Semantic Web %A Pascal Hitzler %A Federico Bianchi %A Monireh Ebrahimi %A Md Kamruzzaman Sarker %B Semantic Web %V 11 %G eng %U http://www.semantic-web-journal.net/content/neural-symbolic-integration-and-semantic-web-0 %N 1 %0 Report %D 2020 %T An Ontology of Instruction 1.0 %A Cogan Shimizu %A Pascal Hitzler %A Aaron Eberhart %A Quinn Hirt %A Christopher Stevens %A Christopher W. Myers %A Benji Maruyama %A Colin Kupitz %A Dario Salvucci %G eng %0 Conference Proceedings %B 15th International Workshop on Ontology Matching %D 2020 %T Results of theOntology Alignment Evaluation Initiative 2020 %A Mina Abd Nikooie Pour %A Alsayed Algergawy %A Reihaneh Amini %A Daniel Faria %A Irini Fundulaki %A Ian Harrow %A Sven Hertling %A Ernesto Jiménez-Ruiz %A Clement Jonquet %A Naouel Karam %A Abderrahmane Khiat %A Amir Laadhar %A Patrick Lambrix %A Huanyu Li %A Ying Li %A Pascal Hitzler %A Heiko Paulheim %A Catia Pesquita %A Tzanina Saveta %A Pavel Shvaiko %A Andrea Splendiani %A Elodie Thieblin %A Cassia Trojahn %A Jana Vatascinova %A Beyza Yaman %A Ondrej Zamazal %A Lu Zhou %B 15th International Workshop on Ontology Matching %G eng %0 Journal Article %J Communications of the ACM %D 2020 %T A Review Of The Semantic Web Field %A Pascal Hitzler %X

We review two decades of Semantic Web research and applications, discuss relationships to some other disciplines, and current challenges in the field.

%B Communications of the ACM %G eng %0 Journal Article %J Appl. Ontology %D 2020 %T Time is ripe to embrace the scientific approach in Applied Ontology %A Stefano Borgo %A Pascal Hitzler %A Cogan Shimizu %B Appl. Ontology %V 15 %P 245–249 %G eng %U https://doi.org/10.3233/AO-200237 %R 10.3233/AO-200237 %0 Journal Article %J CoRR %D 2020 %T Towards a Modular Ontology for Space Weather Research %A Cogan Shimizu %A Ryan McGranaghan %A Aaron Eberhart %A Adam C. Kellerman %B CoRR %V abs/2009.12285 %G eng %U https://arxiv.org/abs/2009.12285 %0 Thesis %B Kansas State University %D 2020 %T Towards automated complex ontology alignment using rule-based machine learning %A Lu Zhou %B Kansas State University %I Kansas State University %C Manhattan %V Doctorate %G eng %9 Dissertation %0 Journal Article %J Knowledge Engineering Review %D 2020 %T Towards Evaluating Complex Ontology Alignments %A Lu Zhou %A Elodie Thieblin %A Michelle Cheatham %A Daniel Faria %A Catia Pesquita %A Cassia Trojahn %A Ondrej Zamazal %B Knowledge Engineering Review %V 35 %G eng %& e21 %0 Conference Paper %B Second Iberoamerican Knowledge Graphs and Semantic Web Conference (KGSWC) %D 2020 %T Wikipedia Knowledge Graph for Explainable AI %A Md Kamruzzaman Sarker %A Joshua Schwartz %A Pascal Hitzler %A Lu Zhou %A Srikanth Nadella %A Brandon Minnery %A Ion Juvina %A Michael L. Raymer %A William R. Aue %X

Explainable artificial intelligence (XAI) requires domain information to explain a system's decisions, for which structured forms of domain information like Knowledge Graphs (KGs) or ontologies are best suited. As such, readily available KGs are important to accelerate progress in XAI. To facilitate the advancement of XAI, we present the Wikipedia Knowledge Graph (WKG), based on information from English Wikipedia. Each Wikipedia article title, its corresponding category, and the category hierarchy are transformed into different entities in the knowledge graph. As the Wikipedia category hierarchy is not a tree, instead forming a graph, to make the finding process of the parent category easier, we break cycles in the category hierarchy. We evaluate whether the WKG is helpful to improve XAI compared with existing KGs, finding that WKG is better suited than the current state of the art. We also compare the cycle-free WKG with the Suggested Upper Merged Ontology (SUMO) and DBpedia schema KGs, finding minimal to no information loss.

%B Second Iberoamerican Knowledge Graphs and Semantic Web Conference (KGSWC) %8 11/2020 %G eng %0 Journal Article %J Journal of Geographical Systems %D 2019 %T Alignment of Surface Water Ontologies: A comparison of manual and automated approaches %A Michelle Cheatham %A Dalia Varanka %A Fatima Arauz %A Lu Zhou %B Journal of Geographical Systems %G eng %R 10.1007/s10109-019-00312-3 %0 Conference Paper %B Ontology Matching %D 2019 %T AROA Results of 2019 OAEI %A Lu Zhou %A Michelle Cheatham %A Pascal Hitzler %B Ontology Matching %I CEUR %C Auckland, New Zealand %G eng %0 Conference Paper %B AAAI Spring Symposium 2019 %D 2019 %T On the Capabilities of Logic Tensor Networks for Deductive Reasoning %A Bianchi, Federico %A Pascal Hitzler %B AAAI Spring Symposium 2019 %G eng %0 Generic %D 2019 %T A closer look at the Semantic Web journal's review process %A Cogan Shimizu %A Pascal Hitzler %A Krzysztof Janowicz %G eng %U https://doi.org/10.3233/SW-180342 %R 10.3233/SW-180342 %0 Conference Paper %B 18th International Semantic Web Conference: Satellite Events %D 2019 %T CoModIDE - The Comprehensive Modular Ontology IDE %A Cogan Shimizu %A Karl Hammar %B 18th International Semantic Web Conference: Satellite Events %G eng %0 Conference Paper %B Rules and Reasoning - Third International Joint Conference, RuleML+RR 2019, Bolzano, Italy, September 16-19, 2019 %D 2019 %T Complementing Logical Reasoning with Sub-symbolic Commonsense %A Federico Bianchi %A Matteo Palmonari %A Pascal Hitzler %A Luciano Serafini %B Rules and Reasoning - Third International Joint Conference, RuleML+RR 2019, Bolzano, Italy, September 16-19, 2019 %I Springer %G eng %0 Conference Paper %B 31st IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2019, Portland, OR, USA, November 4-6, 2019 %D 2019 %T Constrained State-Preserved Extreme Learning Machine %A Garrett Goodman %A Cogan Shimizu %A Iosif Papadakis Ktistakis %B 31st IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2019, Portland, OR, USA, November 4-6, 2019 %I IEEE %P 752–759 %G eng %U https://doi.org/10.1109/ICTAI.2019.00109 %R 10.1109/ICTAI.2019.00109 %0 Conference Paper %B AAAI Conference on Artificial Intelligence %D 2019 %T Efficient Concept Induction for Description Logics %A Md Kamruzzaman Sarker %A Pascal Hitzler %X

Concept Induction refers to the problem of creating complex Description Logic class descriptions (i.e., TBox axioms) from instance examples (i.e.,  ABox data). In this paper we look particularly at the case where both a set of positive and a set of negative instances are given, and complex class expressions are sought under which the positive but not the negative examples fall. Concept induction has found applications in ontology engineering, but existing algorithms have fundamental performance issues in some scenarios, mainly because a high number of invokations of an external Description Logic reasoner is usually required. In this paper we present a new algorithm for this problem which drastically reduces the number of reasoner invokations needed. While this comes at the expense of a more limited traversal of the search space, we show that our approach improves execution times by up to several orders of magnitude, while output correctness, measured in the amount of correct coverage of the input instances, remains reasonably high in many cases. Our approach thus should provide a strong alternative to existing systems, in particular in settings where other systems are prohibitively slow.

%B AAAI Conference on Artificial Intelligence %I AAAI %C Honolulu, US %V 33 %8 01/2019 %G eng %0 Conference Paper %B MultiMedia Modeling %D 2019 %T Exploring the Impact of Training Data Bias on Automatic Generation of Video Captions %A Smeaton, Alan F. %A Graham, Yvette %A McGuinness, Kevin %A O'Connor, Noel E. %A Quinn, Seán %A Arazo Sanchez, Eric %X

A major issue in machine learning is availability of training data. While this historically referred to the availability of a sufficient volume of training data, recently this has shifted to the availability of sufficient unbiased training data. In this paper we focus on the effect of training data bias on an emerging multimedia application, the automatic captioning of short video clips. We use subsets of the same training data to generate different models for video captioning using the same machine learning technique and we evaluate the performances of different training data subsets using a well-known video caption benchmark, TRECVid. We train using the MSR-VTT video-caption pairs and we prune this to reduce and make the set of captions describing a video more homogeneously similar, or more diverse, or we prune randomly. We then assess the effectiveness of caption-generating trained with these variations using automatic metrics as well as direct assessment by human assessors. Our findings are preliminary and show that randomly pruning captions from the training data yields the worst performance and that pruning to make the data more homogeneous, or diverse, does improve performance slightly when compared to random. Our work points to the need for more training data, both more video clips but, more importantly, more captions for those videos.

%B MultiMedia Modeling %I Springer International Publishing %C Cham %P 178–190 %@ 978-3-030-05710-7 %G eng %0 Conference Paper %B Proceedings of the 10th Workshop on Ontology Design and Patterns (WOP 2019) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 27, 2019 %D 2019 %T Extensions to the Ontology Design Pattern Representation Language %A Quinn Hirt %A Cogan Shimizu %A Pascal Hitzler %B Proceedings of the 10th Workshop on Ontology Design and Patterns (WOP 2019) co-located with 18th International Semantic Web Conference (ISWC 2019), Auckland, New Zealand, October 27, 2019 %I CEUR-WS.org %V 2459 %P 76–75 %G eng %U http://ceur-ws.org/Vol-2459/short2.pdf %0 Conference Paper %B 1st Iberoamerican Knowledge Graph and Semantic Web Conference (KGSWC) %D 2019 %T A Method for Automatically Generating Schema Diagrams for OWL Ontologies %A Cogan Shimizu %A Aaron Eberhart %A Nazifa Karima %A Quinn Hirt %A Adila Krisnadhi %A Pascal Hitzler %K design patterns %K evaluation %K implementation %K ontology %K schema diagrams %K visualization %X

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.

%B 1st Iberoamerican Knowledge Graph and Semantic Web Conference (KGSWC) %I Springer %C Villa Clara, Cuba %8 06/2019 %G eng %& 149-161 %0 Conference Proceedings %B Workshop on Ontology Design and Patterns %D 2019 %T MODL: a Modular Ontology Design Library %A Cogan Shimizu %A Quinn Hirt %A Pascal Hitzler %B Workshop on Ontology Design and Patterns %G eng %0 Book %B Lecture Notes in Computer Science %D 2019 %T The Semantic Web. 16th International Conference, ESWC 2019, Portoroz, Slovenia, June 2-6, 2019, Proceedings %A Pascal Hitzler %A Miriam Fernandez %A Krzysztof Janowicz %A Amrapali Zaveri %A Alasdair Gray %A Vanessa Lopez %A Armin Haller %A Karl Hammar %B Lecture Notes in Computer Science %I Springer %C Heidelberg %V 11503 %G eng %0 Book %B Lecture Notes In Computer Science %D 2019 %T The Semantic Web: ESWC 2019 Satellite Events. Portoroz, Slovenia, June 2-6, 2019, Revised Selected Papers %A Pascal Hitzler %A Sabrina Kirrane %A Olaf Hartig %A Victor de Boer %A Maria-Esther Vidal %A Maria Maleshkova %A Stefan Schlobach %A Karl Hammar %A Nelia Lasierra %A Steffen Stadtmüller %A Katja Hose %A Ruben Verborgh %B Lecture Notes In Computer Science %I Springer %C Heidelberg %V 11762 %G eng %0 Conference Paper %B Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI-19} %D 2019 %T Towards Architecture-Agnostic Neural Transfer: a Knowledge-Enhanced Approach %A Quinn, Seán %A Mileo, Alessandra %B Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, {IJCAI-19} %I International Joint Conferences on Artificial Intelligence Organization %P 6452–6453 %8 7 %G eng %U https://doi.org/10.24963/ijcai.2019/915 %R 10.24963/ijcai.2019/915 %0 Conference Paper %B Joint International Semantic Technology Conference %D 2019 %T Towards Association Rule-Based Complex Ontology Alignment %A Lu Zhou %A Michelle Cheatham %A Pascal Hitzler %B Joint International Semantic Technology Conference %I Springer %C Hangzhou, China %G eng %0 Conference Paper %B 2nd International Conference on Sensors, Signal and Image Processing (SSIP 19) %D 2019 %T Tracking Human Behavioural Consistency by Analysing Periodicity of Household Water Consumption %A Quinn, Seán %A Murphy, Noel %A Smeaton, Alan F. %K Ambient Assisted Living %K Home Monitoring %K Internet of Things %K Sensor Applications %K Sensor Networks %X

People are living longer than ever due to advances in healthcare, and this has prompted many healthcare providers to look towards remote patient care as a means to meet the needs of the future. It is now a priority to enable people to reside in their own homes rather than in overburdened facilities whenever possible. The increasing maturity of IoT technologies and the falling costs of connected sensors has made the deployment of remote healthcare at scale an increasingly attractive prospect. In this work we demonstrate that we can measure the consistency and regularity of the behaviour of a household using sensor readings generated from interaction with the home environment. We show that we can track changes in this behaviour regularity longitudinally and detect changes that may be related to significant life events or trends that may be medically significant. We achieve this using periodicity analysis on water usage readings sampled from the main household water meter every 15 minutes for over 8 months. We utilise an IoT Application Enablement Platform in conjunction with low cost LoRa-enabled sensors and a Low Power Wide Area Network in order to validate a data collection methodology that could be deployed at large scale in future. We envision the statistical methods described here being applied to data streams from the homes of elderly and at-risk groups, both as a means of  early illness  detection  and  for  monitoring  the well-being of those with known illnesses.

%B 2nd International Conference on Sensors, Signal and Image Processing (SSIP 19) %I ACM %C Prague, Czech Republic %G eng %0 Journal Article %J CoRR %D 2018 %T Caregiver Assessment Using Smart Gaming Technology: A Preliminary Approach %A Garrett Goodman %A Abby Edwards %A Cogan Shimizu %A Tanvi Banerjee %A Jennifer Hughes %A William Romine %A Larry Lawhorne %B CoRR %V abs/1802.03051 %G eng %U http://arxiv.org/abs/1802.03051 %0 Conference Paper %B ISWC %D 2018 %T A Complex Alignment Benchmark: Geolink dataset %A Lu Zhou %A Michelle Cheatham %A Adila Krisnadhi %A Pascal Hitzler %B ISWC %I Springer %G eng %0 Generic %D 2018 %T The First Version of the OAEI Complex Alignment Benchmark %A Elodie Thieblin %A Michelle Cheatham %A Cassia Trojahn %A Ondrej Zamazal %A Lu Zhou %B ISWC Poster and Demo Session %0 Conference Proceedings %B FOIS 2018 %D 2018 %T Formal Ontology in Information Systems - Proceedings of the 10th International Conference, FOIS 2018, Cape Town, South Africa, 19-21 September 2018 %A Stefano Borgo %A Pascal Hitzler %A Oliver Kutz %B FOIS 2018 %I IOS Press %G eng %0 Journal Article %J Big Earth Data %D 2018 %T The GeoLink Knowledge Graph %A Michelle Cheatham %A Adila Krisnadhi %A Reihaneh Amini %A Pascal Hitzler %A Krzysztof Janowicz %A Adam Shepherd %A Tom Narock %A Matt Jones %A Peng Ji %B Big Earth Data %G eng %0 Journal Article %J Big Earth Data %D 2018 %T The GeoLink Knowledge Graph %A Michelle Cheatham %A Adila Krisnadhi %A Reihaneh Amini %A Pascal Hitzler %A Krzysztof Janowicz %A Adam Shepherd %A Tom Narock %A Matt Jones %A Peng Ji %B Big Earth Data %G eng %0 Journal Article %J Communications of the ACM %D 2018 %T Intelligent Systems for Geosciences - An Essential Research Agenda %A Yolanda Gil %A Suzanne Pierce %A Hassan Babaie %A Arindam Banerjee %A Kirk Borne %A Gary Bust %A Michelle Cheatham %A Imme Ebert-Uphoff %A Carla Gomes %A Mary Hill %A John Horel %A Leslie Hsu %A Jim Kinter %A Craig Knoblock %A David Krum %A Vipin Kumar %A Pierre Lermusiaux %A Yan Liu %A Chris North %A Victor Pankratius %A Shanan Peters %A Beth Plale %A Allen Pope %A Sai Ravela %A Juan Restrepo %A Aaron Ridley %A Hanan Samet %A Shashi Shekhar %A Katie Skinner %A Padhraic Smyth %A Basil Tikoff %A Lynn Yarmey %A Jia Zhang %B Communications of the ACM %G eng %0 Conference Paper %B ISWC %D 2018 %T A Journey From Simple to Complex Alignment on Real-World Ontologies %A Lu Zhou %B ISWC %G eng %0 Journal Article %J Digital Communications and Networks %D 2018 %T Machine learning for internet of things data analysis: a survey %A Mohammad Saeid Mahdavinejad %A Mohammadreza Rezvan %E Mohammadamin Barekatain %E Peyman Adibi %E Payam Barnaghi %E Amit P. Sheth %K Internet of Things %K Machine learning %K Smart City %K Smart data %X

Rapid developments in hardware, software, and communication technologies have facilitated the emergence of Internet-connected sensory devices that provide observations and data measurements from the physical world. By 2020, it is estimated that the total number of Internet-connected devices being used will be between 25 and 50 billion. As these numbers grow and technologies become more mature, the volume of data being published will increase. The technology of Internet-connected devices, referred to as Internet of Things (IoT), continues to extend the current Internet by providing connectivity and interactions between the physical and cyber worlds. In addition to an increased volume, the IoT generates big data characterized by its velocity in terms of time and location dependency, with a variety of multiple modalities and varying data quality. Intelligent processing and analysis of this big data are the key to developing smart IoT applications. This article assesses the various machine learning methods that deal with the challenges presented by IoT data by considering smart cities as the main use case. The key contribution of this study is the presentation of a taxonomy of machine learning algorithms explaining how different techniques are applied to the data in order to extract higher level information. The potential and challenges of machine learning for IoT data analytics will also be discussed. A use case of applying a Support Vector Machine (SVM) to Aarhus smart city traffic data is presented for a more detailed exploration.

%B Digital Communications and Networks %V 4 %P 161-175 %G eng %U https://www.sciencedirect.com/science/article/pii/S235286481730247X %R https://doi.org/10.1016/j.dcan.2017.10.002 %0 Conference Paper %B 2018 IEEE International Conference on Healthcare Informatics (ICHI) %D 2018 %T Mental Health Analysis Via Social Media Data %A Yazdavar, Amir Hossein %A Mahdavinejad, Mohammad Saied %A Bajaj, Goonmeet %A Thirunarayan, Krishnaprasad %A Pathak, Jyotishman %A Sheth, Amit %B 2018 IEEE International Conference on Healthcare Informatics (ICHI) %P 459-460 %G eng %R 10.1109/ICHI.2018.00102 %0 Conference Paper %B IEEE, ICHI %D 2018 %T Mental Health Analysis Via Social Media Data, IEEE ICHI 2018 %A Amir Hossein Yazdavar %A Mohammad Saied Mahdavinejad %A Goonmeet Bajaj %A Krishnaprasad Thirunarayan %A Jyotishman Pathak %A Amit Sheth %B IEEE, ICHI %G eng %0 Conference Paper %B Graph-Based Representation and Reasoning - 23rd International Conference on Conceptual Structures, ICCS 2018, Edinburgh, UK, June 20-22, 2018, Proceedings %D 2018 %T Modular Ontologies as a Bridge Between Human Conceptualization and Data %A Pascal Hitzler %A Cogan Shimizu %B Graph-Based Representation and Reasoning - 23rd International Conference on Conceptual Structures, ICCS 2018, Edinburgh, UK, June 20-22, 2018, Proceedings %I Springer %V 10872 %P 3–6 %G eng %U https://doi.org/10.1007/978-3-319-91379-7\_1 %R 10.1007/978-3-319-91379-7\_1 %0 Conference Paper %B Emerging Topics in Semantic Technologies - ISWC 2018 Satellite Events [best papers from 13 of the workshops co-located with the ISWC 2018 conference] %D 2018 %T Ontology Design Patterns for Winston's Taxonomy Of Part-Whole Relations %A Cogan Shimizu %A Pascal Hitzler %A Clare Paul %B Emerging Topics in Semantic Technologies - ISWC 2018 Satellite Events [best papers from 13 of the workshops co-located with the ISWC 2018 conference] %I IOS Press %V 36 %P 119–129 %G eng %U https://doi.org/10.3233/978-1-61499-894-5-119 %R 10.3233/978-1-61499-894-5-119 %0 Journal Article %J International Journal of Metadata, Semantics and Ontologies %D 2018 %T The Properties of Property Alignment on the Semantic Web %A Michelle Cheatham %E Catia Pesquita %E Daniela Oliveira %E Helena B. McCurdy %B International Journal of Metadata, Semantics and Ontologies %V 13 %G eng %N 1 %& 42 %0 Journal Article %J Semantic Web %D 2018 %T On the Prospects of Blockchain and Distributed Ledger Technologies for Open Science and Academic Publishing %A Krzysztof Janowicz %A Blake Regalia %A Pascal Hitzler %A Gengchen Mai %A Stephanie Delbecque %A Maarten Fröhlich %A Patrick Mertinent %A Trevor Lazarus %B Semantic Web %V 9 %G eng %U http://www.semantic-web-journal.net/content/prospects-blockchain-and-distributed-ledger-technologies-open-science-and-academic %N 5 %0 Conference Paper %B ESWC (Satellite Events) %D 2018 %T A Protégé Plug-In for Annotating OWL Ontologies with OPLa %A Cogan Shimizu %A Quinn Hirt %A Pascal Hitzler %B ESWC (Satellite Events) %I Springer %V 11155 %P 23–27 %G eng %0 Conference Paper %B The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers %D 2018 %T Pseudo-Random ALC Syntax Generation %A Aaron Eberhart %A Michelle Cheatham %A Pascal Hitzler %K ALC %K Description Logic %K DL %K random generation %K synthetic data %X We discuss a tool capable of rapidly generating pseudo-random syntactically valid ALC expression trees. The program is meant to allow a researcher to create large sets of independently valid expressions with a minimum of personal bias for experimentation. %B The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers %I Springer %C Heraklion, Crete, Greece %V 11155 %P 19–22 %@ 978-3-319-98191-8 %G eng %U https://doi.org/10.1007/978-3-319-98192-5\_4 %R 10.1007/978-3-319-98192-5\_4 %0 Journal Article %J arXiv preprint arXiv:1811.04132 %D 2018 %T Reasoning over RDF Knowledge Bases using Deep Learning %A Ebrahimi, Monireh %A Md Kamruzzaman Sarker %A Bianchi, Federico %A Xie, Ning %A Doran, Derek %A Pascal Hitzler %X

Semantic Web knowledge representation standards, and in particular RDF and OWL, often come endowed with a formal semantics which is considered to be of fundamental importance for the field. Reasoning, i.e., the drawing of logical inferences from knowledge expressed in such standards, is traditionally based on logical deductive methods and algorithms which can be proven to be sound and complete and terminating, i.e. correct in a very strong sense. For various reasons, though, in particular the scalability issues arising from the ever-increasing amounts of Semantic Web data available and the inability of deductive algorithms to deal with noise in the data, it has been argued that alternative means of reasoning should be investigated which bear high promise for high scalability and better robustness. From this perspective, deductive algorithms can be considered the gold standard regarding correctness against which alternative methods need to be tested. In this paper, we show that it is possible to train a Deep Learning system on RDF knowledge graphs, such that it is able to perform reasoning over new RDF knowledge graphs, with high precision and recall compared to the deductive gold standard.

%B arXiv preprint arXiv:1811.04132 %G eng %U https://arxiv.org/abs/1811.04132 %0 Conference Paper %B FOIS 2018 %D 2018 %T Some Open Issues After Twenty Years of Formal Ontology %A Stefano Borgo %A Pascal Hitzler %B FOIS 2018 %G eng %U http://ebooks.iospress.nl/publication/50236 %0 Conference Paper %B Proceedings of the Doctoral Consortium at ISWC 2018 co-located with 17th International Semantic Web Conference (ISWC 2018), Monterey, USA, October 8th - to - 12th, 2018. %D 2018 %T Towards a Comprehensive Modular Ontology IDE and Tool Suite %A Cogan Shimizu %B Proceedings of the Doctoral Consortium at ISWC 2018 co-located with 17th International Semantic Web Conference (ISWC 2018), Monterey, USA, October 8th - to - 12th, 2018. %I CEUR-WS.org %V 2181 %P 65–72 %G eng %U http://ceur-ws.org/Vol-2181/paper-08.pdf %0 Conference Paper %B Proceedings of the 9th Workshop on Ontology Design and Patterns (WOP 2018) co-located with 17th International Semantic Web Conference (ISWC 2018), Monterey, USA, October 9th, 2018. %D 2018 %T Towards a Pattern-Based Ontology for Chemical Laboratory Procedures %A Cogan Shimizu %A Leah McEwen %A Quinn Hirt %B Proceedings of the 9th Workshop on Ontology Design and Patterns (WOP 2018) co-located with 17th International Semantic Web Conference (ISWC 2018), Monterey, USA, October 9th, 2018. %I CEUR-WS.org %V 2195 %P 40–51 %G eng %U http://ceur-ws.org/Vol-2195/research_paper_1.pdf %0 Unpublished Work %D 2018 %T A Tutorial on Modular Ontology Modeling with Ontology Design Patterns: The Cooking Recipes Ontology %A Pascal Hitzler %A Adila A. Krisnadhi %G eng %0 Book %B Studies on the Semantic Web %D 2017 %T Advances in Ontology Design and Patterns %A Karl Hammar %A Pascal Hitzler %A Agnieszka Lawrynowicz %A Adila Krisnadhi %A Andrea Nuzzolese %A Monika Solanki %B Studies on the Semantic Web %I IOS Press %C Amsterdam %V 32 %G eng %0 Generic %D 2017 %T Challenges of Sentiment Analysis for Dynamic Events %A Monireh Ebrahimi %A Amir Hossein Yazdavar %A Amit Sheth %X

Efforts to assess people's sentiments on Twitter have suggested that Twitter could be a valuable resource for studying political sentiment and that it reflects the offline political landscape. Many opinion mining systems and tools provide users with people's attitudes toward products, people, or topics and their attributes/aspects. However, although it may appear simple, using sentiment analysis to predict election results is difficult, since it is empirically challenging to train a successful model to conduct sentiment analysis on tweet streams for a dynamic event such as an election. This article highlights some of the challenges related to sentiment analysis encountered during monitoring of the presidential election using Kno.e.sis's Twitris system.

%G eng %0 Journal Article %J IEEE Intelligent Systems %D 2017 %T On the Challenges of Sentiment Analysis for Dynamic Events %A Ebrahimi, Monireh %A Yazdavar, Amir Hossein %A Sheth, Amit %B IEEE Intelligent Systems %G eng %0 Conference Paper %B 8th Workshop on Ontology Design and Patterns - WOP2017 %D 2017 %T Computational Environment: An ODP to Support Finding and Recreating Computational Analyses %A Michelle Cheatham %A Charles Vardeman %A Nazifa Karima %A Pascal Hitzler %B 8th Workshop on Ontology Design and Patterns - WOP2017 %G eng %0 Book Section %B Advances in Ontology Design and Patterns %D 2017 %T A Core Pattern for Events %A Adila A. Krisnadhi %A Pascal Hitzler %B Advances in Ontology Design and Patterns %I IOS Press %C Amsterdam %G eng %0 Thesis %B Computer Science and Engineering %D 2017 %T Efficient Reasoning Algorithms for Fragments of Horn Description Logics %A David Carral %K Description Logic %K Knowledge representation %K Reasoning %X 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. %B Computer Science and Engineering %I Wright State University %C Dayton %V Doctor of Philosophy (PhD) %P 70 %G eng %U http://rave.ohiolink.edu/etdc/view?acc_num=wright1491317096530938 %0 Conference Proceedings %B Twelveth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy %D 2017 %T Explaining Trained Neural Networks with Semantic Web Technologies: First Steps %A Md Kamruzzaman Sarker %A Ning Xie %A Derek Doran %A Michael Raymer %A Pascal Hitzler %K Artificial Intelligence %X

The ever increasing prevalence of publicly available structured data on the World Wide Web enables new applications in a variety of domains. In this paper, we provide a conceptual approach that leverages such data in order to explain the input-output behavior of trained artificial neural networks. We apply existing Semantic Web technologies in order to provide an experimental proof of concept.

%B Twelveth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy %7 12 %C London, UK %8 07/2017 %G eng %U http://daselab.cs.wright.edu/nesy/NeSy17/ %0 Conference Paper %B 8th Workshop on Ontology Design and Patterns - WOP2017 %D 2017 %T On the Ontological Modeling of Trees %A David Carral %A Pascal Hitzler %A Hilmar Lapp %A Sebastian Rudolph %B 8th Workshop on Ontology Design and Patterns - WOP2017 %G eng %0 Journal Article %J Semantic Web %D 2017 %T An Ontology Design Pattern and Its Use Case for Modeling Material Transformation %A Charles Vardeman %A Adila Krisnadhi %A Michelle Cheatham %A Krzysztof Janowicz %A Holly Ferguson %A Pascal Hitzler %A Aimee Buccellato %B Semantic Web %V 8 %P 731 %G eng %N 5 %& 719 %R 10.3233/SW-160231 %0 Conference Paper %B 8th Workshop on Ontology Design and Patterns (WOP2017) %D 2017 %T An Ontology Design Pattern for Microblog Entries %A Cogan Shimizu %A Michelle Cheatham %X

Due to the exponential growth of the Internet of Things and use of Social Media Platforms, observers have an unprecedented level of detailed information available on the behavior of communities. However, due to the highly heterogeneous nature and the immense volume of the data, a composite view is difficult to generate. Such a composite view would be exceptionally useful in the realms of insider threat detection, after-action forensics, and hazardous situation detection and avoidance. The Semantic Web, via ontology modeling, offers a powerful tool for fusing the disparate data sources and formats. To this end, we have created an ontology design pattern (ODP) for the modeling of a simple microblog entry. This ODP is intended to fit within an ecosystem for fusing social media, support advanced visualization, and provide a preliminary framework for trust assessment.

%B 8th Workshop on Ontology Design and Patterns (WOP2017) %G eng %0 Thesis %B Mathematics and Statistical Science %D 2017 %T Propositional Rule Extraction from Neural Networks under Background Knowledge %A Maryam Labaf %A Pascal Hitzler %A Anthony B. Evans %X

It is well-known that the input-output behaviour of a neural network can be recast in terms of a set of propositional rules, and under certain weak preconditions this is also always possible with positive (or definite) rules. Furthermore, in this case there is in fact a unique minimal (technically, reduced) set of such rules which perfectly captures the inputoutput mapping. In this paper, we investigate to what extent these results and corresponding rule extraction algorithms can be lifted to take additional background knowledge into account. It turns out that uniqueness of the solution can then no longer be guaranteed. However, the background knowledge often makes it possible to extract simpler, and thus more easily understandable, rulesets which still perfectly capture the input-output mapping.

%B Mathematics and Statistical Science %V Master %P 50 %8 07/2017 %G eng %9 Master thesis %0 Conference Paper %B Twelfth International Workshop on Neural-Symbolic Learning and Reasoning %D 2017 %T Propositional rule extraction from neural networks under background knowledge %A Maryam Labaf %E Pascal Hitzler %Y Anthony B. Evans %K Background knowledge %K Neural Network %K Propositional Logic %K Rule Extraction %B Twelfth International Workshop on Neural-Symbolic Learning and Reasoning %8 07/2017 %G eng %0 Conference Paper %B IJCAI %D 2017 %T Relatedness-based Multi-Entity Summarization %A Kalpa Gunaratna %A Amir Hossein Yazdavar %A Krishnaprasad Thirunarayan %A Amit Sheth %A Gong Cheng %X

Representing world knowledge in a machine processable format is important as entities and their descriptions have fueled tremendous growth in knowledge-rich information processing platforms, services, and systems. Prominent applications of knowledge graphs include search engines (e.g., Google Search and Microsoft Bing), email clients (e.g., Gmail), and intelligent personal assistants (e.g., Google Now, Amazon Echo, and Apple’s Siri). In this paper, we present an approach that can summarize facts about a collection of entities by analyzing their relatedness in preference to summarizing each entity in isolation. Specifically, we generate informative entity summaries by selecting: (i) inter-entity facts that are similar and (ii) intra-entity facts that are important and diverse. We employ a constrained knapsack problem solving approach to efficiently compute entity summaries. We perform both qualitative and quantitative experiments and demonstrate that our approach yields promising results compared to two other stand-alone state-ofthe-art entity summarization approaches.

%B IJCAI %G eng %0 Conference Proceedings %B NIPS 2017 Workshop: Interpreting, Explaining and Visualizing Deep Learning, NIPS IEVDL 2017 %D 2017 %T Relating Input Concepts to Convolutional Neural Network Decisions %A Ning Xie %A Md Kamruzzaman Sarker %A Derek Doran %A Pascal Hitzler %A Michael Raymer %X

Many current methods to interpret convolutional neural networks (CNNs) use visualization techniques and words to highlight concepts of the input seemingly relevant to a CNN’s decision. The methods hypothesize that the recognition of these concepts are instrumental in the decision a CNN reaches, but the nature of this relationship has not been well explored. To address this gap, this paper examines the quality of a concept’s recognition by a CNN and the degree to which the recognitions are associated with CNN decisions. The study considers a CNN trained for scene recognition over the ADE20k dataset. It uses a novel approach to find and score the strength of minimally distributed representations of input concepts (defined by objects in scene images) across late stage feature maps. Subsequent analysis finds evidence that concept recognition impacts decision making. Strong recognition of concepts frequently-occurring in few scenes are indicative of correct decisions, but recognizing concepts common to many scenes may mislead the network.

%B NIPS 2017 Workshop: Interpreting, Explaining and Visualizing Deep Learning, NIPS IEVDL 2017 %I NIPS %C CA, USA %8 12/2017 %G eng %0 Conference Paper %B ESWC 2017 %D 2017 %T Rendering OWL in Description Logic Syntax %A Cogan Shimizu %A Pascal Hitzler %A Matthew Horridge %B ESWC 2017 %I Springer %C Heidelberg %G eng %0 Thesis %B Department of Computer Science and Engineering %D 2017 %T Rendering OWL in LaTeX for Improved Readability: Extensions to the OWLAPI %A Cogan Shimizu %X

As ontology engineering is inherently a multidisciplinary process, it is necessary to utilize multiple vehicles to present an ontology to a user. In order to examine the content of an ontology, formal logic renderings of the axioms appear to be a very helpful approach for some. This thesis introduces a number of incremental improvements to the OWLAPI's \LaTeX{} rendering framework in order to improve the readability, concision, and correctness of OWL files translated into Description Logic and First Order Logic. In addition, we examine the efficacy of these renderings as vehicles for understanding an ontology.

%B Department of Computer Science and Engineering %I Wright State University %C Dayton, Ohio %V Master of Science %P 106 %8 08/2017 %G eng %0 Generic %D 2017 %T A Replication Study: Understanding What Drives the Performance in WikiMatch %A Lu Zhou %A Michelle Cheatham %X

We replicate and demonstrate that the performance of the WikiMatch automated ontology alignment system may be driven not by the particular information from Wikipedia directly used by the system, but rather by string similarity and Wikipedia’s manually curated synonym sets, as encoded in the site’s query resolution and page redirection system. In order to gain a detailed understanding of how Wikipedia contributes to WikiMatch, we replicate results reported for WikiMatch and analyze the results to evaluate our hypothesis.

%G English %U http://disi.unitn.it/~pavel/om2017/papers/om2017_poster5.pdf %0 Generic %D 2017 %T Rule-based OWL Modeling with ROWLTab Protege Plugin %A Md Kamruzzaman Sarker %A Adila Krisnadhi %A David Carral %A Pascal Hitzler %X

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.

%G eng %0 Conference Paper %B ASONAM %D 2017 %T Semi-Supervised Approach to Monitoring Clinical Depressive Symptoms in Social Media %A Amir Hossein Yazdavar %E Hussein S. Al-Olimat %E Monireh Ebrahimi %E Goonmeet Bajaj %E Tanvi Banerjee %E Krishnaprasad Thirunarayan %E Jyotishman Pathak %E Amit Sheth %X

With the rise of social media, millions of people are routinely expressing their moods, feelings, and daily struggles with mental health issues on social media platforms like Twitter. Unlike traditional observational cohort studies conducted through questionnaires and self-reported surveys, we explore the reliable detection of clinical depression from tweets obtained unobtrusively. Based on the analysis of tweets crawled from users with self-reported depressive symptoms in their Twitter profiles, we demonstrate the potential for detecting clinical depression symptoms which emulate the PHQ-9 questionnaire clinicians use today. Our study uses a semi-supervised statistical model to evaluate how the duration of these symptoms and their expression on Twitter (in terms of word usage patterns and topical preferences) align with the medical findings reported via the PHQ-9. Our proactive and automatic screening tool is able to identify clinical depressive symptoms with an accuracy of 68% and precision of 72%.

%B ASONAM %G eng %U https://dl.acm.org/doi/abs/10.1145/3110025.3123028 %0 Conference Paper %B ASONAM %D 2017 %T Semi-Supervised Approach to Monitoring Clinical Depressive Symptoms in Social Media %A Yazdavar, Amir Hossein %A Al-Olimat, Hussein S %A Ebrahimi, Monireh %A Bajaj, Goonmeet %A Banerjee, Tanvi %A Thirunarayan, Krishnaprasad %A Pathak, Jyotishman %A Sheth, Amit %B ASONAM %G eng %0 Book Section %B Advances in Ontology Design and Patterns %D 2017 %T A Spatiotemporal Extent Pattern based on Semantic Trajectories %A Adila A. Krisnadhi %A Pascal Hitzler %A Krzysztof Janowicz %B Advances in Ontology Design and Patterns %I IOS Press %C Amsterdam %G eng %0 Book Section %B Advances in Ontology Design and Patterns %D 2017 %T The Stub Metapattern %A Adila A. Krisnadhi %A Pascal Hitzler %B Advances in Ontology Design and Patterns %I IOS Press %C Amsterdam %G eng %0 Conference Paper %B 8th Workshop on Ontology Design and Patterns - WOP2017 %D 2017 %T Towards a simple but useful ontology design pattern representation language %A Pascal Hitzler %A Aldo Gangemi %A Krzysztof Janowicz %A Adila A. Krisnadhi %A Valentina Presutti %B 8th Workshop on Ontology Design and Patterns - WOP2017 %G eng %0 Journal Article %J The IEEE Intelligent Informatics Bulletin %D 2016 %T AI for Traffic Analytics %A Raghava Mutharaju %A Freddy Lécué %A Jeff Z. Pan %A Jiewen Wu %A Pascal Hitzler %B The IEEE Intelligent Informatics Bulletin %V 17 %G eng %N 1 %& 21 %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T Collected Research Questions Concerning Ontology Design Patterns %A Karl Hammar %A Eva Blomqvist %A David Carral %A Marieke van Erp %A Antske Fokkens %A Aldo Gangemi %A Willem Robert van Hage %A Pascal Hitzler %A Krzysztof Janowicz %A Nazifa Karima %A Adila Krisnadhi %A Tom Narock %A Roxane Segers %A Monika Solanki %A Vojtech Svatek %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %I IOS Press %C Amsterdam %G eng %0 Journal Article %J Semantic Web %D 2016 %T Considerations regarding Ontology Design Patterns %A Eva Blomqvist %A Pascal Hitzler %A Krzysztof Janowicz %A Adila Krisnadhi %A Thomas Narock %A Monika Solanki %B Semantic Web %V 7 %P 1-7 %G eng %N 1 %0 Conference Paper %B Presented at the 17th International workshop on Advanced Computing and Analysis Techniques in physics research (ACAT), Valparaiso, Chile, January 2016. %D 2016 %T The Detector Final State pattern: Using the Web Ontology Language to describe a Physics Analysis %A Gordon Watts %A Charles Vardeman %A David Carral %A Pascal Hitzler %X

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.

%B Presented at the 17th International workshop on Advanced Computing and Analysis Techniques in physics research (ACAT), Valparaiso, Chile, January 2016. %0 Thesis %B Department of Computer Science and Engineering, Wright State University %D 2016 %T Efficient Reasoning Algorithms for Fragments of Horn Description Logics %A David Carral %X

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.

%B Department of Computer Science and Engineering, Wright State University %I Wright State University %C Dayton, OH, USA %V PhD %G eng %9 Dissertation %0 Generic %D 2016 %T Final State Detector ODP OWL Ontology %G eng %0 Generic %D 2016 %T Final State Detector ODP RDF Data %G eng %0 Journal Article %J Journal of Soft Computing and Decision Support Systems %D 2016 %T Fuzzy Based Implicit Sentiment Analysis on Quantitative Sentences %A Yazdavar, Amir Hossein %A Ebrahimi, Monireh %A Salim, Naomie %B Journal of Soft Computing and Decision Support Systems %V 3 %P 7–18 %G eng %0 Book Section %B The International Encyclopedia of Geography: People, the Earth, Environment, and Technology. Wiley/AAG %D 2016 %T Geospatial Semantic Web %A Krzysztof Janowicz %A Pascal Hitzler %B The International Encyclopedia of Geography: People, the Earth, Environment, and Technology. Wiley/AAG %G eng %0 Book Section %B The International Encyclopedia of Geography: People, the Earth, Environment, and Technology %D 2016 %T Geospatial Semantic Web %A Krzysztof Janowicz %A Pascal Hitzler %B The International Encyclopedia of Geography: People, the Earth, Environment, and Technology %I Wiley/AAG %G eng %0 Conference Proceedings %B 7th Workshop on Ontology and Semantic Web Patterns (WOP2016) %D 2016 %T How to Document Ontology Design Patterns %A Nazifa Karima %A Karl Hammar %A Pascal Hitzler %B 7th Workshop on Ontology and Semantic Web Patterns (WOP2016) %I IOS Press %C Kobe, Japan %G eng %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T Introduction: Ontology Design Patterns in a Nutshell %A Krzysztof Janowicz %A Aldo Gangemi %A Pascal Hitzler %A Adila Krisnadhi %A Valentina Presutti %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %I IOS Press %C Amsterdam %G eng %0 Journal Article %J Semantic Web %D 2016 %T Linked Dataset Description Papers at the Semantic Web Journal: A Critical Assessment %A Aidan Hogan %A Pascal Hitzler %A Krzysztof Janowicz %B Semantic Web %V 7 %G eng %N 2 %& 105 %0 Book Section %B Oceanographic and Marine Cross-Domain Data Management for Sustainable Development %D 2016 %T Linked Ocean Data 2.0 %A Adam Leadbetter %A Michelle Cheatham %A Adam Shepherd %A Rob Thomas %B Oceanographic and Marine Cross-Domain Data Management for Sustainable Development %P 69-99 %G eng %0 Conference Paper %B International Semantic Web Conference %D 2016 %T LinkGen: Multipurpose linked data generator %A Joshi, Amit Krishna %A Pascal Hitzler %A Dong, Guozhu %B International Semantic Web Conference %I Springer %P 113–121 %G eng %0 Conference Paper %B Ontology Matching Workshop -- ISWC %D 2016 %T Matching Instances in GeoLink %A Michelle Cheatham %A Reihaneh Amini %A Chandan Patel %B Ontology Matching Workshop -- ISWC %G eng %0 Conference Paper %D 2016 %T Modeling OWL with Rules: The ROWL Protege Plugin %A Md Kamruzzaman Sarker %A David Carral %A Adila Krisnadhi %A Pascal Hitzler %X

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.

%I 15th International Semantic Web Conference (ISWC) 2016 %C Kobe, Japan %G eng %U http://ceur-ws.org/Vol-1690/paper92.pdf %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T Modeling With Ontology Design Patterns: Chess Games As a Worked Example %A Adila Krisnadhi %A Pascal Hitzler %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %I IOS Press %V 25 %P 3–21 %G eng %& 1 %R 10.3233/978-1-61499-676-7-3 %0 Conference Paper %B Workshop on Ontology Design Patterns (WOP) %D 2016 %T A Modification to the Hazardous Situation ODP to Support Risk Assessment and Mitigation %A Michelle Cheatham %A Ferguson, Holly %A Charles, Vardeman %A Cogan Shimizu %K hazard %K Ontology Design Pattern %K risk assessment %K risk mitigation %X

The Hazardous Situation ontology design pattern models the consequences of exposure of an object to a hazard. In its current form, the ODP is well suited for representing the consequences of exposure after the fact, which is very useful for applications such as damage assessment and recovery planning. In this work, we present a modification to this pattern that enables it to additionally support proactive questions central to risk assessment and mitigation planning.

%B Workshop on Ontology Design Patterns (WOP) %8 10/2016 %G eng %0 Online Database %D 2016 %T Modified Hazardous Situation ODP %A Michelle Cheatham %A Ferguson, Holly %A Vardeman, Charles %A Cogan Shimizu %X

The Hazardous Situation ontology design pattern models the consequences of exposure of an object to a hazard. In its current form, the ODP is well suited for representing the consequences of exposure after the fact, which is very useful for applications such as damage assessment and recovery planning. In this work, we present a modification to this pattern that enables it to additionally support proactive questions central to risk assessment and mitigation planning.

%G eng %0 Generic %D 2016 %T Modular Ontology Architecture for Data Integration in the GeoLink Project %A Adila Krisnadhi %C Ontology Summit 2016 (online) %G eng %U http://ontologforum.org/index.php?title=ConferenceCall_2016_02_25&oldid=22543#hid1C2C %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T Ontology Design Patterns for Data Integration: The GeoLink Experience %A Adila Krisnadhi %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %V 25 %P 267 - 278 %G eng %& 13 %R 10.3233/978-1-61499-676-7-267 %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T Ontology Design Patterns for Linked Data Publishing %A Adila Krisnadhi %A Nazifa Karima %A Pascal Hitzler %A Reihaneh Amini %A Víctor Rodríguez-Doncel %A Krzysztof Janowicz %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %V 25 %P 201 - 232 %G eng %& 10 %R 10.3233/978-1-61499-676-7-201 %0 Book %B Studies On the Semantic Web %D 2016 %T Ontology Engineering with Ontology Design Patterns: Foundations and Applications %A Pascal Hitzler %A Aldo Gangemi %A Krzysztof Janowicz %A Adila Krisnadhi %A Valentina Presutti %B Studies On the Semantic Web %I IOS Press %C Amsterdam %V 025 %G eng %0 Conference Paper %D 2016 %T OWLAx: A Protege Plugin to Support Ontology Axiomatization through Diagramming %A Md Kamruzzaman Sarker %A Adila Krisnadhi %A Pascal Hitzler %X

Abstract. Once the conceptual overview, in terms of a somewhat informal class diagram, has been designed in the course of engineering an ontology, the process of adding many of the appropriate logical axioms is mostly a routine task. We provide a Prot´eg´e3 plugin which supports this task, together with a visual user interface, based on established methods for ontology design pattern modeling.

%I 15th International Semantic Web Conference, ISWC2016, Kobe, Japan, October 2016 %C Kobe, Japan %G eng %U http://ceur-ws.org/Vol-1690/paper83.pdf %0 Conference Paper %B The Semantic Web - {ISWC} 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part {I} %D 2016 %T A Practical Acyclicity Notion for Query Answering Over Horn-SRIQ Ontologies %A David Carral %A Cristina Feier %A Pascal Hitzler %X

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.

%B The Semantic Web - {ISWC} 2016 - 15th International Semantic Web Conference, Kobe, Japan, October 17-21, 2016, Proceedings, Part {I} %P 70–85 %G eng %U http://dx.doi.org/10.1007/978-3-319-46523-4_5 %R 10.1007/978-3-319-46523-4_5 %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T The Role Patterns %A Adila Krisnadhi %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %I IOS Press %V 25 %P 313–319 %G eng %& 16 %R 10.3233/978-1-61499-676-7-313 %0 Conference Paper %B Web Technologies and Applications - 18th Asia-Pacific Web Conference, APWeb 2016, Suzhou, China, September 23-25, 2016 %D 2016 %T Reasoning with Large Scale OWL 2 EL Ontologies Based on MapReduce %A Zhangquan Zhou %A Guilin Qi %A Chang Liu %A Raghava Mutharaju %A Pascal Hitzler %B Web Technologies and Applications - 18th Asia-Pacific Web Conference, APWeb 2016, Suzhou, China, September 23-25, 2016 %I Springer %C Heidelberg %G eng %0 Journal Article %J Online Information Review %D 2016 %T Recognition of side effects as implicit-opinion words in drug reviews %A Ebrahimi, Monireh %A Yazdavar, Amir Hossein %A Salim, Naomie %A Eltyeb, Safaa %B Online Information Review %V 40 %P 1018–1032 %G eng %0 Generic %D 2016 %T Recognition of side effects as implicit-opinion words in drug reviews %A Monireh Ebrahimi %A Amir HosseinYazdavar %A Naomie Salim %A Safaa Eltyeb %X

Many opinion-mining systems and tools have been developed to provide users with the attitudes of people toward entities and their attributes or the overall polarities of documents. In addition, side effects are one of the critical measures used to evaluate a patient’s opinion for a particular drug. However, side effect recognition is a challenging task, since side effects coincide with disease symptoms lexically and syntactically. The purpose of this paper is to extract drug side effects from drug reviews as an integral implicit-opinion words.

%G eng %0 Journal Article %J Neural Computing and Applications %D 2016 %T Rock strength estimation: a PSO-based BP approach %A Mohamad, E Tonnizam %A Armaghani, D Jahed %A Momeni, E %A Yazdavar, AH %A Ebrahimi, M %B Neural Computing and Applications %P 1–12 %G eng %0 Book Section %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %D 2016 %T On the Roles of Logical Axiomatizations for Ontologies %A Pascal Hitzler %A Adila Krisnadhi %B Ontology Engineering with Ontology Design Patterns: Foundations and Applications %I IOS Press %C Amsterdam %G eng %0 Book Section %B Springer Handbook on Big Data %D 2016 %T Semantic Data Integration %A Michelle Cheatham %A Pesquita, Catia %B Springer Handbook on Big Data %G eng %0 Conference Paper %B PrivOn Workshop at ISWC %D 2016 %T Semantic Web Enabled Record Linkage Attacks on Anonymized Data %A Jacob Miracle %A Michelle Cheatham %B PrivOn Workshop at ISWC %G eng %0 Conference Paper %B 15th International Semantic Web Conference (ISWC) 2016 %D 2016 %T Towards Best Practices for Crowdsourcing Ontology Alignment Benchmarks %A Reihaneh Amini %A Michelle Cheatham %A Pawel Grzebala %A Helena B. McCurdy %X

Ontology alignment systems establish the links between ontologies that enable knowledge from various sources and domains to be used by applications in many different ways. Unfortunately, these systems are not perfect. Currently, the results of even the best-performing alignment systems need to be manually verified in order to be fully trusted. Ontology alignment researchers have turned to crowdsourcing platforms such as Amazon's Mechanical Turk to accomplish this. However, there has been little systematic analysis of the accuracy of crowdsourcing for alignment verification and the establishment of best practices. In this work, we analyze the impact of the presentation of the context of potential matches and the way in which the question is presented to workers on the accuracy of crowdsourcing for alignment verification.

%B 15th International Semantic Web Conference (ISWC) 2016 %C Kobe, Japan %G eng %0 Conference Paper %B International Conference on World Wide Web %D 2016 %T Tweet Properly: Analyzing Deleted Tweets to Understand and Identify Regrettable Ones %A Lu Zhou %A Wenbo Wang %A Keke Chen %X

 

%B International Conference on World Wide Web %I International World Wide Web Conferences Steering Committee Republic and Canton of Geneva, Switzerland %8 04/2016 %@ 978-1-4503-4143-1 %G eng %R doi>10.1145/2872427.2883052 %0 Generic %D 2016 %T Update on ESIP Testbed Project %A Nazifa Karima %A Adila Krisnadhi %A Pascal Hitzler %A Tom Narock %G eng %0 Online Database %D 2016 %T Use case for the Modified Hazardous Situation ODP %A Michelle Cheatham %A Cogan Shimizu %A Holly Ferguson %A Charles Vardeman %G eng %0 Conference Paper %B Joint International Semantic Technology Conference %D 2015 %T Alignment Aware Linked Data Compression %A Joshi, Amit Krishna %A Pascal Hitzler %A Dong, Guozhu %X

The success of linked data has resulted in a large amount of data being generated in a standard RDF format. Various techniques have been explored to generate a compressed version of RDF datasets for archival and transmission purpose. However, these compression techniques are designed to compress a given dataset without using any external knowledge, either through a compact representation or removal of semantic redundancies present in the dataset. In this paper, we introduce a novel approach to compress RDF datasets by exploiting alignments present across various datasets at both instance and schema level. Our system generates lossy compression based on the confidence value of relation between the terms. We also present a comprehensive evaluation of the approach by using reference alignment from OAEI.

%B Joint International Semantic Technology Conference %G eng %0 Conference Paper %B Proceedings of the 1st Workshop on Negative or Inconclusive Results in Semantic Web (NoISE 2015) co-located with 12th Extended Semantic Web Conference (ESWC 2015) %D 2015 %T Are We Really Standing on the Shoulders of Giants? %A Raghava Mutharaju %A Pavan Kapanipathi %B Proceedings of the 1st Workshop on Negative or Inconclusive Results in Semantic Web (NoISE 2015) co-located with 12th Extended Semantic Web Conference (ESWC 2015) %C Portoroz, Slovenia %G eng %0 Conference Paper %B Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI) %D 2015 %T The Combined Approach to Query Answering Beyond the OWL 2 Profiles %A Cristina Feier %A David Carral %A Giorgio Stefanoni %A Cuenca Grau, Bernardo %A Ian Horrocks %X

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.

%B Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI) %G eng %U http://www.cs.ox.ac.uk/isg/people/cristina.feier/ijcai_rsafinal.pdf %0 Generic %D 2015 %T Data Perturbation via Randomized Normalization for Privacy Protection %A Reihaneh Amini %A Michelle Cheatham %A Nazifa Karima %0 Conference Paper %B Proceedings of the 12th Extended Semantic Web Conference (ESWC 2015) %D 2015 %T Distributed and Scalable OWL EL Reasoning %A Raghava Mutharaju %A Pascal Hitzler %A Prabhaker Mateti %A Freddy Lécué %K DistEL %K Distributed Reasoning %K Ontology Classification %K OWL EL %X

OWL 2 EL is one of the tractable proles of the Web Ontology Language (OWL) which is a W3C-recommended standard. OWL 2 EL provides sucient expressivity to model large biomedical ontologies as well as streaming data such as trac, while at the same time allows for ecient reasoning services. Existing reasoners for OWL 2 EL, however, use only a single machine and are thus constrained by memory and computational power. At the same time, the automated generation of ontological information from streaming data and text can lead to very large ontologies which can exceed the capacities of these reasoners. We thus describe a distributed reasoning system that scales well using a cluster of commodity machines. We also apply our system to a use case on city trac data and show that it can handle volumes which cannot be handled by current single machine reasoners.

%B Proceedings of the 12th Extended Semantic Web Conference (ESWC 2015) %I Springer %C Portoroz, Slovenia %G eng %0 Conference Paper %B NSF Data Science Workshop 2015 %D 2015 %T Distributed Reasoning over Ontology Streams and Large Knowledge Base %A Raghava Mutharaju %B NSF Data Science Workshop 2015 %C Seattle, USA %G eng %0 Conference Paper %B 2015 American Geophysical Union Fall Meeting, San Francisco, 14-18 December 2015 %D 2015 %T EarthCube GeoLink: Semantics and Linked Data for the Geosciences %A Robert A. Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Douglas Fils %A Pascal Hitzler %A Krzysztof Janowicz %A Peng Ji %A Matthew Jones %A Adila Krisnadhi %A Kerstin Lehnert %A Audrey Mickle %A Tom Narock %A Margaret O'Brien %A Lisa Raymond %A Mark Schildhauer %A Adam Shepherd %A Peter Wiebe %B 2015 American Geophysical Union Fall Meeting, San Francisco, 14-18 December 2015 %G eng %0 Conference Paper %B Proceedings of the 28th International Workshop on Description Logics (DL) %D 2015 %T Extending the Combined Approach Beyond Lightweight Description Logics %A Cristina Feier %A David Carral %A Giorgio Stefanoni %A Cuenca Grau, Bernardo %A Ian Horrocks %X

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.

%B Proceedings of the 28th International Workshop on Description Logics (DL) %G eng %U http://www.cs.ox.ac.uk/isg/people/cristina.feier/pdfs/dlmain.pdf %0 Generic %D 2015 %T The GeoLink Framework for Pattern-based Linked Data Integration %A Adila Krisnadhi %A Yingjie Hu %A Krzsyztof Janowicz %A Pascal Hitzler %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Douglas Fils %A Timothy Finin %A Peng Ji %A Matthew Jones %A Nazifa Karima %A Kerstin Lehnert %A Audrey Mickle %A Thomas Narock %A Margaret O'Brien %A Lisa Raymond %A Adam Shepherd %A Mark Schildhauer %A Peter Wiebe %B Proceedings of the ISWC 2015 Posters & Demonstrations Track %8 10/2015 %0 Conference Paper %B The Semantic Web - ISWC 2015. 14th International Semantic Web Conference, Bethlehem, Pennsylvania, United States, October 11-15, 2015 %D 2015 %T The GeoLink Modular Oceanography Ontology %A Adila Krisnadhi %A Yingjie Hu %A Krzysztof Janowicz %A Pascal Hitzler %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Douglas Fils %A Timothy Finin %A Peng Ji %A Matthew Jones %A Nazifa Karima %A Kerstin Lehnert %A Audrey Mickle %A Thomas Narock %A Margaret O'Brien %A Lisa Raymond %A Adam Shepherd %A Mark Schildhauer %A Peter Wiebe %B The Semantic Web - ISWC 2015. 14th International Semantic Web Conference, Bethlehem, Pennsylvania, United States, October 11-15, 2015 %I Springer %8 10/2015 %G eng %0 Generic %D 2015 %T Identifying Regrettable Messages from Tweets %A Lu Zhou %A Wenbo Wang %A Keke Chen %I International World Wide Web Conferences Steering Committee %8 05/2015 %@ 978-1-4503-3473-0 %G English %9 Posters %R doi>10.1145/2740908.2742735 %0 Thesis %B Computer Science and Engineering %D 2015 %T A Language for Inconsistency-Tolerant Ontology Mapping %A Kunal Sengupta %X

Ontology alignment plays a key role in enabling interoperability among various data sources present in the web. The nature of the world is such, that the same concepts differ in meaning, often so slightly, which makes it difficult to relate these concepts. It is the omni-present heterogeneity that is at the core of the web. The research work presented in this dissertation, is driven by the goal of providing a robust ontology alignment language for the semantic web, as we show that description logics based alignment languages are not suitable for aligning ontologies. The adoption of the semantic web technologies has been consistently on the rise over the past decade, and it continues to show promise. The core component of the semantic web is the set of knowledge representation languages -- mainly the W3C (World Wide Web Consortium) standards Web Ontology Language (OWL), Resource Description Framework (RDF), and Rule Interchange Format (RIF). While these languages have been designed in order to be suitable for the openness and extensibility of the web, they lack certain features which we try to address in this dissertation. One such missing component is the lack of non-monotonic features, in the knowledge representation languages, that enable us to perform common sense reasoning. For example, OWL supports the open world assumption (OWA), which means that knowledge about everything is assumed to be possibly incomplete at any point of time. However, experience has shown that there are situations that require us to assume that certain parts of the knowledge base are complete. Employing the Closed World Assumption (CWA) helps us achieve this. Circumscription is a very well-known approach towards CWA, which provides closed world semantics by employing the idea of minimal models with respect to certain predicates which are closed. We provide the formal semantics of the notion of Grounded Circumscription, which is an extension of circumscription with desirable properties like decidability. We also provide a tableaux calculus to reason over knowledge bases under the notion of grounded circumscription. Another form of common sense logic, is default logic. Default logic provides a way to specify rules that, by default, hold in most cases but not necessarily in all cases. The classic example of such a rule is: If something is a bird then it flies. The power of defaults comes from the ability of the logic to handle exceptions to the default rules. For example, a bird will be assumed to fly by default unless it is an exception, i.e. it belongs to a class of birds that do not fly, like penguins. Interestingly, this property of defaults can be utilized to create mappings between concepts of different ontologies (knowledge bases). We provide a new semantics for the integration of defaults in description logics and show that it improves upon previously known results in literature. In this study, we give various examples to show the utility and advantages of using a default logic based ontology alignment language. We provide the semantics and decidability results of a default based mapping language for tractable fragments of description logics (or OWL). Furthermore, we provide a proof of concept system and qualitative analysis of the results obtained from the system when compared to that of traditional mapping repair techniques.

%B Computer Science and Engineering %V Doctor of Philosophy %G eng %0 Conference Paper %B 2015 American Geophysical Union Fall Meeting, San Francisco, 14-18 December 2015 %D 2015 %T Linked Data: Forming Partnerships at the Data Layer %A Adam Shepherd %A Cynthia Chandler %A Robert A. Arko %A Matthew Jones %A Pascal Hitzler %A Krzysztof Janowicz %A Adila Krisnadhi %A Mark Schildhauer %A Douglas Fils %A Tom Narock %A Robert Groman %A Margaret O'Brien %A Evan W. Patton %A Danie Kinkade %A Shannon Rauch %B 2015 American Geophysical Union Fall Meeting, San Francisco, 14-18 December 2015 %G eng %0 Conference Paper %B 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 %D 2015 %T A Minimal Ontology Pattern for Life Cycle Assessment Data %A Krzysztof Janowicz %A Adila Krisnadhi %A Yingjie Hu %A Sangwon Suh %A Bo Pedersen Weidema %A Beatriz Rivela %A Johan Tivander %A David E. Meyer %A Gary Berg-Cross %A Pascal Hitzler %A Wesley Ingwersen %A Brandon Kuczenski %A Charles Vardeman %A Yiting Ju %B 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 %8 10/2015 %G eng %0 Conference Paper %B AAAI 2015 Spring Symposium on Knowledge Representation and Reasoning: Integrating Symbolic and Neural Approaches. Technical Report SS-15-03, AAAI Press, Palo Alto %D 2015 %T Neural-Symbolic Learning and Reasoning: Contributions and Challenges %A Artur S. d'Avila Garcez %A Tarek R. Besold %A Luc De Raedt %A Peter Földiak %A Pascal Hitzler %A Thomas Icard %A Kai-Uwe Kühnberger %A Luís C. Lamb %A Riisto Miikkulainen %A Daniel L. Silver %B AAAI 2015 Spring Symposium on Knowledge Representation and Reasoning: Integrating Symbolic and Neural Approaches. Technical Report SS-15-03, AAAI Press, Palo Alto %I AAAI Press %G eng %0 Conference Paper %B CERF 2015: 23rd Biennial Confernence, Grand Challenges in Coastal and Estuarine Science: Securing Our Future, Portland, OR, November 2015 %D 2015 %T Ontological Support of Data Discovery and Synthesis in Estuarine and Coastal Science %A Anne Thessen %A Benjamin Fertig %A Ramona Walls %A Pascal Hitzler %A Rick Ziegler %B CERF 2015: 23rd Biennial Confernence, Grand Challenges in Coastal and Estuarine Science: Securing Our Future, Portland, OR, November 2015 %G eng %0 Conference Paper %B 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 %D 2015 %T An Ontology Design Pattern for Chess Games %A Adila Krisnadhi %A Víctor Rodríguez-Doncel %A Pascal Hitzler %A Michelle Cheatham %A Nazifa Karima %A Reihaneh Amini %A Ashley Coleman %B 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 %V 1461 %8 10/2015 %G eng %U http://ceur-ws.org/Vol-1461/WOP2015_pattern_abstract_2.pdf %0 Conference Paper %B 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 %D 2015 %T An Ontology Design Pattern for Data Integration in the Library Domain %A Patrick Obrien %A David Carral %A Jeff Mixter %A Pascal Hitzler %X

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.

%B 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 %8 10/2015 %G eng %0 Conference Paper %B 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 %D 2015 %T An Ontology Design Pattern for Dynamic Relative Relationships %A Holly Ferguson %A Adila Krisnadhi %A Charles Vardeman %E Eva Blomqvist %E Pascal Hitzler %E Adila Krisnadhi %E Thomas Narock %E Monika Solanki %B 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 %I CEUR-WS.org %V 1461 %8 10/2015 %G eng %U http://ceur-ws.org/Vol-1461/WOP2015_paper_3.pdf %0 Conference Paper %B 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 %D 2015 %T An Ontology Design Pattern for Particle Physics Analysis %A David Carral %A Michelle Cheatham %A Sunje Dallmeir-Tiessen %A Patricia Herterich %A Michael D. Hildreth %A Pascal Hitzler %A Adila Krisnadhi %A Kati Lassila-Perini %A Elizabeth Sexton-Kennedy %A Charles Vardeman %A Gordon Watts %E Eva Blomqvist %E Pascal Hitzler %E Adila Krisnadhi %E Thomas Narock %E Monika Solanki %X

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.

%B 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 %I CEUR-WS.org %V 1461 %8 10/2015 %G eng %U http://ceur-ws.org/Vol-1461/WOP2015_pattern_abstract_5.pdf %0 Conference Paper %B European Geosciences Union General Assembly 2015, Vienna, Austria, 12 - 17 April 2015 %D 2015 %T Ontology Design Patterns: Bridging the Gap Between Local Semantic Use Cases and Large-Scale, Long-Term Data Integration %A Adam Shepherd %A Robert Arko %A Adila Krisnadhi %A Pascal Hitzler %A Krzysztof Janowicz %A Cynthia Chandler %A Thomas Narock %A Michelle Cheatham %A Mark Schildhauer %A Matthew Jones %A Lisa Raymond %A Audrey Mickle %A Timothy Finin %A Douglas Fils %B European Geosciences Union General Assembly 2015, Vienna, Austria, 12 - 17 April 2015 %G eng %0 Conference Paper %B LCA XV, University of British Columbia, Vancouver, Canada, October 6-8, 2015 %D 2015 %T Ontology Design Patterns for Semantically Enriched LCA %A Brandon Kuczenski %A Wesley Ingwersen %A Krzysztof Janowicz %A Pascal Hitzler %A Gary Berg-Cross %A Charles Vardeman %A Sangwon Suh %B LCA XV, University of British Columbia, Vancouver, Canada, October 6-8, 2015 %G eng %0 Conference Paper %B Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %D 2015 %T An Ontology For Specifying Spatiotemporal Scopes in Life Cycle Assessment %A Bo Yan %A Yingjie Hu %A Brandon Kuczenski %A Krzsyztof Janowicz %A Andrea Ballatore %A Adila Krisnadhi %A Pascal Hitzler %A Sangwon Suh %A Wesley Ingwersen %E Claudia d'Amato %E Freddy Lécué %E Raghava Mutharaju %E Thomas Narock %E Fabian Wirth %B Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %I CEUR-WS.org %V 1501 %P 25-30 %8 10/2015 %G eng %U http://ceur-ws.org/Vol-1501/Diversity2015-paper_4.pdf %0 Conference Paper %B 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %D 2015 %T Ontology modeling with domain experts %A Pascal Hitzler %B 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %G eng %0 Conference Paper %B Diversity++ 2015, Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %D 2015 %T Ontology modeling with domain experts: The GeoVoCamp experience %A Pascal Hitzler %A Krzysztof Janowicz %A Adila Krisnadhi %B Diversity++ 2015, Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %G eng %0 Book Section %B The Semantic Web in Earth and Space Science: Current Status and Future Directions %D 2015 %T Ontology Pattern Modeling for Cross-Repository Data Integration in the Ocean Sciences: The Oceanographic Cruise Example %A Adila Krisnadhi %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Timothy Finin %A Pascal Hitzler %A Krzysztof Janowicz %A Thomas Narock %A Lisa Raymond %A Adam Shepherd %A Peter Wiebe %X EarthCube is a major effort of the National Science Foundation to establish a next-generation knowledge architecture for the broader geosciences. Data storage, retrieval, access, and reuse are central parts of this new effort. Currently, EarthCube is organized around several building blocks and research coordination networks. OceanLink is a semantics-enabled building block that aims at improving data retrieval and reuse via ontologies, Semantic Web technologies, and Linked Data for the ocean sciences. Cruises, in the sense of research expeditions, are central events for ocean scientists. Consequently, information about these cruises and the involved vessels is of primary interest for oceanographers, and thus, needs to be shared and made retrievable. In this paper, we report the use of a design pattern-centric strategy to model Cruise for OceanLink data integration. We provide a formal axiomatization of the introduced pattern using the Web Ontology Language, explain design choices and discuss the planned deployment and application scenarios of our model. %B The Semantic Web in Earth and Space Science: Current Status and Future Directions %I IOS Press %P 256-284 %G eng %0 Thesis %B Department of Computer Science and Engineering %D 2015 %T Ontology Pattern-Based Data Integration %A Adila Krisnadhi %X

Data integration is concerned with providing a unified access to data residing at multiple sources. Such a unified access is realized by having a global schema and a set of mappings between the global schema and the local schemas of each data source, which specify how user queries at the global schema can be translated into queries at the local schemas. Data sources are typically developed and maintained independently, and thus, highly heterogeneous. This causes difficulties in integration because of the lack of interoperability in the aspect of architecture, data format, as well as syntax and semantics of the data.

This dissertation represents a study on how small, self-contained ontologies, called ontology design patterns, can be employed to provide semantic interoperability in a cross-repository data integration system. The idea of this so-called ontology pattern- based data integration is that a collection of ontology design patterns can act as the global schema that still contains sufficient semantics, but is also flexible and simple enough to be used by linked data providers. On the one side, this differs from existing ontology-based solutions, which are based on large, monolithic ontologies that provide very rich semantics, but enforce too restrictive ontological choices, hence are shunned by many data providers. On the other side, this also differs from the purely linked data based solutions, which do offer simplicity and flexibility in data publishing, but too little in terms of semantic interoperability.

We demonstrate the feasibility of this idea through the actual development of a large scale data integration project involving seven ocean science data repositories from five institutions in the U.S. In addition, we make two contributions as part of this dissertation work, which also play crucial roles in the aforementioned data integration project. First, we develop a collection of more than a dozen ontology design patterns that capture the key notions in the ocean science occurring in the participating data repositories. These patterns contain axiomatization of the key notions and were developed with an intensive involvement from the domain experts. Modeling of the patterns was done in a systematic workflow to ensure modularity, reusability, and flexibility of the whole pattern collection. Second, we propose the so-called pattern views that allow data providers to publish their data in very simple intermediate schema and show that they can greatly assist data providers to publish their data without requiring a thorough understanding of the axiomatization of the patterns. 

%B Department of Computer Science and Engineering %I Wright State University %C Dayton %V Doctor of Philosophy %P 233 %8 12/2015 %G eng %U http://rave.ohiolink.edu/etdc/view?acc_num=wright1453177798 %9 Dissertation %0 Conference Paper %B Proceedings of the 6th International Workshop on Consuming Linked Data co-located with 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, US, October 12th, 2015 %D 2015 %T Pattern-Based Linked Data Publication: The Linked Chess Dataset Case %A Víctor Rodríguez-Doncel %A Adila Krisnadhi %A Pascal Hitzler %A Michelle Cheatham %A Nazifa Karima %A Reihaneh Amini %E Olaf Hartig %E Juan Sequeda %E Aidan Hogan %X

This paper discusses the relationship between ontology design patterns (ODPs), data models and linked data, proposing a method that simplifies the task of publishing linked data while adhering to good modeling practices that reuse well-studied ODPs. The proposed process simplifies the tasks of the domain experts but preserves the integrity of the design patterns, favoring a well-designed and well documented data model which fosters data reuse. The work is illustrated with a linked dataset of two million chess games, with the key information mapped to other linked datasets and supported by formalized design patterns. This is the first time a chess dataset is presented as linked data, and an insight on its usefulness is given.

%B Proceedings of the 6th International Workshop on Consuming Linked Data co-located with 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, US, October 12th, 2015 %I CEUR-WS.org %V 1426 %8 10/2015 %G eng %U http://dase.cs.wright.edu/publications/pattern-based-linked-data-publication-linked-chess-dataset-case %9 Technical Report %0 Conference Proceedings %B CEUR Workshop Proceedings %D 2015 %T Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %E Claudia d'Amato %E Freddy Lécué %E Raghava Mutharaju %E Tom Narock %E Fabian Wirth %B CEUR Workshop Proceedings %I CEUR-WS.org %C Bethlehem, PA, USA %V 1501 %G eng %U http://ceur-ws.org/Vol-1501 %0 Conference Proceedings %D 2015 %T 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 %A Eva Blomqvist %A Pascal Hitzler %A Adila Krisnadhi %A Tom Narock %A Monika Solanki %G eng %0 Conference Paper %B Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %D 2015 %T R2R+BCO-DMO – Linked Oceanographic Datasets %A Adila Krisnadhi %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Pascal Hitzler %A Yingjie Hu %A Krzysztof Janowicz %A Peng Ji %A Nazifa Karima %A Adam Shepherd %A Peter Wiebe %E Claudia d'Amato %E Freddy Lécué %E Raghava Mutharaju %E Thomas Narock %E Fabian Wirth %X The Biological and Chemical Oceanography Data Management Office (BCO-DMO) and the Rolling Deck to Repository (R2R) program are two key data repositories for oceanographic research, supported by the U.S. National Science Foundation (NSF). R2R curates digital data and documentation generated by environmental sensor systems installed on vessels from the U.S. academic research fleet, with support from the NSF Oceanographic Technical Services and Arctic Research Logistics Programs. BCO-DMO human-curates and maintains data and metadata including biological, chemical, and physical measurements and results from projects funded by the NSF Biological Oceanography, Chemical Oceanography, and Antarctic Organisms & Ecosystems Programs. These two repositories have a strong connection, and document several thousand U.S. oceanographic research expeditions since the 1970’s. Recently, R2R and BCO-DMO have made their metadata collections available as Linked Data, accessible via public SPARQL endpoints. In this paper, we report on these datasets. %B Proceedings of the 1st International Diversity++ Workshop co-located with the 14th International Semantic Web Conference (ISWC 2015), Bethlehem, Pennsylvania, USA, October 12, 2015 %I CEUR-WS.org %V 1501 %P 15-24 %8 10/2015 %G eng %0 Conference Paper %B International Conference on Cloud Computing %D 2015 %T Scalable Euclidean Embedding for Big Data %A Zohreh Alavi %A Sagar Sharma %A Lu Zhou %A Keke Chen %B International Conference on Cloud Computing %I IEEE %C New York City, NY %8 07/2015 %G eng %R 10.1109/CLOUD.2015.107 %0 Conference Paper %B International Semantic Web Conference, ISWC 2015, Posters and Demonstrations Track %D 2015 %T The Semantic Web Journal as Linked Data %A Yingjie Hu %A Krzysztof Janowicz %A Pascal Hitzler %A Kunal Sengupta %B International Semantic Web Conference, ISWC 2015, Posters and Demonstrations Track %I Springer %8 2015 %G eng %0 Journal Article %J IEEE Computer Society Special Technical Community on Social Networking E-Letter %D 2015 %T The Semantic Web Journal Review Process: Transparent and Open %A Pascal Hitzler %A Krzysztof Janowicz %B IEEE Computer Society Special Technical Community on Social Networking E-Letter %V 3 %8 06/2015 %G eng %N 1 %0 Journal Article %J AI Magazine %D 2015 %T Semantics for Big Data %A Frank van Harmelen %A James A. Hendler %A Pascal Hitzler %A Krzysztof Janowicz %B AI Magazine %V 36 %P 3–4 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2559 %0 Conference Paper %B First International Workshop on Social Sensing (SocialSens 2015) %D 2015 %T Social Signal Processing for Real-time Situational Understanding: a Vision and Approach %A Kasthuri Jayarajah %A Shuochao Yao %A Raghava Mutharaju %A Archan Misra %A Geeth De Mel %A Julie Skipper %A Tarek Abdelzaher %A Michael Kolodny %X

The US Army Research Laboratory (ARL) and the Air Force Research Laboratory (AFRL) have established a collaborative research enterprise referred to as the Situational Understanding Research Institute (SURI). The goal is to develop an information processing framework to help the military obtain real-time situational awareness of physical events by harnessing the combined power of multiple sensing sources to obtain insights about events and their evolution. It is envisioned that one could use such information to predict behaviors of groups, be they local transient groups (e.g., protests) or widespread, networked groups, and thus enable proactive prevention of nefarious activities. This paper presents a vision of how social media sources can be exploited in the above context to obtain insights about events, groups, and their evolution.

%B First International Workshop on Social Sensing (SocialSens 2015) %C Dallas, Texas, USA %G eng %0 Conference Paper %B 12th OWL Experiences and Directions Workshop (OWLED 2015) co-located with the 14th International Semantic Web Conference (ISWC 2015) %D 2015 %T Towards a Rule Based Distributed OWL Reasoning Framework %A Raghava Mutharaju %A Prabhaker Mateti %A Pascal Hitzler %X The amount of data exposed in the form of RDF and OWL continues to increase exponentially. Some approaches have already been proposed for the scalable reasoning over several language profiles such as RDFS, OWL Horst, OWL 2 EL, OWL 2 RL etc. But all those approaches are limited to the particular ruleset that the reasoner supports. In this work, we propose the idea for a rule-based distributed reasoning framework that can support any given ruleset and highlight some of the challenges that needs to be solved in order to implement such a framework. %B 12th OWL Experiences and Directions Workshop (OWLED 2015) co-located with the 14th International Semantic Web Conference (ISWC 2015) %I Springer %C Bethlehem, PA, USA %G eng %0 Conference Paper %B ISWC 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015 %D 2015 %T Towards Defeasible Mappings for Tractable Description Logics %A Kunal Sengupta %A Pascal Hitzler %B ISWC 2015 - 14th International Semantic Web Conference, Bethlehem, PA, USA, October 11-15, 2015 %I Springer %P 237-252 %G eng %0 Journal Article %J AI Magazine %D 2015 %T Why the Data Train Needs Semantic Rails %A Krzysztof Janowicz %A Frank van Harmelen %A James A. Hendler %A Pascal Hitzler %X While catchphrases such as big data, smart data, data intensive science, or smart dust highlight different aspects, they share a common theme: Namely, a shift towards a data-centric perspective in which the synthesis and analysis of data at an ever-increasing spatial, temporal, and thematic resolution promises new insights, while, at the same time, reducing the need for strong domain theories as starting points. In terms of the envisioned methodologies, those catchphrases tend to emphasize the role of predictive analytics, i.e., statistical techniques including data mining and machine learning, as well as supercomputing. Interestingly, however, while this perspective takes the availability of data as a given, it does not answer the question how one would discover the required data in today’s chaotic information universe, how one would understand which datasets can be meaningfully integrated, and how to communicate the results to humans and machines alike. The Semantic Web addresses these questions. In the following, we argue why the data train needs semantic rails. We point out that making sense of data and gaining new insights works best if inductive and deductive techniques go hand-in-hand instead of competing over the prerogative of interpretation. %B AI Magazine %V 36 %P 5–14 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2560 %0 Conference Paper %B 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. %D 2014 %T All But Not Nothing: Left-Hand Side Universals for Tractable OWL Profiles %A David Carral %A Adila Krisnadhi %A Sebastian Rudolph %A Pascal Hitzler %E C. Maria Keet %E Valentina A. M. Tamma %K description logics %K Horn Logics %K OWL %X 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. %B 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. %I CEUR-WS.org %V 1265 %P 97-108 %8 10/2014 %G eng %U http://ceur-ws.org/Vol-1265/owled2014_submission_13.pdf %0 Journal Article %J Chemometrics and Intelligent Laboratory Systems %D 2014 %T Analytical modeling and simulation of I–V characteristics in carbon nanotube based gas sensors using ANN and SVR methods %A Akbari, Elnaz %A Buntat, Zolkafle %A Enzevaee, Aria %A Ebrahimi, Monireh %A Yazdavar, Amir Hossein %A Yusof, Rubiyah %B Chemometrics and Intelligent Laboratory Systems %V 137 %P 173–180 %G eng %0 Conference Proceedings %B AIMSA 2014 %D 2014 %T Artificial Intelligence: Methodology, Systems, and Applications - 16th International Conference, AIMSA 2014, Varna, Bulgaria, September 11-13, 2014. Proceedings %E Gennady Agre %E Pascal Hitzler %E Adila Krisnadhi %E Sergei O. Kuznetsov %B AIMSA 2014 %I Springer %V 8722 %@ 978-3-319-10553-6 %G eng %U http://dx.doi.org/10.1007/978-3-319-10554-3 %R 10.1007/978-3-319-10554-3 %0 Conference Paper %B Neural-Symbolic Learning and Reasoning (Dagstuhl Seminar 14381) %D 2014 %T Combining Learning and Reasoning for Big Data %A Pascal Hitzler %E Artur S. d'Avila Garcez %E Marco Gori %E Pascal Hitzler %E Luís C. Lamb %B Neural-Symbolic Learning and Reasoning (Dagstuhl Seminar 14381) %V 9 %G eng %N 4 %0 Conference Paper %B 13th International Semantic Web Conference (ISWC 2014) %D 2014 %T Conference v2.0: An uncertain version of the OAEI Conference benchmark %A Michelle Cheatham %A Pascal Hitzler %E Peter Mika %E Tania Tudorache %E Abraham Bernstein %E Chris Welty %E Craig A. Knoblock %E Denny Vrandecic %E Paul T. Groth %E Natasha F. Noy %E Krzysztof Janowicz %E Carole A. Goble %K benchmark %K OAEI %K Ontology Alignment %X The Ontology Alignment Evaluation Initiative is a set of benchmarks for evaluating the performance of ontology alignment systems. In this paper we re-examine the Conference track of the OAEI, with a focus on the degree of agreement between the reference alignments within this track and the opinion of experts. We propose a new version of this benchmark that more closely corresponds to expert opinion and confidence on the matches. The performance of top alignment systems is compared on both versions of the benchmark. Additionally, a general method for crowdsourcing the development of more benchmarks of this type using Amazon’s Mechanical Turk is introduced and shown to be scalable, cost-effective and to agree well with expert opinion. %B 13th International Semantic Web Conference (ISWC 2014) %I Lecture Notes in Computer Science, Springer %C Riva del Garda, Italy %V 8797 %P 148-163 %8 10/2014 %G eng %0 Book Section %B Handbook of the History of Logic %D 2014 %T Description Logics %A Matthias Knorr %A Pascal Hitzler %E Dov. M. Gabbay %E John Woods %E Jörg Siekmann %B Handbook of the History of Logic %I Elsevier %V 9 %P 679-710 %G eng %0 Book Section %B Encyclopedia of Social Network Analysis and Mining %D 2014 %T Description Logics %A Adila Krisnadhi %A Pascal Hitzler %B Encyclopedia of Social Network Analysis and Mining %I Springer %P 346-351 %G eng %U http://dx.doi.org/10.1007/978-1-4614-6170-8_108 %R 10.1007/978-1-4614-6170-8_108 %0 Conference Paper %B Proceedings of the ISWC Developers Workshop 2014, co-located with the 13th International Semantic Web Conference (ISWC 2014) %D 2014 %T Developing a Distributed Reasoner for the Semantic Web %A Raghava Mutharaju %A Prabhaker Mateti %A Pascal Hitzler %E Ruben Verborgh %E Erik Mannens %X

OWL 2 EL is one of the tractable profiles of the Web Ontology Language (OWL) which has been standardized by the W3C. OWL 2 EL provides suficient expressivity to model large biomedical ontologies as well streaming traffic data. Automated generation of ontologies from streaming data and text can lead to very large ontologies. There is a need to develop scalable reasoning approaches which scale with the size of the ontologies. We briefly describe our distributed reasoner, DistEL along with our experience and lessons learned during its development.

%B Proceedings of the ISWC Developers Workshop 2014, co-located with the 13th International Semantic Web Conference (ISWC 2014) %I CEUR-WS.org %C Riva del Garda, Italy %V 1268 %P 108–112 %G eng %U http://ceur-ws.org/Vol-1268/paper18.pdf %0 Conference Paper %B Proceedings of the 10th International Workshop on Scalable Semantic Web Knowledge Base Systems, Riva Del Garda, Italy %D 2014 %T Distributed OWL EL Reasoning: The Story So Far %A Raghava Mutharaju %A Pascal Hitzler %A Prabhaker Mateti %E Thorsten Liebig %E Achille Fokoue %K Distributed Reasoning %K OWL EL %K Scalability %X

Automated generation of axioms from streaming data, such as traffic and text, can result in very large ontologies that single machine reasoners cannot handle. Reasoning with large ontologies requires distributed solutions. Scalable reasoning techniques for RDFS, OWL Horst and OWL 2 RL now exist. For OWL 2 EL, several distributed reasoning approaches have been tried, but are all perceived to be inefficient. We analyze this perception. We analyze completion rule based distributed approaches, using different characteristics, such as dependency among the rules, implementation optimizations, how axioms and rules are distributed. We also present a distributed queue approach for the classification of ontologies in description logic EL+ (fragment of OWL 2 EL).

%B Proceedings of the 10th International Workshop on Scalable Semantic Web Knowledge Base Systems, Riva Del Garda, Italy %I CEUR-WS.org %C Riva del Garda, Italy %V 1261 %P 61-76 %8 10/2014 %G eng %0 Conference Paper %B 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 %D 2014 %T EL-ifying Ontologies %A David Carral %A Cristina Feier %A Cuenca Grau, Bernardo %A Pascal Hitzler %A Ian Horrocks %K description logics %K OWL %K Rewriting %K Tractable Reasoning %X

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.

%B 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 %P 464–479 %G eng %U http://dx.doi.org/10.1007/978-3-319-08587-6_36 %R 10.1007/978-3-319-08587-6_36 %0 Conference Paper %B ICIEV %D 2014 %T Emotion recognition from speech based on relevant feature and majority voting %A Md Kamruzzaman Sarker %A Kazi Md Rokibul, Alam %A Md Arifuzzaman %X

This paper proposes an approach to detect emotion from human speech employing majority voting technique over several machine learning techniques. The contribution of this work is in two folds: firstly it selects those features of speech which is most promising for classification and secondly it uses the majority voting technique that selects the exact class of emotion. Here, majority voting technique has been applied over Neural Network (NN), Decision Tree (DT), Support Vector Machine (SVM) and K-Nearest Neighbor (KNN). Input vector of NN, DT, SVM and KNN consists of various acoustic and prosodic features like Pitch, Mel-Frequency Cepstral coefficients etc. From speech signal many feature have been extracted and only promising features have been selected. To consider a feature as promising, Fast Correlation based feature selection (FCBF) and Fisher score algorithms have been used and only those features are selected which are highly ranked by both of them. The proposed approach has been tested on Berlin dataset of emotional speech [3] and Electromagnetic Articulography (EMA) dataset [4]. The experimental result shows that majority voting technique attains better accuracy over individual machine learning techniques. The employment of the proposed approach can effectively recognize the emotion of human beings in case of social robot, intelligent chat client, call-center of a company etc.

%B ICIEV %G eng %0 Conference Paper %B European Geosciences Union General Assembly 2014 %D 2014 %T Enhancing Ocean Research Data Access %A Cynthia Chandler %A Robert Groman %A Adam Shepherd %A Molly Allison %A Robert Arko %A Yu Chen %A Peter Fox %A David Glover %A Pascal Hitzler %A Adam Leadbetter %A Thomas Narock %A Patrick West %A Peter Wiebe %B European Geosciences Union General Assembly 2014 %C Vienna, Austria %G eng %0 Journal Article %J Semantic Web %D 2014 %T Five stars of Linked Data vocabulary use %A Krzysztof Janowicz %A Pascal Hitzler %A Benjamin Adams %A Dave Kolas %A Charles Vardeman %X In 2010 Tim Berners-Lee introduced a 5 star rating to his Linked Data design issues page to encourage data publishers along the road to good Linked Data. What makes the star rating so effective is its simplicity, clarity, and a pinch of psychology – is your data 5 star? While there is an abundance of 5 star Linked Data available today, finding, querying, and integrating/interlinking these data is, to say the least, difficult. While the literature has largely focused on describing datasets, e.g., by adding provenance information, or interlinking them, e.g., by co-reference resolution tools, we would like to take Berners-Lee’s original proposal to the next level by introducing a 5 star rating for Linked Data vocabulary use. %B Semantic Web %V 5 %P 173–176 %G eng %U http://dx.doi.org/10.3233/SW-140135 %R 10.3233/SW-140135 %0 Conference Paper %B The Semantic Web: Trends and Challenges - 11th International Conference, ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014. Proceedings %D 2014 %T How to Best Find a Partner? An Evaluation of Editing Approaches to Construct R2RML Mappings %A Christoph Pinkel %A Carsten Binnig %A Peter Haase %A Clemens Martin %A Kunal Sengupta %A Johannes Trame %E Valentina Presutti %E Claudia d'Amato %E Fabien Gandon %E Mathieu d'Aquin %E Steffen Staab %E Anna Tordai %B The Semantic Web: Trends and Challenges - 11th International Conference, ESWC 2014, Anissaras, Crete, Greece, May 25-29, 2014. Proceedings %I Springer %V 8465 %P 675–690 %G eng %0 Book Section %B Handbook of the History of Logic %D 2014 %T Logics for the Semantic Web %A Pascal Hitzler %A Jens Lehmann %A Axel Polleres %E Dov. M. Gabbay %E John Woods %E Jörg Siekmann %B Handbook of the History of Logic %I Elsevier %V 9 %P 679-710 %G eng %0 Journal Article %J Dagstuhl Reports %D 2014 %T Neural-Symbolic Learning and Reasoning (Dagstuhl Seminar 14381) %A Artur S. d'Avila Garcez %A Marco Gori %A Pascal Hitzler %A Luís C. Lamb %B Dagstuhl Reports %V 4 %P 50–84 %G eng %U http://dx.doi.org/10.4230/DagRep.4.9.50 %R 10.4230/DagRep.4.9.50 %0 Conference Paper %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014 %D 2014 %T The OceanLink Project %A Thomas Narock %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Timothy Finin %A Pascal Hitzler %A Adila Krisnadhi %A Lisa Raymond %A Adam Shepherd %A Peter Wiebe %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014 %G eng %0 Conference Paper %B 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30, 2014 %D 2014 %T The OceanLink project %A Thomas Narock %A Robert Arko %A Suzanne Carbotte %A Adila Krisnadhi %A Pascal Hitzler %A Michelle Cheatham %A Adam Shepherd %A Cynthia Chandler %A Lisa Raymond %A Peter Wiebe %A Timothy Finin %E Jimmy Lin %E Jian Pei %E Xiaohua Hu %E Wo Chang %E Raghunath Nambiar %E Charu Aggarwal %E Nick Cercone %E Vasant Honavar %E Jun Huan %E Bamshad Mobasher %E Saumyadipta Pyne %X Today's scientific investigations are producing large numbers of scholarly products. These products continue to increase in diversity and complexity as researchers recognize that scholarly achievements are not only published articles but also datasets, software, and associated supporting materials. OceanLink is an online platform that addresses scholarly discovery and collaboration in the ocean sciences. The OceanLink project leverages Semantic Web technologies, web mining, and crowdsourcing to identify links between data centers, digital repositories, and professional societies to enhance discovery, enable collaboration, and begin to assess research contribution. %B 2014 IEEE International Conference on Big Data, Big Data 2014, Washington, DC, USA, October 27-30, 2014 %I {IEEE} %P 14-21 %8 10/2014 %@ 978-1-4799-5665-4 %G eng %U http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6973861 %R 10.1109/BigData.2014.7004347 %0 Conference Paper %B 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. %D 2014 %T An Ontology Design Pattern for Activity Reasoning %A Amin Abdalla %A Yingjie Hu %A David Carral %A Naicong Li %A Krzysztof Janowicz %K Activity %K Ontology Design Pattern %K OWL %X

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.

%B 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. %P 78–81 %G eng %U http://ceur-ws.org/Vol-1302/paper8.pdf %0 Conference Paper %B 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. %D 2014 %T An Ontology Design Pattern for Cooking Recipes - Classroom Created %A Monica Sam %A Adila Krisnadhi %A Cong Wang %A John C. Gallagher %A Pascal Hitzler %E de Boer, Victor %E Aldo Gangemi %E Krzysztof Janowicz %E Agnieszka Lawrynowicz %X We present a description and result of an ontology modeling process taken to the classroom. The application domain considered was cooking recipes. The modeling goal was to bridge heterogeneity across representational choices by developing a content ontology design pattern which is general enough to allow for the integration of information from different web sites. We will discuss the pattern developed, and report on corresponding insights and lessons learned. %B 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. %I CEUR-WS.org %V 1302 %P 49-60 %8 10/2014 %G eng %U http://ceur-ws.org/Vol-1302 %0 Conference Paper %B 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. %D 2014 %T An Ontology Design Pattern for Material Transformation %A Charles Vardeman %A Adila Krisnadhi %A Michelle Cheatham %A Krzysztof Janowicz %A Holly Ferguson %A Pascal Hitzler %A Aimee Buccellato %A Krishnaprasad Thirunarayan %A Gary Berg-Cross %A Torsten Hahmann %E de Boer, Victor %E Aldo Gangemi %E Krzysztof Janowicz %E Agnieszka Lawrynowicz %X In this work we discuss an ontology design pattern for material transformations. It models the relation between products, resources, and catalysts in the transformation process. Our axiomatization goes beyond a mere surface semantics. While we focus on the construction domain, the pattern can also be applied to chemistry and other domains. %B 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. %I CEUR-WS.org %V 1302 %P 73-77 %8 10/2014 %G eng %U http://ceur-ws.org/Vol-1302 %0 Conference Paper %B 19th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2014) %D 2014 %T Ontology Design Patterns for Large-Scale Data Interchange and Discovery %A Pascal Hitzler %E Krzysztof Janowicz %E Stefan Schlobach %E Patrick Lambrix %E Eero Hyvönen %B 19th International Conference on Knowledge Engineering and Knowledge Management (EKAW 2014) %I Springer %C Linköping, Sweden %V 8876 %P XIX-XX %G eng %0 Conference Paper %B Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142) %D 2014 %T Ontology Design Patterns for Ocean Science Data Discovery %A Pascal Hitzler %A Adila Krisnadhi %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Timothy Finin %A Krzysztof Janowicz %A Thomas Narock %A Lisa Raymond %A Adam Shepherd %A Peter Wiebe %E Aldo Gangemi %E Verena V. Hafner %E Werner Kuhn %E Simon Scheider %E Luc Steels %B Spatial reference in the Semantic Web and in Robotics (Dagstuhl Seminar 14142) %V 3 %G eng %N 4 %0 Report %D 2014 %T An Ontology Pattern for Oceanograhic Cruises: Towards an Oceanographer's Dream of Integrated Knowledge Discovery %A Adila Krisnadhi %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Timothy Finin %A Pascal Hitzler %A Krzysztof Janowicz %A Thomas Narock %A Lisa Raymond %A Adam Shepherd %A Peter Wiebe %X

EarthCube is a major effort of the National Science Foundation to establish a next-generation knowledge architecture for the broader geosciences. Data storage, retrieval, access, and reuse are central parts of this new effort. Currently, EarthCube is organized around several building blocks and research coordination networks. OceanLink is a semanticsenabled building block that aims at improving data retrieval and reuse via ontologies, Semantic Web technologies, and Linked Data for the ocean sciences. Cruises, in the sense of research expeditions, are central events for ocean scientists. Consequently, information about these cruises and the involved vessels has to be shared and made retrievable. For example, the ability to find cruises in the vicinity of physiographic features of interest, e.g., a hydrothermal vent field or a fracture zone, is of primary interest for oceanographers. In this paper, we use a design pattern-centric strategy to engineer ontologies for OceanLink. We provide a formal axiomatization of the introduced patterns and ontologies using the Web Ontology Language, explain design choices, discuss the re-usability of our models, and provide lessons learned for the future geo-ontologies.

%B OceanLink Technical Report %G eng %0 Conference Paper %B Ninth International Workshop on Ontology Matching %D 2014 %T The Properties of Property Alignment %A Michelle Cheatham %A Pascal Hitzler %B Ninth International Workshop on Ontology Matching %C Riva del Garda, Italy %G eng %0 Conference Paper %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014. %D 2014 %T Provenance Usage in the OceanLink Project %A Thomas Narock %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Douglas Fils %A Timothy Finin %A Pascal Hitzler %A Krzysztof Janowicz %A Matthew Jones %A Adila Krisnadhi %A Kerstin Lehnert %A Audrey Mickle %A Lisa Raymond %A Mark Schildhauer %A Adam Shepherd %A Peter Wiebe %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014. %G eng %0 Conference Paper %B The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part II %D 2014 %T Pushing the Boundaries of Tractable Ontology Reasoning %A David Carral %A Cristina Feier %A Cuenca Grau, Bernardo %A Pascal Hitzler %A Ian Horrocks %K description logics %K OWL %K Tractable Reasoning %X

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.

%B The Semantic Web - ISWC 2014 - 13th International Semantic Web Conference, Riva del Garda, Italy, October 19-23, 2014. Proceedings, Part II %P 148–163 %G eng %U http://dx.doi.org/10.1007/978-3-319-11915-1_10 %R 10.1007/978-3-319-11915-1_10 %0 Generic %D 2014 %T RASP-QS: Efficient and Confidential Query Services in the Cloud %A Zohreh Alavi %A Lu Zhou %A James Powers %A Keke Chen %C VLDB Endowment %G eng %R doi>10.14778/2733004.2733061 %0 Book Section %B Encyclopedia of Social Network Analysis and Mining %D 2014 %T Reasoning %A Cong Wang %A Pascal Hitzler %B Encyclopedia of Social Network Analysis and Mining %P 1499–1501 %G eng %U http://dx.doi.org/10.1007/978-1-4614-6170-8_115 %R 10.1007/978-1-4614-6170-8_115 %0 Journal Article %J AI Magazine %D 2014 %T Reports on the 2013 AAAI Fall Symposium Series %A Gully Burns %A Yolanda Gil %A Yan Liu %A Natalia Villanueva-Rosales %A Sebastian Risi %A Joel Lehman %A Jeff Clune %A Christian Lebiere %A Paul S. Rosenbloom %A Frank van Harmelen %A James A. Hendler %A Pascal Hitzler %A Krzysztof Janowicz %A Samarth Swarup %B AI Magazine %V 35 %P 69–74 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2538 %0 Conference Paper %B Semantic Technology, 4th Joint International Conference, JIST 2014 %D 2014 %T Revisiting default description logics – and their role in aligning ontologies %A Kunal Sengupta %A Pascal Hitzler %A Krzysztof Janowicz %E T. Supnithi %E T. Yamaguchi %E Jeff Z. Pan %E V. Wuwongse %E M. Buranarach %K default logic %K defaults %K description logics %K Ontology Alignment %X We present a new approach to extend the Web Ontology Language (OWL) with the capabilities to reason with defaults. This work improves upon the previously established results on integrating defaults with description logics (DLs), which were shown to be decidable only when the application of defaults is restricted to named individuals in the knowledge base. We demonstrate that the application of defaults (integrated with DLs) does not have to be restricted to named individuals to retain decidability and elaborate on the application of defaults in the context of ontology alignment and ontology-based systems. %B Semantic Technology, 4th Joint International Conference, JIST 2014 %I Lecture Notes in Computer Science, Springer %C Chiang Mai, Thailand %V 8943 %P 3-18 %8 11/2014 %G eng %R 10.1007/978-3-319-15615-6_1 %0 Conference Paper %B European Geosciences Union General Assembly 2014, Vienna, Austria, 27 April - 02 May 2014 %D 2014 %T Semantic Entity Pairing for Improved Data Validation and Discovery %A Adam Shepherd %A Cynthia Chandler %A Robert Arko %A Yanning Chen %A Adila Krisnadhi %A Pascal Hitzler %A Thomas Narock %A Robert Groman %A Shannon Rauch %X

One of the central incentives for linked data implementations is the opportunity to leverage the rich logic inherent in structured data. The logic embedded in semantic models can strengthen capabilities for data discovery and data validation when pairing entities from distinct, contextually-related datasets. The creation of links between the two datasets broadens data discovery by using the semantic logic to help machines compare similar entities and properties that exist on different levels of granularity. This semantic capability enables appropriate entity pairing without making inaccurate assertions as to the nature of the relationship. Entity pairing also provides a context to accurately validate the correctness of an entity's property values - an exercise highly valued by data management practices who seek to ensure the quality and correctness of their data. The Biological and Chemical Oceanography Data Management Office (BCO-DMO) semantically models metadata surrounding oceanographic researchcruises, but other sources outside of BCO-DMO exist that also model metadata about these same cruises. For BCO-DMO, the process of successfully pairing its entities to these sources begins by selecting sources that are decidedly trustworthy and authoritative for the modeled concepts. In this case, the Rolling Deck to Repository (R2R) program has a well-respected reputation among the oceanographic research community, presents a data context that is uniquely different and valuable, and semantically models its cruise metadata. Where BCO-DMO exposes the processed, analyzed data products generated by researchers, R2R exposes the raw shipboard data that was collected on the same research cruises. Interlinking these cruise entities expands data discovery capabilities but also allows for validating the contextual correctness of both BCO-DMO's and R2R's cruise metadata. Assessing the potential for a link between two datasets for a similar entity consists of aligning like properties and deciding on the appropriate semantic markup to describe the link. This highlights the desire for research organizations like BCO-DMO and R2R to ensure the complete accuracy of their exposed metadata, as it directly reflects on their reputations as successful and trustworthy source of research data. Therefore, data validation reaches beyond simple syntax of property values into contextual correctness. As a human process, this is a time-intensive task that does not scale well for finite human and funding resources. Therefore, to assess contextual correctness across datasets at different levels of granularity, BCO-DMO is developing a system that employs semantic technologies to aid the human process by organizing potential links and calculating a confidence coefficient as to the correctness of the potential pairing based on the distance between certain entity property values. The system allows humans to quickly scan potential links and their confidence coefficients for asserting persistence and correcting and investigating misaligned entity property values.

%B European Geosciences Union General Assembly 2014, Vienna, Austria, 27 April - 02 May 2014 %V 16 %P 2476 %8 05/2014 %G eng %0 Book Section %B Computing Handbook, Third Edition: Computer Science and Software Engineering %D 2014 %T Semantic Web %A Pascal Hitzler %A Krzysztof Janowicz %E Allen Tucker %E Teofilo Gonzalez %E Jorge Diaz-Herrera %B Computing Handbook, Third Edition: Computer Science and Software Engineering %7 3 %I Chapman and Hall/CRC %V I %P 50-1 - 50-13 %G eng %0 Journal Article %J Applied Ontology %D 2014 %T Semantic Web and Big Data meets Applied Ontology - The Ontology Summit 2014 %A Leo Obrst %A Michael Grüninger %A Ken Baclawski %A Mike Bennett %A Dan Brickley %A Gary Berg-Cross %A Pascal Hitzler %A Krzysztof Janowicz %A Christine Kapp %A Oliver Kutz %A Christoph Lange %A Anatoly Levenchuk %A Francesca Quattri %A Alan Rector %A Todd Schneider %A Simon Spero %A Anne Thessen %A Marcela Vegetti %A Amanda Vizedom %A Andrea Westerinen %A Matthew West %A Peter Yim %B Applied Ontology %V 9 %P 155–170 %G eng %U http://dx.doi.org/10.3233/AO-140135 %R 10.3233/AO-140135 %0 Journal Article %J IET Communications %D 2014 %T Transmission of data with orthogonal frequency division multiplexing technique for communication networks using GHz frequency band soliton carrier %A Amiri, IS %A Ebrahimi, Monireh %A Yazdavar, Amir Hossein %A Ghorbani, S %A Alavi, SE %A Idrus, Sevia M %A Ali, J %B IET Communications %V 8 %P 1364–1373 %G eng %0 Conference Paper %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014 %D 2014 %T Using Linked Open Data and Semantic Integration to Search Across Geoscience Repositories. %A Lisa Raymond %A Adam Shepherd %A Robert Arko %A Suzanne Carbotte %A Cynthia Chandler %A Michelle Cheatham %A Douglas Fils %A Pascal Hitzler %A Krzysztof Janowicz %A Matthew Jones %A Adila Krisnadhi %A Kerstin Lehnert %A Audrey Mickle %A Thomas Narock %A Mark Schildhauer %A Peter Wiebe %B American Geophysical Union Fall Meeting, San Francisco, 15-19 December 2014 %G eng %0 Book Section %B Encyclopedia of Social Network Analysis and Mining %D 2014 %T Web Ontology Language (OWL) %A Kunal Sengupta %A Pascal Hitzler %E Reda Alhajj %E Jon Rokna %B Encyclopedia of Social Network Analysis and Mining %P 2374–2378 %G eng %0 Conference Paper %B Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014. %D 2014 %T Is Your Ontology as Hard as You Think? Rewriting Ontologies into Simpler DLs %A David Carral %A Cristina Feier %A Ana Armas Romero %A Cuenca Grau, Bernardo %A Pascal Hitzler %A Ian Horrocks %K description logics %K OWL %K Tractable Reasoning %X

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.

%B Informal Proceedings of the 27th International Workshop on Description Logics, Vienna, Austria, July 17-20, 2014. %P 128–140 %G eng %U http://ceur-ws.org/Vol-1193/paper_75.pdf %0 Conference Paper %B 2013 IEEE/WIC/ACM International Conferences on Web Intelligence, WI 2013 %D 2013 %T Automatic Domain Identification for Linked Open Data %A Sarasi Lalithsena %A Pascal Hitzler %A Amit Sheth %A Prateek Jain %K dataset search %K Domain Identification %K Linked Open Data Cloud %X

Linked Open Data (LOD) has emerged as one of the largest collections of interlinked structured datasets on the Web. Although the adoption of such datasets for applications is increasing, identifying relevant datasets for a specific task or topic is still challenging. As an initial step to make such identification easier, we provide an approach to automatically identify the topic domains of given datasets. Our method utilizes existing knowledge sources, more specifically Freebase, and we present an evaluation which validates the topic domains we can identify with our system. Furthermore, we evaluate the effectiveness of identified topic domains for the purpose of finding relevant datasets, thus showing that our approach improves reusability of LOD datasets.

%B 2013 IEEE/WIC/ACM International Conferences on Web Intelligence, WI 2013 %C Atlanta, GA, USA %P 205–212 %G eng %U http://dx.doi.org/10.1109/WI-IAT.2013.206 %R 10.1109/WI-IAT.2013.206 %0 Conference Paper %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %D 2013 %T Bridging KR and Machine Learning %A Pascal Hitzler %A Lise Getoor %E Natasha Noy %E Deborah McGuinness %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %C Arlington, VA %G eng %0 Conference Paper %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %D 2013 %T Bridging open-world knowledge and closed-world data %A Pascal Hitzler %E Natasha Noy %E Deborah McGuinness %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %C Arlington, VA %G eng %0 Journal Article %J ACM Trans. Comput. Log. %D 2013 %T Complexities of Horn Description Logics %A Markus Krötzsch %A Sebastian Rudolph %A Pascal Hitzler %K computational complexity %K description logics %K Horn logic %X Description Logics (DLs) have become a prominent paradigm for representing knowledge bases in a variety of application areas. Central to leveraging them for corresponding systems is the provision of a favourable balance between expressivity of the knowledge representation formalism on the one hand, and runtime performance of reasoning algorithms on the other. Due to this, Horn description logics (Horn DLs) have attracted attention since their (worst-case) data complexities are in general lower than their overall (i.e. combined) complexities, which makes them attractive for reasoning with large sets of instance data (ABoxes). However, the natural question whether Horn DLs also provide advantages for schema (TBox) reasoning has hardly been addressed so far. In this paper, we therefore provide a thorough and comprehensive analysis of the combined complexities of Horn DLs. While the combined complexity for many Horn DLs studied herein turns out to be the same as for their non-Horn counterparts, we identify subboolean DLs where Hornness simplifies reasoning. We also provide convenient normal forms for Horn DLs. %B ACM Trans. Comput. Log. %V 14 %P 2 %G eng %U http://doi.acm.org/10.1145/2422085.2422087 %R 10.1145/2422085.2422087 %0 Conference Paper %B Semantics for Big Data: Papers from the AAAI Symposium %D 2013 %T Crowdsourcing Semantics for Big Data in Geoscience Applications %A Tom Narock %A Pascal Hitzler %E Frank van Harmelen %E Jim Hendler %E Pascal Hitzler %E Krzysztof Janowicz %B Semantics for Big Data: Papers from the AAAI Symposium %C Arlington, Virginia %8 11/2013 %G eng %0 Conference Paper %B Proceedings of the 9th International Workshop on Scalable Semantic Web Knowledge Base Systems, co-located with the International Semantic Web Conference (ISWC 2013) %D 2013 %T DistEL: A Distributed EL+ Ontology Classifier %A Raghava Mutharaju %A Pascal Hitzler %A Prabhaker Mateti %E Thorsten Liebig %E Achille Fokoue %K Classification %K DistEL %K Distributed Reasoning %K EL+ %K OWL %K Scalability %X OWL 2 EL ontologies are used to model and reason over data from diverse domains such as biomedicine, geography and road traffic. Data in these domains is increasing at a rate quicker than the increase in main memory and computation power of a single machine. Recent efforts in OWL reasoning algorithms lead to the decrease in classification time from several hours to a few seconds even for large ontologies like SNOMED CT. This is especially true for ontologies in the description logic EL+ (a fragment of the OWL 2 EL profile). Reasoners such as Pellet, Hermit, ELK etc. make an assumption that the ontology would fit in the main memory, which is unreasonable given projected increase in data volumes. Increase in the data volume also necessitates an increase in the computation power. This lead us to the use of a distributed system, so that memory and computation requirements can be spread across machines. We present a distributed system for the classification of EL+ ontologies along with some results on its scalability and performance. %B Proceedings of the 9th International Workshop on Scalable Semantic Web Knowledge Base Systems, co-located with the International Semantic Web Conference (ISWC 2013) %I CEUR-WS.org %C Sydney, Australia %V 1046 %P 17-32 %8 10/2013 %0 Conference Paper %B Proceedings of the ISWC 2013 Posters & Demonstrations Track %D 2013 %T D-SPARQ: Distributed, Scalable and Efficient RDF Query Engine %A Raghava Mutharaju %A Sherif Sakr %A Alessandra Sala %A Pascal Hitzler %E Eva Blomqvist %E Tudor Groza %K D-SPARQ %K Distributed Querying %K Scalable RDF querying %K SPARQL %X

We present D-SPARQ, a distributed RDF query engine that combines the MapReduce processing framework with a NoSQL distributed data store, MongoDB. The performance of processing SPARQL queries mainly depends on the efficiency of handling the join operations between the RDF triple patterns. Our system features two unique characteristics that enable efficiently tackling this challenge: 1) Identifying specific patterns of the input queries that enable improving the performance by running different parts of the query in a parallel mode. 2) Using the triple selectivity information for reordering the individual triples of the input query within the identified query patterns. The preliminary results demonstrate the scalability and efficiency of our distributed RDF query engine.

%B Proceedings of the ISWC 2013 Posters & Demonstrations Track %I CEUR-WS.org %C Sydney, Australia %V 1035 %P 261–264 %G eng %U http://ceur-ws.org/Vol-1035/iswc2013_poster_21.pdf %0 Conference Paper %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %D 2013 %T Editing R2RML Mappings Made Easy %A Kunal Sengupta %A Peter Haase %A Michael Schmidt %A Pascal Hitzler %E Eva Blomqvist %E Tudor Groza %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %I CEUR-WS.org %V 1035 %P 101–104 %G eng %0 Conference Paper %B Spatial Information Theory - 11th International Conference, COSIT 2013, Scarborough, UK, September 2-6, 2013. Proceedings %D 2013 %T A Geo-ontology Design Pattern for Semantic Trajectories %A Yingjie Hu %A Krzysztof Janowicz %A David Carral %A Simon Scheider %A Werner Kuhn %A Gary Berg-Cross %A Pascal Hitzler %A Mike Dean %A Dave Kolas %K Ontology Design Pattern %K OWL %K Trajectory %X

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.

%B Spatial Information Theory - 11th International Conference, COSIT 2013, Scarborough, UK, September 2-6, 2013. Proceedings %P 438–456 %G eng %U http://dx.doi.org/10.1007/978-3-319-01790-7_24 %R 10.1007/978-3-319-01790-7_24 %0 Conference Paper %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %D 2013 %T Grand Challenge: From Big Data to Knowledge %A Pascal Hitzler %E Natasha Noy %E Deborah McGuinness %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %C Arlington, VA %G eng %0 Conference Paper %B NSF Workshop: Research Challenges and Opportunities in Knowledge Representation %D 2013 %T Knowledge Representation in the Big Data Age. %A Pascal Hitzler %B NSF Workshop: Research Challenges and Opportunities in Knowledge Representation %C Arlington, VA %G eng %0 Conference Paper %B 2013 American Geophysical Union Fall Meeting %D 2013 %T Leveraging Crowdsourcing and Linked Open Data for Geoscience Data Sharing and Discovery %A Thomas Narock %A Eric A. Rozell %A Pascal Hitzler %A Robert Arko %A Cynthia Chandler %A Brian D. Wilson %B 2013 American Geophysical Union Fall Meeting %C San Francisco, CA, USA %G eng %0 Conference Paper %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %D 2013 %T Lightweight KR %A Pascal Hitzler %E Natasha Noy %E Deborah McGuinness %B Final Report on the 2013 NSF Workshop on Research Challenges and Opportunities in Knowledge Representation %C Arlington, VA %G eng %0 Journal Article %J Semantic Web %D 2013 %T Linked Data, Big Data, and the 4th Paradigm %A Pascal Hitzler %A Krzysztof Janowicz %X It appears to be uncontroversial that Linked Data is part of the Big Data landscape. We even go a bit further and claim that Linked Data is an ideal testbed for researching some key Big Data challenges and to experience the 4th paradigm of science in action. %B Semantic Web %V 4 %P 233–235 %G eng %U http://dx.doi.org/10.3233/SW-130117 %R 10.3233/SW-130117 %0 Conference Paper %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %D 2013 %T Linked Scientometrics: Designing Interactive Scientometrics with Linked Data and Semantic Web Reasoning %A Grant McKenzie %A Krzysztof Janowicz %A Yingjie Hu %A Kunal Sengupta %A Pascal Hitzler %E Eva Blomqvist %E Tudor Groza %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %I CEUR-WS.org %V 1035 %P 53–56 %G eng %0 Conference Paper %B The Semantic Web - ISWC 2013 - 12th International Semantic Web Conference, Sydney, NSW, Australia, October 21-25, 2013, Proceedings, Part II %D 2013 %T A Linked-Data-Driven and Semantically-Enabled Journal Portal for Scientometrics %A Yingjie Hu %A Krzysztof Janowicz %A Grant McKenzie %A Kunal Sengupta %A Pascal Hitzler %E Harith Alani %E Lalana Kagal %E Achille Fokoue %E Paul T. Groth %E Chris Biemann %E Josiane Xavier Parreira %E Lora Aroyo %E Natasha F. Noy %E Chris Welty %E Krzysztof Janowicz %B The Semantic Web - ISWC 2013 - 12th International Semantic Web Conference, Sydney, NSW, Australia, October 21-25, 2013, Proceedings, Part II %I Springer %V 8219 %P 114–129 %G eng %0 Conference Paper %B The Semantic Web: Semantics and Big Data.10th Extended Semantic Web Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. %D 2013 %T Logical linked data compression %A Joshi, Amit Krishna %A Pascal Hitzler %A Dong, Guozhu %B The Semantic Web: Semantics and Big Data.10th Extended Semantic Web Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. %I Springer %P 170–184 %G eng %0 Journal Article %J Semantic Web %D 2013 %T The New Manuscript Review System for the Semantic Web Journal %A Pascal Hitzler %A Krzysztof Janowicz %A Kunal Sengupta %B Semantic Web %V 4 %P 117 %G eng %U http://dx.doi.org/10.3233/SW-130095 %R 10.3233/SW-130095 %0 Conference Paper %B The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings %D 2013 %T An Ontology Design Pattern for Cartographic Map Scaling %A David Carral %A Simon Scheider %A Krzysztof Janowicz %A Charles Vardeman %A Adila Krisnadhi %A Pascal Hitzler %E Philipp Cimiano %E Óscar Corcho %E Valentina Presutti %E Laura Hollink %E Sebastian Rudolph %K Map Scaling %K Ontology Design Patterns %K OWL %X

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.

%B The Semantic Web: Semantics and Big Data, 10th International Conference, ESWC 2013, Montpellier, France, May 26-30, 2013. Proceedings %I Springer %V 7882 %P 76–93 %G eng %U http://dx.doi.org/10.1007/978-3-642-38288-8_6 %R 10.1007/978-3-642-38288-8_6 %0 Conference Paper %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %D 2013 %T Optique 1.0: Semantic Access to Big Data: The Case of Norwegian Petroleum Directorate's FactPages %A Evgeny Kharlamov %A Martin Giese %A Ernesto Jiménez-Ruiz %A Martin G. Skjæveland %A Ahmet Soylu %A Dmitriy Zheleznyakov %A Timea Bagosi %A Marco Console %A Peter Haase %A Ian Horrocks %A Sarunas Marciuska %A Christoph Pinkel %A Mariano Rodriguez-Muro %A Marco Ruzzi %A Valerio Santarelli %A Domenico Fabio Savo %A Kunal Sengupta %A Michael Schmidt %A Evgenij Thorstensen %A Johannes Trame %A Arild Waaler %E Eva Blomqvist %E Tudor Groza %B Proceedings of the ISWC 2013 Posters & Demonstrations Track, Sydney, Australia, October 23, 2013 %I CEUR-WS.org %V 1035 %P 65–68 %G eng %0 Journal Article %J Semantic Web %D 2013 %T Paraconsistent OWL and Related Logics %A Frederick Maier %A Yue Ma %A Pascal Hitzler %K Automated Deduction %K Complexity %K Description Logic %K OWL %K Paraconsistency %K Semantic Web %K Web Ontology Language %X The Web Ontology Language OWL is currently the most prominent formalism for representing ontologies in Semantic Web applications. OWL is based on description logics, and automated reasoners are used to infer knowledge implicitly present in OWL ontologies. However, because typical description logics obey the classical principle of explosion, reasoning over inconsistent ontologies is impossible in OWL. This is so despite the fact that inconsistencies are bound to occur in many realistic cases, e.g., when multiple ontologies are merged or when ontologies are created by machine learning or data mining tools. In this paper, we present four-valued paraconsistent description logics which can reason over inconsistencies. We focus on logics corresponding to OWL DL and its profiles. We present the logic SROIQ4, showing that it is both sound relative to classical SROIQ and that its embedding into SROIQ is consequence preserving. We also examine paraconsistent varieties of EL++, DL-Lite, and Horn-DLs. The general framework described here has the distinct advantage of allowing classical reasoners to draw sound but nontrivial conclusions from even inconsistent knowledge bases. Truth-value gaps and gluts can also be selectively eliminated from models (by inserting additional axioms into knowledge bases). If gaps but not gluts are eliminated, additional classical conclusions can be drawn without affecting paraconsistency. %B Semantic Web %V 4 %P 395–427 %G eng %U http://dx.doi.org/10.3233/SW-2012-0066 %R 10.3233/SW-2012-0066 %0 Conference Proceedings %B Ninth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'13, at the 23rd International Joint Conference on Artificial Intelligence %D 2013 %T Proceedings of the Ninth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'13, at the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 2013 %E Artur S. d'Avila Garcez %E Pascal Hitzler %E Luís C. Lamb %B Ninth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'13, at the 23rd International Joint Conference on Artificial Intelligence %C Beijing, China %G eng %0 Journal Article %J Logic Journal of the IGPL %D 2013 %T Reasoning with Inconsistencies in Hybrid MKNF Knowledge Bases %A Shasha Huang %A Qingguo Li %A Pascal Hitzler %K Data complexity %K Description logics and rules %K Knowledge representation %K Non-monotonic reasoning %K Paraconsistent reasoning %X This paper is concerned with the handling of inconsistencies occurring in the combination of description logics and rules, especially in hybrid MKNF knowledge bases. More precisely, we present a paraconsistent semantics for hybrid MKNF knowledge bases (called para-MKNF knowledge bases) based on four-valued logic as proposed by Belnap. We also reduce this paraconsistent semantics to the stable model semantics via a linear transformation operator, which shows the relationship between the two semantics and indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide fixpoint operators to compute paraconsistent MKNF models, each suitable to different kinds of rules. At last we present the data complexity of instance checking in different paraMKNF knowledge bases. %B Logic Journal of the IGPL %V 21 %P 263–290 %G eng %U http://dx.doi.org/10.1093/jigpal/jzs043 %R 10.1093/jigpal/jzs043 %0 Conference Paper %B Proceedings of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence (WL4AI 2013) %D 2013 %T Scale reasoning with fuzzy-EL+ ontologies based on MapReduce %A Zhangquan Zhou %A Guilin Qi %A Chang Liu %A Pascal Hitzler %A Raghava Mutharaju %E Lluis Godo %E Henri Prade %E Guilin Qi %X

Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy or vague knowledge. In this paper, we consider the problem of reasoning with fuzzy-EL+, which is a fuzzy extension of EL+. We first identify the challenges and present revised completion classification rules for fuzzy-EL+ that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL+ ontologies using MapReduce. Some preliminary experimental results are provided to show the scalability of our algorithm.

%B Proceedings of the IJCAI-2013 Workshop on Weighted Logics for Artificial Intelligence (WL4AI 2013) %C Beijing, China %P 87-93 %G eng %0 Conference Proceedings %B AAAI Symposium on Semantics for Big Data %D 2013 %T Semantics for Big Data: Papers from the AAAI Symposium, November 15-17, 2013, Arlington, Virginia %E Frank van Harmelen %E James A. Hendler %E Pascal Hitzler %E Krzysztof Janowicz %B AAAI Symposium on Semantics for Big Data %C Arlington, Virginia, USA %G eng %0 Thesis %D 2013 %T Side Effects Recognition as Implicit Opinion Words in Drug Reviews %A Ebrahimi, Monireh %I Universiti Teknologi Malaysia %G eng %9 Master %0 Conference Paper %B Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013 %D 2013 %T SROIQ Syntax Approximation by Using Nominal Schemas %A Cong Wang %A David Carral %A Pascal Hitzler %B Informal Proceedings of the 26th International Workshop on Description Logics, Ulm, Germany, July 23 - 26, 2013 %P 988–999 %G eng %U http://ceur-ws.org/Vol-1014/paper_31.pdf %0 Conference Paper %B International Semantic Web Conference %D 2013 %T String Similarity Metrics for Ontology Alignment %A Michelle Cheatham %A Pascal Hitzler %X

 

%B International Semantic Web Conference %I Springer %C Sydney, Australia %G eng %0 Conference Paper %B 8th International Workshop on Ontology Matching %D 2013 %T StringsAuto and MapSSS Results for OAEI 2013 %A Michelle Cheatham %A Pascal Hitzler %B 8th International Workshop on Ontology Matching %C Sydney, Australia %G eng %0 Report %D 2013 %T There’s No Money in Linked Data %A Prateek Jain %A Pascal Hitzler %A Krzysztof Janowicz %A Chitra Venkatramani %X

Linked Data (LD) has been an active research area for more than 6 years and many aspects about publishing, retrieving, linking, and cleaning Linked Data have been investigated. There seems to be a broad and general agreement that in principle LD datasets can be very useful for solving a wide variety of problems ranging from practical industrial analytics to highly specific research problems. Having these notions in mind, we started exploring the use of notable LD datasets such as DBpedia, Freebase, Geonames and others for a commercial application. However, it turns out that using these datasets in realistic settings is not always easy. Surprisingly, in many cases the underlying issues are not technical but legal barriers erected by the LD data publishers. In this paper we argue that these barriers are often not justified, detrimental to both data publishers and users, and are often built without much consideration of their consequences.

%I DaSe Lab, Department of Computer Science and Engineering, Wright State University %C Dayton, OH, USA %G eng %0 Conference Paper %B ESAIR'13, Proceedings of the Sixth International Workshop on Exploiting Semantic Annotations in Information Retrieval, co-located with {CIKM} 2013, San Francisco, CA, USA, October 28, 2013 %D 2013 %T Thoughts on the Complex Relation Between Linked Data, Semantic Annotations, and Ontologies %A Krzysztof Janowicz %A Pascal Hitzler %E Paul N. Bennett %E Evgeniy Gabrilovich %E Jaap Kamps %E Jussi Karlgren %X The relation between data, annotations, and schemata seems straightforward at first: Data are annotated with additional meta information according to some schemata in order to expose additional non-intrinsic characteristics relevant to the meaningful interpretation of said data. However, on closer examination, things are not as simple. Focusing on geo-information retrieval, we will try to disentangle the aforementioned relations. We will report from our own experience and from observations gathered by editing papers about ontologies and Linked Data for the Semantic Web journal. %B ESAIR'13, Proceedings of the Sixth International Workshop on Exploiting Semantic Annotations in Information Retrieval, co-located with {CIKM} 2013, San Francisco, CA, USA, October 28, 2013 %I ACM %C San Francisco, CA %P 41–44 %G eng %U http://doi.acm.org/10.1145/2513204.2513218 %R 10.1145/2513204.2513218 %0 Conference Paper %B Web Reasoning and Rule Systems - 7th International Conference, {RR} 2013, Mannheim, Germany, July 27-29, 2013. Proceedings %D 2013 %T Towards an Efficient Algorithm to Reason over Description Logics Extended with Nominal Schemas %A David Carral %A Cong Wang %A Pascal Hitzler %K description logics %K EL++ %K Nominal Schemas %X

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.

%B Web Reasoning and Rule Systems - 7th International Conference, {RR} 2013, Mannheim, Germany, July 27-29, 2013. Proceedings %P 65–79 %G eng %U http://dx.doi.org/10.1007/978-3-642-39666-3_6 %R 10.1007/978-3-642-39666-3_6 %0 Book %D 2013 %T 语义Web技术基础 %A Pascal Hitzler %A Markus Krötzsch %A Sebastian Rudolph %? Yong Yu %? Guilin Qi %? Haofen Wang %? Chang Liu %I Tsinghua University Press %G eng %0 Book Section %B On the Move to Meaningful Internet Systems: OTM 2012 %D 2012 %T Alignment-based querying of linked open data %A Joshi, Amit Krishna %A Prateek Jain %A Pascal Hitzler %A Peter Z. Yeh %A Kunal Verma %A Amit Sheth %A Mariana Damova %B On the Move to Meaningful Internet Systems: OTM 2012 %I Springer %P 807–824 %G eng %0 Journal Article %J Dagstuhl Reports %D 2012 %T Cognitive Approaches for the Semantic Web (Dagstuhl Seminar 12221) %A Dedre Gentner %A Frank van Harmelen %A Pascal Hitzler %A Krzysztof Janowicz %A Kai-Uwe Kühnberger %B Dagstuhl Reports %V 2 %P 93–116 %G eng %U http://dx.doi.org/10.4230/DagRep.2.5.93 %R 10.4230/DagRep.2.5.93 %0 Conference Paper %B Semantic Web and Web Science - 6th Chinese Semantic Web Symposium and 1st Chinese Web Science Conference, CSWS 2012, Shenzhen, China, November 28-30, 2012. %D 2012 %T Consequence-Based Procedure for Description Logics with Self-Restriction %A Cong Wang %A Pascal Hitzler %B Semantic Web and Web Science - 6th Chinese Semantic Web Symposium and 1st Chinese Web Science Conference, CSWS 2012, Shenzhen, China, November 28-30, 2012. %P 169–180 %G eng %U http://dx.doi.org/10.1007/978-1-4614-6880-6_15 %R 10.1007/978-1-4614-6880-6_15 %0 Journal Article %J Semantic Web %D 2012 %T The Digital Earth as Knowledge Engine %A Krzysztof Janowicz %A Pascal Hitzler %X The Digital Earth aims at developing a digital representation of the planet. It is motivated by the need for integrating and interlinking vast geo-referenced, multi-thematic, and multi-perspective knowledge archives that cut through domain boundaries. Complex scientific questions cannot be answered from within one domain alone but span over multiple scientific disciplines. For instance, studying disease dynamics for prediction and policy making requires data and models from a diverse body of science ranging from medical science and epidemiology over geography and economics to mining the social Web. The naive assumption that such problems can simply be addressed by more data with a higher spatial, temporal, and thematic resolution fails as long as this more on data is not supported by more knowledge on how to combine and interpret the data. This makes semantic interoperability a core research topic of data-intensive science. While the Digital Earth vision includes processing services, it is, at its very core, a data archive and infrastructure. We propose to redefine the Digital Earth as a knowledge engine and discuss what the Semantic Web has to offer in this context and to Big Data in general. %B Semantic Web %V 3 %P 213–221 %G eng %U http://dx.doi.org/10.3233/SW-2012-0070 %R 10.3233/SW-2012-0070 %0 Conference Paper %B The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings %D 2012 %T Extending Description Logic Rules %A David Carral %A Pascal Hitzler %K description logics %K OWL %K Rules %X

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.

%B The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings %P 345–359 %G eng %U http://dx.doi.org/10.1007/978-3-642-30284-8_30 %R 10.1007/978-3-642-30284-8_30 %0 Conference Paper %B What will the Semantic Web look like 10 years from now? co-located with the 11th International Semantic Web Conference 2012 (ISWC 2012) %D 2012 %T How I Would Like Semantic Web To Be, For My Children %A Raghava Mutharaju %X

Semantic Web, since its inception, has gone through lot of developments in its relatively nascent existence; right from people’s perception, to the standards and to its adoption by the industry and more importantly by the scientific community. This impressive growth only seems to increase. In this paper, we project this growth to the next 10 years and highlight some of the facets on which Semantic Web could have a major impact on. We also present the challenges that Semantic Web and its community has to deal with in order to get there.

%B What will the Semantic Web look like 10 years from now? co-located with the 11th International Semantic Web Conference 2012 (ISWC 2012) %I CEUR-WS.org %C Boston, MA, USA %G eng %0 Conference Paper %B Proceedings of OWL: Experiences and Directions Workshop 2012, Heraklion, Crete, Greece, May 27-28, 2012 %D 2012 %T Integrating OWL and Rules: A Syntax Proposal for Nominal Schemas %A David Carral %A Adila Krisnadhi %A Pascal Hitzler %E Pavel Klinov %E Matthew Horridge %X 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. %B Proceedings of OWL: Experiences and Directions Workshop 2012, Heraklion, Crete, Greece, May 27-28, 2012 %I CEUR-WS.org %V 849 %8 05/2012 %G eng %U http://ceur-ws.org/Vol-849/paper_6.pdf %0 Conference Paper %B Advances in Conceptual Modeling - {ER} 2012 Workshops CMS, ECDM-NoCoDA, MoDIC, MORE-BI, RIGiM, SeCoGIS, WISM, Florence, Italy, October 15-18, 2012. Proceedings %D 2012 %T Key Ingredients For Your Next Semantics Elevator Talk %A Krzysztof Janowicz %A Pascal Hitzler %E Silvana Castano %E Panos Vassiliadis %E Laks V. S. Lakshmanan %E Mong-Li Lee %X

2012 brought a major change to the semantics research community. Discussions on the use and benefits of semantic technologies are shifting away from the why to the how. Surprisingly this more in stakeholder interest is not accompanied by a more detailed understanding of what semantics research is about. Instead of blaming others for their (wrong) expectations, we need to learn how to emphasize the paradigm shift proposed by semantics research while abstracting from technical details and advocate the added value in a way that relates to the immediate needs of individual stakeholders without overselling. This paper highlights some of the major ingredients to prepare your next Semantics Elevator Talk.

%B Advances in Conceptual Modeling - {ER} 2012 Workshops CMS, ECDM-NoCoDA, MoDIC, MORE-BI, RIGiM, SeCoGIS, WISM, Florence, Italy, October 15-18, 2012. Proceedings %I Springer %C Florence, Italy %V 7518 %P 213–220 %G eng %U http://dx.doi.org/10.1007/978-3-642-33999-8_27 %R 10.1007/978-3-642-33999-8_27 %0 Conference Paper %B Metadata Challenge at the 21st International Conference on World Wide Web (WWW 2012) %D 2012 %T Konf Connect %A David Carral %A Joshi, Amit Krishna %A Adila Krisnadhi %A Raghava Mutharaju %A Kunal Sengupta %A Cong Wang %X

We 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.

%B Metadata Challenge at the 21st International Conference on World Wide Web (WWW 2012) %C Lyon, France %G eng %0 Conference Paper %B SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012 %D 2012 %T A logical geo-ontology design pattern for quantifying over types %A David Carral %A Krzysztof Janowicz %A Pascal Hitzler %K Biodiversity %K description logics %K Ontology Design Patterns %K OWL %B SIGSPATIAL 2012 International Conference on Advances in Geographic Information Systems (formerly known as GIS), SIGSPATIAL'12, Redondo Beach, CA, USA, November 7-9, 2012 %P 239–248 %G eng %U http://doi.acm.org/10.1145/2424321.2424352 %R 10.1145/2424321.2424352 %0 Conference Paper %B 23rd ACM Conference on Hypertext and Social Media, HT '12 %D 2012 %T Moving beyond SameAs with PLATO: Partonomy detection for Linked Data %A Prateek Jain %A Pascal Hitzler %A Kunal Verma %A Peter Z. Yeh %A Amit Sheth %E Ethan V. Munson %E Markus Strohmaier %K Linked Open Data Cloud %K Mereology %K Part of Relation %X

The Linked Open Data (LOD) Cloud has gained significant traction over the past few years. With over 275 interlinked datasets across diverse domains such as life science, geography, politics, and more, the LOD Cloud has the potential to support a variety of applications ranging from open domain question answering to drug discovery.

Despite its significant size (approx. 30 billion triples), the data is relatively sparely interlinked (approx. 400 million links). A semantically richer LOD Cloud is needed to fully realize its potential. Data in the LOD Cloud are currently interlinked mainly via the owl:sameAs property, which is inadequate for many applications. Additional properties capturing relations based on causality or partonomy are needed to enable the answering of complex questions and to support applications.

In this paper, we present a solution to enrich the LOD Cloud by automatically detecting partonomic relationships, which are well-established, fundamental properties grounded in linguistics and philosophy. We empirically evaluate our solution across several domains, and show that our approach performs well on detecting partonomic properties between LOD Cloud data.

%B 23rd ACM Conference on Hypertext and Social Media, HT '12 %I ACM %C Milwaukee, WI, USA %P 33–42 %G eng %U http://doi.acm.org/10.1145/2309996.2310004 %R 10.1145/2309996.2310004 %0 Journal Article %J Learned Publishing %D 2012 %T Open and transparent: the review process of the Semantic Web journal %A Krzysztof Janowicz %A Pascal Hitzler %X

While open access is established in the world of academic publishing, open reviews are rare. The Semantic Web journal goes further than just open review by implementing an open and transparent review process in which reviews are publicly available, the assigned editors and reviewers are known by name, and are published together with accepted manuscripts. In this article we introduce the steps to realize such a process from the conceptual design, over the implementation, a overview of the results so far, and up to lessons learned.

%B Learned Publishing %V 25 %P 48-55 %G eng %N 1 %0 Web Page %D 2012 %T OWL 2 Web Ontology Language: Primer (Second Edition) %A Pascal Hitzler %A Markus Krötzsch %A Bijan Parsia %A Peter F. Patel-Schneider %A Sebastian Rudolph %P W3C Recommendation %8 12/11/2012 %G eng %U http://www.w3.org/TR/owl2-primer %0 Conference Proceedings %B Eighth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'12, at the 26th Conference on Artificial Intelligence, AAAI-12 %D 2012 %T Proceedings of the Eighth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'12, at the 26th Conference on Artificial Intelligence, AAAI-12, Toronto, Canada, July 2012 %E Artur S. d'Avila Garcez %E Pascal Hitzler %E Luís C. Lamb %B Eighth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'12, at the 26th Conference on Artificial Intelligence, AAAI-12 %C Toronto, Canada %G eng %0 Generic %D 2012 %T Reasoning Approaches for Nominal Schemas %A Cong Wang %A Adila Krisnadhi %A David Carral %A Pascal Hitzler %I JIST %C Nara, Japan %V Poster and Demonstration Proceedings %0 Conference Paper %B ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track %D 2012 %T Reasoning with Fuzzy-EL+ Ontologies Using MapReduce %A Zhangquan Zhou %A Guilin Qi %A Chang Liu %A Pascal Hitzler %A Raghava Mutharaju %E Luc De Raedt %E Christian Bessière %E Didier Dubois %E Patrick Doherty %E Paolo Frasconi %E Fredrik Heintz %E Peter J. F. Lucas %X

Fuzzy extension of Description Logics (DLs) allows the formal representation and handling of fuzzy knowledge. In this paper, we consider fuzzy-EL+, which is a fuzzy extension of EL+. We first present revised completion rules for fuzzy-EL+ that can be handled by MapReduce programs. We then propose an algorithm for scale reasoning with fuzzy-EL+ ontologies based on MapReduce.

%B ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track %I IOS Press %C Montpellier, France %V 242 %P 933–934 %G eng %U http://dx.doi.org/10.3233/978-1-61499-098-7-933 %R 10.3233/978-1-61499-098-7-933 %0 Conference Paper %B Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings %D 2012 %T Recent Advances in Integrating OWL and Rules %A Matthias Knorr %A David Carral %A Pascal Hitzler %A Adila Krisnadhi %A Frederick Maier %A Cong Wang %E Markus Krötzsch %E Umberto Straccia %K description logics %K OWL %K Rules %X 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. %B Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings %I Springer %C Austria, Vienna %V 7497 %P 225-228 %8 09/2012 %G eng %U http://dx.doi.org/10.1007/978-3-642-33203-6_20 %R 10.1007/978-3-642-33203-6_20 %0 Conference Paper %B ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track %D 2012 %T Reconciling OWL and Non-monotonic Rules for the Semantic Web %A Matthias Knorr %A Pascal Hitzler %A Frederick Maier %E Luc De Raedt %E Christian Bessière %E Didier Dubois %E Patrick Doherty %E Paolo Frasconi %E Fredrik Heintz %E Peter J. F. Lucas %X

We propose a description logic extending SROIQ (the description logic underlying OWL 2 DL) and at the same time encompassing some of the most prominent monotonic and nonmonotonic rule languages, in particular Datalog extended with the answer set semantics. Our proposal could be considered a substantial contribution towards fulfilling the quest for a unifying logic for the Semantic Web. As a case in point, two non-monotonic extensions of description logics considered to be of distinct expressiveness until now are covered in our proposal. In contrast to earlier such proposals, our language has the “look and feel” of a description logic and avoids hybrid or first-order syntaxes.

%B ECAI 2012 - 20th European Conference on Artificial Intelligence. Including Prestigious Applications of Artificial Intelligence (PAIS-2012) System Demonstrations Track %I IOS Press %C Montpellier, France %V 242 %P 474–479 %G eng %U http://dx.doi.org/10.3233/978-1-61499-098-7-474 %R 10.3233/978-1-61499-098-7-474 %0 Journal Article %J AI Magazine %D 2012 %T Reports of the AAAI 2012 Conference Workshops %A Vikas Agrawal %A Jorge Baier %A Kostas E. Bekris %A Yiling Chen %A Artur S. d'Avila Garcez %A Pascal Hitzler %A Patrik Haslum %A Dietmar Jannach %A Edith Law %A Freddy Lécué %A Luís C. Lamb %A Cynthia Matuszek %A Héctor Palacios %A Biplav Srivastava %A Lokendra Shastri %A Nathan R. Sturtevant %A Roni Stern %A Stefanie Tellex %A Stavros Vassos %B AI Magazine %V 33 %P 119–127 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2444 %0 Journal Article %J AI Magazine %D 2012 %T Reports of the AAAI 2012 Conference Workshops %A Vikas Agrawal %A Jorge Baier %A Kostas E. Bekris %A Yiling Chen %A Artur S. d'Avila Garcez %A Pascal Hitzler %A Patrik Haslum %A Dietmar Jannach %A Edith Law %A Freddy Lécué %A Luís C. Lamb %A Cynthia Matuszek %A Héctor Palacios %A Biplav Srivastava %A Lokendra Shastri %A Nathan R. Sturtevant %A Roni Stern %A Stefanie Tellex %A Stavros Vassos %B AI Magazine %V 33 %P 119-127 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2444 %N 4 %0 Conference Paper %B Semantic Technology, Second Joint International Conference, JIST 2012, Nara, Japan, December 2-4, 2012. Proceedings %D 2012 %T A Resolution Procedure for Description Logics with Nominal Schemas %A Cong Wang %A Pascal Hitzler %B Semantic Technology, Second Joint International Conference, JIST 2012, Nara, Japan, December 2-4, 2012. Proceedings %P 1–16 %G eng %U http://dx.doi.org/10.1007/978-3-642-37996-3_1 %R 10.1007/978-3-642-37996-3_1 %0 Report %D 2012 %T Semantic Aspects of EarthCube %A Pascal Hitzler %A Krzysztof Janowicz %A Gary Berg-Cross %A Leo Obrst %A Amit Sheth %A Timothy Finin %A Isabel Cruz %X

In this document, we give a high-level overview of selected Semantic (Web) technologies, methods, and other important considerations, that are relevant for the success of EarthCube. The goal of this initial document is to provide entry points and references for discussions between the Semantic Technologies experts and the domain experts within EarthCube. The selected topics are intended to ground the EarthCube roadmap in the state of the art in semantics research and ontology engineering.

We anticipate that this document will evolve as EarthCube progresses. Indeed, all EarthCube parties are asked to provide topics of importance that should be treated in future versions of this document.

%B EarthCube report of the Technology Subcommittee of the EarthCube Semantics and Ontologies Group %G eng %0 Conference Paper %B Workshop on GIScience in the Big Data Age, In conjunction with the seventh International Conference on Geographic Information Science 2012 (GIScience 2012) %D 2012 %T Semantics and Ontologies for EarthCube %A Gary Berg-Cross %A Isabel Cruz %A Mike Dean %A Tim Finin %A Mark Gahegan %A Pascal Hitzler %A Hook Hua %A Krzysztof Janowicz %A Naicong Li %A Philip Murphy %A Bryce Nordgren %A Leo Obrst %A Mark Schildhauer %A Amit Sheth %A Krishna Sinha %A Anne Thessen %A Nancy Wiegand %A Ilya Zaslavsky %E Krzysztof Janowicz %E C. Kessler %E T. Kauppinen %E Dave Kolas %E Simon Scheider %X

Semantic technologies and ontologies play an increasing role in scientific workflow systems and knowledge infrastructures. While ontologies are mostly used for the semantic annotation of metadata, semantic technologies enable searching metadata catalogs beyond simple keywords, with some early evidence of semantics used for data translation. However, the next generation of distributed and interdisciplinary knowledge infrastructures will require capabilities beyond simple subsumption reasoning over subclass relations. In this work, we report from the EarthCube Semantics Community by highlighting which role semantics and ontologies should play in the EarthCube knowledge infrastructure. We target the interested domain scientist and, thus, introduce the value proposition of semantic technologies in a non-technical language. Finally, we commit ourselves to some guiding principles for the successful implementation and application of semantic technologies and ontologies within EarthCube.

%B Workshop on GIScience in the Big Data Age, In conjunction with the seventh International Conference on Geographic Information Science 2012 (GIScience 2012) %C Columbus, Ohio, USA %G eng %0 Conference Paper %B Web Reasoning and Rule Systems, 6th International Conference, RR2012, Vienna, Austria, September 10-12, 2012, Proceedings %D 2012 %T A Tableau Algorithm for Description Logics with Nominal Schemas %A Adila Krisnadhi %A Pascal Hitzler %E Markus Krötzsch %E Umberto Straccia %X

We present a tableau algorithm for the description logic ALCOV. This description logic is obtained by extending the description logic ALCO with the expressive nominal schema construct that enables DL-safe datalog with predicates of arbitrary arity to be covered within the description logic framework. The tableau algorithm provides a basis to implement a delayed grounding strategy which was not facilitated by earlier versions of decision procedures for satisfiability in expressive description logics with nominal schemas.

%B Web Reasoning and Rule Systems, 6th International Conference, RR2012, Vienna, Austria, September 10-12, 2012, Proceedings %I Springer %V 7497 %P 234-237 %8 09/2012 %G eng %R 10.1007/978-3-642-33203-6_22 %0 Conference Paper %B Proceedings of the Joint Workshop on Large and Heterogeneous Data and Quantitative Formalization in the Semantic Web, LHD+ SemQuant2012, at the 11th International Semantic Web Conference, ISWC2012 %D 2012 %T Towards logical linked data compression %A Joshi, Amit Krishna %A Pascal Hitzler %A Dong, Guozhu %B Proceedings of the Joint Workshop on Large and Heterogeneous Data and Quantitative Formalization in the Semantic Web, LHD+ SemQuant2012, at the 11th International Semantic Web Conference, ISWC2012 %G eng %0 Journal Article %J Logical Methods in Computer Science %D 2012 %T Type-Elimination-Based Reasoning for the Description Logic SHIQbs using Decision Diagrams and Disjunctive Datalog %A Sebastian Rudolph %A Markus Krötzsch %A Pascal Hitzler %K datalog %K decision diagrams %K description logics %K type elimination %X We propose a novel, type-elimination-based method for standard reasoning in the description logic SHIQbs extended by DL-safe rules. To this end, we first establish a knowledge compilation method converting the terminological part of an ALCIb knowledge base into an ordered binary decision diagram (OBDD) that represents a canonical model. This OBDD can in turn be transformed into disjunctive Datalog and merged with the assertional part of the knowledge base in order to perform combined reasoning. In order to leverage our technique for full SHIQbs, we provide a stepwise reduction from SHIQbs to ALCIb that preserves satisfiability and entailment of positive and negative ground facts. The proposed technique is shown to be worst-case optimal w.r.t. combined and data complexity. %B Logical Methods in Computer Science %V 8 %G eng %U http://dx.doi.org/10.2168/LMCS-8(1:12)2012 %R 10.2168/LMCS-8(1:12)2012 %0 Conference Paper %B 11th International Semantic Web Conference (ISWC 2012), Proceedings, Part II %D 2012 %T Very Large Scale OWL Reasoning through Distributed Computation %A Raghava Mutharaju %E Philippe Cudré-Mauroux %E Jeff Heflin %E Evren Sirin %E Tania Tudorache %E Jérôme Euzenat %E Manfred Hauswirth %E Josiane Xavier Parreira %E James A. Hendler %E Guus Schreiber %E Abraham Bernstein %E Eva Blomqvist %K Distributed Reasoning %K Ontology Classification %K OWL EL %X

Due to recent developments in reasoning algorithms of the various OWL profiles, the classification time for an ontology has come down drastically. For all of the popular reasoners, in order to process an ontology, an implicit assumption is that the ontology should fit in primary memory. The memory requirements for a reasoner are already quite high, and considering the ever increasing size of the data to be processed and the goal of making reasoning Web scale, this assumption becomes overly restrictive. In our work, we study several distributed classification approaches for the description logic EL+ (a fragment of OWL 2 EL profile). We present the lessons learned from each approach, our current results, and plans for future work.

%B 11th International Semantic Web Conference (ISWC 2012), Proceedings, Part II %I Springer %C Boston, MA, USA %V 7650 %P 407–414 %G eng %U http://dx.doi.org/10.1007/978-3-642-35173-0_30 %R 10.1007/978-3-642-35173-0_30 %0 Conference Paper %B Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011 %D 2011 %T A Better Uncle for OWL: Nominal Schemas for Integrating Rules and Ontologies %A Markus Krötzsch %A Frederick Maier %A Adila Krisnadhi %A Pascal Hitzler %E Sadagopan Srinivasan %E Krithi Ramamritham %E Arun Kumar %E M. P. Ravindra %E Elisa Bertino %E Ravi Kumar %K datalog %K Description Logic %K Semantic Web Rule Language %K SROIQ %K tractability %K Web Ontology Language %X We 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. %B Proceedings of the 20th International Conference on World Wide Web, WWW 2011, Hyderabad, India, March 28 - April 1, 2011 %I ACM %P 645-654 %8 03/2011 %@ 978-1-4503-0632-4 %G eng %U http://doi.acm.org/10.1145/1963405.1963496 %R 10.1145/1963405.1963496 %0 Journal Article %J Journal of Logic and Computation %D 2011 %T Computing Inconsistency Measure based on Paraconsistent Semantics %A Yue Ma %A Guilin Qi %A Pascal Hitzler %X

Measuring inconsistency in knowledge bases has been recognized as an important problem in several research areas. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. However, existing methods suffer from two limitations: 1) They are mostly restricted to propositional knowledge bases; 2) Very few of them discuss computational aspects of computing inconsistency measures. In this paper, we try to solve these two limitations by exploring algorithms for computing an inconsistency measure of first-order knowledge bases. After introducing a four-valued semantics for first-order logic, we define an inconsistency measure of a first-order knowledge base, which is a sequence of inconsistency degrees. We then propose a precise algorithm to compute our inconsistency measure. We show that this algorithm reduces the computation of the inconsistency measure to classical satisfiability checking. This is done by introducing a new semantics, named S[n]-4 semantics, which can be calculated by invoking a classical SAT solver. Moreover, we show that this auxiliary semantics also gives a direct way to compute upper and lower bounds of inconsistency degrees. That is, it can be easily revised to compute approximating inconsistency measures. The approximating inconsistency measures converge to the precise values if enough resources are available. Finally, by some nice properties of the S[n]-4 semantics, we show that some upper and lower bounds can be computed in P-time, which says that the problem of computing these approximating inconsistency measures is tractable.

%B Journal of Logic and Computation %V 21 %P 1257–1281 %G eng %U http://dx.doi.org/10.1093/logcom/exq053 %N 6 %R 10.1093/logcom/exq053 %0 Conference Paper %B The Semantic Web: Research and Applications - 8th Extended Semantic Web Conference, ESWC 2011 %D 2011 %T Contextual Ontology Alignment of LOD with an Upper Ontology: A Case Study with Proton %A Prateek Jain %A Peter Z. Yeh %A Kunal Verma %A Reymonrod G. Vasquez %A Mariana Damova %A Pascal Hitzler %A Amit Sheth %E Grigoris Antoniou %E Marko Grobelnik %E Elena Paslaru Bontas Simperl %E Bijan Parsia %E Dimitris Plexousakis %E Pieter De Leenheer %E Jeff Z. Pan %X

The Linked Open Data (LOD) is a major milestone towards realizing the Semantic Web vision, and can enable applications such as robust Question Answering (QA) systems that can answer queries requiring multiple, disparate information sources. However, realizing these applications requires relationships at both the schema and instance level, but currently the LOD only provides relationships for the latter. To address this limitation, we present a solution for automatically finding schema-level links between two LOD ontologies – in the sense of ontology alignment. Our solution, called BLOOMS+, extends our previous solution (i.e. BLOOMS) in two significant ways. BLOOMS+ 1) uses a more sophisticated metric to determine which classes between two ontologies to align, and 2) considers contextual information to further support (or reject) an alignment. We present a comprehensive evaluation of our solution using schema-level mappings from LOD ontologies to Proton (an upper level ontology) – created manually by human experts for a real world application called FactForge. We show that our solution performed well on this task. We also show that our solution significantly outperformed existing ontology alignment solutions (including our previously published work on BLOOMS) on this same task.

%B The Semantic Web: Research and Applications - 8th Extended Semantic Web Conference, ESWC 2011 %I Springer %C Heraklion, Crete, Greece %V 6643 %P 80–92 %G eng %U http://dx.doi.org/10.1007/978-3-642-21034-1_6 %R 10.1007/978-3-642-21034-1_6 %0 Journal Article %J Artificial Intelligence %D 2011 %T Local Closed World Reasoning with Description Logics under the Well-Founded Semantics %A Matthias Knorr %A José Júlio Alferes %A Pascal Hitzler %K Description Logic %K Knowledge representation %K Logic Programming %K Non-monotonic reasoning %K Ontologies %K Semantic Web %X

An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One of the most mature proposals for this combination is known as hybrid MKNF knowledge bases [52], and it is based on an adaptation of the Stable Model Semantics to knowledge bases consisting of ontology axioms and rules. In this paper we propose a well-founded semantics for nondisjunctive hybrid MKNF knowledge bases that promises to provide better efficiency of reasoning, and that is compatible with both the OWL-based semantics and the traditional Well-Founded Semantics for logic programs. Moreover, our proposal allows for the detection of inconsistencies, possibly occurring in tightly integrated ontology axioms and rules, with only little additional effort. We also identify tractable fragments of the resulting language.

%B Artificial Intelligence %V 175 %P 1528–1554 %G eng %U http://dx.doi.org/10.1016/j.artint.2011.01.007 %N 9-10 %R 10.1016/j.artint.2011.01.007 %0 Conference Paper %B Web Reasoning and Rule Systems - 5th International Conference, RR 2011, Galway, Ireland, August 29-30, 2011. Proceedings %D 2011 %T Local Closed World Semantics: Grounded Circumscription for Description Logics %A Adila Krisnadhi %A Kunal Sengupta %A Pascal Hitzler %E Sebastian Rudolph %E Claudio Gutierrez %X We present an improved local closed world extension for description logics. It is based on circumscription, and deviates from previous circumscriptive description logics in that extensions of minimized predicates may contain only extensions of named individuals in the knowledge base. Besides an (arguably) higher intuitive appeal, the improved semantics is applicable to expressive description logics without loss of decidability. %B Web Reasoning and Rule Systems - 5th International Conference, RR 2011, Galway, Ireland, August 29-30, 2011. Proceedings %I Springer %V 6902 %P 263-268 %8 08/2011 %@ 978-3-642-23579-5 %G eng %U http://dx.doi.org/10.1007/978-3-642-23580-1 %R 10.1007/978-3-642-23580-1 %0 Conference Paper %B The Semantic Web - ISWC 2011 - 10th International Semantic Web Conference, Bonn, Germany, October 23-27, 2011, Proceedings, Part I %D 2011 %T Local Closed World Semantics: Grounded Circumscription for OWL %A Kunal Sengupta %A Adila Krisnadhi %A Pascal Hitzler %E Lora Aroyo %E Chris Welty %E Harith Alani %E Jamie Taylor %E Abraham Bernstein %E Lalana Kagal %E Natasha F. Noy %E Eva Blomqvist %X We present a new approach to adding closed world reasoning to the Web Ontology Language OWL. It transcends previous work on circumscriptive description logics which had the drawback of yielding an undecidable logic unless severe restrictions were imposed. In particular, it was not possible, in general, to apply local closure to roles. In this paper, we provide a new approach, called grounded circumscription, which is applicable to SROIQ and other description logics around OWL without these restrictions. We show that the resulting language is decidable, and we derive an upper complexity bound. We also provide a decision procedure in the form of a tableaux algorithm. %B The Semantic Web - ISWC 2011 - 10th International Semantic Web Conference, Bonn, Germany, October 23-27, 2011, Proceedings, Part I %I Springer %V 7031 %P 617-632 %8 10/2011 %G eng %R 10.1007/978-3-642-25073-6_39 %0 Conference Paper %B Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011 %D 2011 %T Local Closed World Semantics: Keep it simple, stupid! %A Adila Krisnadhi %A Kunal Sengupta %A Pascal Hitzler %E Riccardo Rosati %E Sebastian Rudolph %E Michael Zakharyaschev %K circumscription %K closed world %K decidability %K Description Logic %X A 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. %B Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011 %I CEUR-WS.org %V 745 %8 07/2011 %G eng %U http://ceur-ws.org/Vol-745/paper_12.pdf %0 Book %D 2011 %T Logik und Logikprogrammierung Band 2: Aufgaben und Lösungen %A Steffen Hölldobler %A Sebastian Bader %A Bertram Fronhöfer %A Ursula Hans %A Pascal Hitzler %A Markus Krötzsch %A Tobias Pietzsch %I Synchron Verlag %C Heidelberg, Germany %G eng %0 Conference Paper %B 6th International Workshop on Ontology Matching %D 2011 %T MapSSS Results for OAEI 2011 %A Michelle Cheatham %B 6th International Workshop on Ontology Matching %C Bonn, Germany %G eng %0 Conference Proceedings %B Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011 %D 2011 %T On the Move to Meaningful Internet Systems: OTM 2011. Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011, Hersonissos, Crete, Greece, October 17-21, 2011, Proceedings, Part II %E Robert Meersman %E Tharam S. Dillon %E Pilar Herrero %E Akhil Kumar %E Manfred Reichert %E Li Qing %E Beng Chin Ooi %E Ernesto Damiani %E Douglas C. Schmidt %E Jules White %E Manfred Hauswirth %E Pascal Hitzler %E Mukesh K. Mohania %B Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011 %I Springer %C Hersonissos, Crete, Greece %V 7045 %G eng %0 Conference Proceedings %B Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011 %D 2011 %T On the Move to Meaningful Internet Systems: OTM 2011. Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011, Hersonissos, Crete, Greece, October 17-21, 2011, Proceedings, Part I %E Robert Meersman %E Tharam S. Dillon %E Pilar Herrero %E Akhil Kumar %E Manfred Reichert %E Li Qing %E Beng Chin Ooi %E Ernesto Damiani %E Douglas C. Schmidt %E Jules White %E Manfred Hauswirth %E Pascal Hitzler %E Mukesh K. Mohania %B Confederated International Conferences, CoopIS, DOA-SVI, and ODBASE 2011 %I Springer %C Hersonissos, Crete, Greece %V 7044 %G eng %0 Conference Paper %B Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011 %D 2011 %T Nominal Schemas for Integrating Rules and Description Logics %A Markus Krötzsch %A Frederick Maier %A Adila Krisnadhi %A Pascal Hitzler %E Riccardo Rosati %E Sebastian Rudolph %E Michael Zakharyaschev %X We propose an extension of SROIQ with nominal schemas which can be used like “variable nominal concepts” within axioms. This feature allows us to express arbitrary DL-safe rules in description logic syntax. We show that adding nominal schemas to SROIQ does not increase its worst-case reasoning complexity, and we identify a family of tractable DLs SROELVn that allow for restricted use of nominal schemas. %B Proceedings of the 24th International Workshop on Description Logics (DL 2011), Barcelona, Spain, July 13-16, 2011 %I CEUR-WS.org %V 745 %8 07/2011 %G eng %U http://ceur-ws.org/Vol-745/paper_39.pdf %0 Conference Paper %B Reasoning Web. Semantic Technologies for the Web of Data - 7th International Summer School 2011, Galway, Ireland, August 23-27, 2011, Tutorial Lectures %D 2011 %T OWL and Rules %A Adila Krisnadhi %A Frederick Maier %A Pascal Hitzler %E Axel Polleres %E Claudia d'Amato %E Marcelo Arenas %E Siegfried Handschuh %E Paula Kroner %E Sascha Ossowski %E Peter F. Patel-Schneider %X The relationship between the Web Ontology Language OWL and rule-based formalisms has been the subject of many discussions and research investigations, some of them controversial. From the many attempts to reconcile the two paradigms, we present some of the newest developments. More precisely, we show which kind of rules can be modeled in the current version of OWL, and we show how OWL can be extended to incorporate rules. We finally give references to a large body of work on rules and OWL. %B Reasoning Web. Semantic Technologies for the Web of Data - 7th International Summer School 2011, Galway, Ireland, August 23-27, 2011, Tutorial Lectures %I Springer %V 6848 %P 382-415 %8 08/2011 %@ 978-3-642-23031-8 %G eng %U http://dx.doi.org/10.1007/978-3-642-23032-5 %R 10.1007/978-3-642-23032-5 %0 Conference Paper %B Web Reasoning and Rule Systems - 5th International Conference, RR 2011 %D 2011 %T Paraconsistent Semantics for Hybrid MKNF Knowledge Bases %A Shasha Huang %A Qingguo Li %A Pascal Hitzler %E Sebastian Rudolph %E Claudio Gutierrez %X

Hybrid MKNF knowledge bases, originally based on the stable model semantics, is a mature method of combining rules and Description Logics (DLs). The well-founded semantics for such knowledge bases has been proposed subsequently for better efficiency of reasoning. However, integration of rules and DLs may give rise to inconsistencies, even if they are respectively consistent. Accordingly, reasoning systems based on the previous two semantics will break down. In this paper, we employ the four-valued logic proposed by Belnap, and present a paraconsistent semantics for Hybrid MKNF knowledge bases, which can detect inconsistencies and handle it effectively. Besides, we transform our proposed semantics to the stable model semantics via a linear transformation operator, which indicates that the data complexity in our paradigm is not higher than that of classical reasoning. Moreover, we provide a fixpoint algorithm for computing paraconsistent MKNF models.

%B Web Reasoning and Rule Systems - 5th International Conference, RR 2011 %I Springer %C Galway, Ireland %V 6902 %P 93–107 %G eng %U http://dx.doi.org/10.1007/978-3-642-23580-1_8 %R 10.1007/978-3-642-23580-1_8 %0 Conference Proceedings %B Seventh International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'11, at the 22nd International Joint Conference on Artificial Intelligence, IJCAI-11 %D 2011 %T Proceedings of the Seventh International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'11, at the 22nd International Joint Conference on Artificial Intelligence, IJCAI-11, Barcelona, Catalonia (Spain), 2011 %E Artur S. d'Avila Garcez %E Pascal Hitzler %E Luís C. Lamb %B Seventh International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'11, at the 22nd International Joint Conference on Artificial Intelligence, IJCAI-11 %I CEUR-WS.org %C Barcelona, Catalonia, Spain %V 764 %G eng %U http://ceur-ws.org/Vol-764 %0 Conference Paper %B Proceedings of the 8th International Workshop on OWL: Experiences and Directions {(OWLED} 2011), San Francisco, California, USA, June 5-6, 2011 %D 2011 %T Representation of Parsimonious Covering Theory in OWL-DL %A Cory A. Henson %A Krishnaprasad Thirunarayan %A Amit P. Sheth %A Pascal Hitzler %E Michel Dumontier %E Mélanie Courtot %X

The Web Ontology Language has not been designed for representing abductive inference, which is often required for applications such as medical disease diagnosis. As a consequence, existing OWL ontologies have limited ability to encode knowledge for such applications. In the last 150 years, many logic frameworks for the representation of abductive inference have been developed. Among these frameworks, Parsimonious Covering Theory (PCT) has achieved wide recognition. PCT is a formal model of diagnostic reasoning in which knowledge is represented as a network of causal associations, and whose goal is to account for observed symptoms with plausible explanatory hypotheses. In this paper, we argue that OWL does provide some of the expressivity required to approximate diagnostic reasoning, and outline a suitable encoding of PCT in OWL-DL.

%B Proceedings of the 8th International Workshop on OWL: Experiences and Directions {(OWLED} 2011), San Francisco, California, USA, June 5-6, 2011 %I CEUR-WS.org %C San Francisco, California, USA %V 796 %G eng %0 Journal Article %J Semantic Web %D 2011 %T Semantic Web surveys and applications %A Pascal Hitzler %A Krzysztof Janowicz %B Semantic Web %V 2 %P 65–66 %G eng %U http://dx.doi.org/10.3233/SW-2011-0047 %N 2 %R 10.3233/SW-2011-0047 %0 Journal Article %J Semantic Web %D 2011 %T Semantic Web tools and systems %A Pascal Hitzler %A Krzysztof Janowicz %B Semantic Web %V 2 %P 1–2 %G eng %U http://dx.doi.org/10.3233/SW-2011-0035 %N 1 %R 10.3233/SW-2011-0035 %0 Conference Paper %B ALP Newsletter, Association of Logic Programming %D 2011 %T Web Reasoning and Rule Systems: Five Years into the Conference %A Francesco Calimeri %A Pascal Hitzler %X In this note we retrospect on the five years of the Web Reasoning and Rule Systems conference series and discuss the rationale for the series in the context of the overall field of the Semantic Web, the activities of the Web Reasoning research community, and the development of standards for rule-based systems on the Web. At the end, we draw the reader’s attention to the next event in the series, which will take place in Vienna in September 2012. %B ALP Newsletter, Association of Logic Programming %8 12/2011 %G eng %U http://www.cs.nmsu.edu/ALP/2011/12/web-reasoning-and-rule-systems-five-years-into-the-conference %0 Conference Paper %B Formal Concept Analysis - 9th International Conference, ICFCA 2011 %D 2011 %T What's Happening in Semantic Web - ... and What FCA Could Have to Do with It %A Pascal Hitzler %E Petko Valtchev %E Robert Jäschke %B Formal Concept Analysis - 9th International Conference, ICFCA 2011 %I Springer %C Nicosia, Cyprus %V 6628 %P 18–23 %G eng %U http://dx.doi.org/10.1007/978-3-642-20514-9_2 %R 10.1007/978-3-642-20514-9_2 %0 Conference Proceedings %B Learning paradigms in dynamic environments %D 2010 %T 10302 Abstracts Collection - Learning paradigms in dynamic environments %E Barbara Hammer %E Pascal Hitzler %E Wolfgang Maass %E Marc Toussaint %K Autonomous learning %K Dynamic systems %K Neural-symbolic integration %K Neurobiology %K Recurrent neural networks %K Speech processing %B Learning paradigms in dynamic environments %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany %C Dagstuhl, Germany %G eng %U http://drops.dagstuhl.de/opus/volltexte/2010/2804 %0 Conference Paper %B Learning paradigms in dynamic environments %D 2010 %T 10302 Summary – Learning paradigms in dynamic environments %A Barbara Hammer %A Pascal Hitzler %A Wolfgang Maass %A Marc Toussaint %E Barbara Hammer %E Pascal Hitzler %E Wolfgang Maass %E Marc Toussaint %X

The seminar centered around problems which arise in the context of machine learning in dynamic environments. Particular emphasis was put on a couple of specific questions in this context: how to represent and abstract knowledge appropriately to shape the problem of learning in a partially unknown and complex environment and how to combine statistical inference and abstract symbolic representations; how to infer from few data and how to deal with non i.i.d. data, model revision and life-long learning; how to come up with efficient strategies to control realistic environments for which exploration is costly, the dimensionality is high and data are sparse; how to deal with very large settings; and how to apply these models in challenging application areas such as robotics, computer vision, or the web.

%B Learning paradigms in dynamic environments %I Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany %C Dagstuhl, Germany %G eng %U http://drops.dagstuhl.de/opus/volltexte/2010/2802 %0 Conference Paper %B Database and Expert Systems Applications, 21st International Conference, DEXA 2010 %D 2010 %T Approximate Instance Retrieval on Ontologies %A Tuvshintur Tserendorj %A Stephan Grimm %A Pascal Hitzler %E Pablo Garcia Bringas %E Abdelkader Hameurlain %E Gerald Quirchmayr %X

With the development of more expressive description logics (DLs) for the Web Ontology Language OWL the question arises how we can properly deal with the high computational complexity for effi- cient reasoning. In application cases that require scalable reasoning with expressive ontologies, non-standard reasoning solutions such as approximate reasoning are necessary to tackle the intractability of reasoning in expressive DLs. In this paper, we are concerned with the approximation of the reasoning task of instance retrieval on DL knowledge bases, trading correctness of retrieval results for gain of speed. We introduce our notion of an approximate concept extension and we provide implementations to compute an approximate answer for a concept query by a suitable mapping to efficient database operations. Furthermore, we report on experiments of our approach on instance retrieval with the Wine ontology and discuss first results in terms of error rate and speed-up.

%B Database and Expert Systems Applications, 21st International Conference, DEXA 2010 %I Springer %C Bilbao, Spain %V 6261 %P 503–511 %G eng %U http://dx.doi.org/10.1007/978-3-642-15364-8_43 %R 10.1007/978-3-642-15364-8_43 %0 Journal Article %J International Journal of Software and Informatics %D 2010 %T Computational Complexity and Anytime Algorithm for Inconsistency Measurement %A Yue Ma %A Guilin Qi %A Guohui Xiao %A Pascal Hitzler %A Zuoquan Lin %K algorithm %K computational complexity %K inconsistency measurement %K Knowledge representation %K multi-valued logic %X

Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. In this paper, we consider the computational aspects of inconsistency degrees of propositional knowledge bases under 4-valued semantics. We first give a complete analysis of the computational complexity of computing inconsistency degrees. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximations of the inconsistency degree from above and below. We show that our algorithm satisfies some desirable properties and give experimental results of our implementation of the algorithm

%B International Journal of Software and Informatics %V 4 %P 3–21 %G eng %U http://www.ijsi.org/ch/reader/view_abstract.aspx?file_no=i41&flag=1 %0 Journal Article %J Machine Learning %D 2010 %T Concept learning in description logics using refinement operators %A Jens Lehmann %A Pascal Hitzler %K description logics %K Inductive logic programming %K OWL %K refinement operators %K Semantic Web %K Structured Machine Learning %X

With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applications, however, is constrained by the lack of well-structured knowledge bases consisting of a sophisticated schema and instance data adhering to this schema. It is paramount that suitable automated methods for their acquisition, maintenance, and evolution will be developed. In this paper, we provide a learning algorithm based on refinement operators for the description logic ALCQ including support for concrete roles. We develop the algorithm from thorough theoretical foundations by identifying possible abstract property combinations which refinement operators for description logics can have. Using these investigations as a basis, we derive a practically useful complete and proper refinement operator. The operator is then cast into a learning algorithm and evaluated using our implementation DL-Learner. The results of the evaluation show that our approach is superior to other learning approaches on description logics, and is competitive with established ILP systems.

%B Machine Learning %V 78 %P 203–250 %G eng %U http://springerlink.metapress.com/content/c040n45u15qrnu44/ %0 Conference Paper %B Proceedings of the 23rd International Workshop on Description Logics (DL2010) %D 2010 %T Distance-based Measures of Inconsistency and Incoherency for Description Logics %A Yue Ma %A Pascal Hitzler %E Volker Haarslev %E David Toman %E Grant Weddell %X

Inconsistency and incoherency are two sorts of erroneous information in a DL ontology which have been widely discussed in ontology-based applications. For example, they have been used to detect modeling errors during ontology construction. To provide more informative metrics which can tell the differences between inconsistent ontologies and between incoherent terminologies, there has been some work on measuring inconsistency of an ontology and on measuring incoherency of a terminology. However, most of them merely focus either on measuring inconsistency or on measuring incoherency and no clear ideas of how to extend them to allow for the other. In this paper, we propose a novel approach to measure DL ontologies, named distance-based measures. It has the merits that both inconsistency and incoherency can be measured in a unified framework. Moreover, only classical DL interpretations are used such that there is no restriction on the DL languages used.

%B Proceedings of the 23rd International Workshop on Description Logics (DL2010) %I CEUR-WS.org %C Waterloo, Canada %V 573 %P 475-485 %G eng %0 Report %D 2010 %T Distributed Reasoning with EL++ Using MapReduce %A Frederick Maier %A Raghava Mutharaju %A Pascal Hitzler %X

It has recently been shown that the MapReduce framework for distributed computation can be used effectively for large-scale RDF Schema reasoning, computing the deductive closure of over a billion RDF triples within a reasonable time [23]. Later work has carried this approach over to OWL Horst [22]. In this paper, we provide a MapReduce algorithm for classifying knowledge bases in the description logic EL++, which is essentially the OWL 2 profile OWL 2 EL. The traditional EL++ classification algorithm is recast into a form compatible with MapReduce, and it is shown how the revised algorithm can be realized within the MapReduce framework. An analysis of the circumstances under which the algorithm can be effectively used is also provided.

%I Wright State University %C Dayton, OH, USA %G eng %0 Journal Article %J Applied Intelligence %D 2010 %T Extracting Reduced Logic Programs from Artificial Neural Networks %A Jens Lehmann %A Sebastian Bader %A Pascal Hitzler %X

Artificial neural networks can be trained to perform excellently in many application areas. Whilst they can learn from raw data to solve sophisticated recognition and analysis problems, the acquired knowledge remains hidden within the network architecture and is not readily accessible for analysis or further use: Trained networks are black boxes. Recent research efforts therefore investigate the possibility to extract symbolic knowledge from trained networks, in order to analyze, validate, and reuse the structural insights gained implicitly during the training process. In this paper, we will study how knowledge in form of propositional logic programs can be obtained in such a way that the programs are as simple as possible — where simple is being understood in some clearly defined and meaningful way.

%B Applied Intelligence %V 32 %P 249–266 %G eng %U http://dx.doi.org/10.1007/s10489-008-0142-y %R 10.1007/s10489-008-0142-y %0 Conference Paper %B Proceedings of the 5th International Workshop on Ontology Matching (OM-2010), Shanghai, China, November 7, 2010 %D 2010 %T Flexible Bootstrapping-Based Ontology Alignment %A Prateek Jain %A Pascal Hitzler %A Amit P. Sheth %E Pavel Shvaiko %E Jérôme Euzenat %E Fausto Giunchiglia %E Heiner Stuckenschmidt %E Ming Mao %E Isabel F. Cruz %X

BLOOMS (Jain et al, ISWC2010, to appear) is an ontology alignment system which, in its core, utilizes the Wikipedia category hierarchy for establishing alignments. In this paper, we present a Plug-and-Play extension to BLOOMS, which allows to flexibly replace or complement the use of Wikipedia by other online or offline resources, including domain-specific ontologies or taxonomies. By making use of automated translation services and of Wikipedia in languages other than English, it makes it possible to apply BLOOMS to alignment tasks where the input ontologies are written in different languages.

%B Proceedings of the 5th International Workshop on Ontology Matching (OM-2010), Shanghai, China, November 7, 2010 %I CEUR-WS.org %C Shanghai, China %V 689 %G eng %U http://ceur-ws.org/Vol-689/om2010_poster9.pdf %0 Journal Article %J Computer Journal %D 2010 %T Generalized Distance Functions in the Theory of Computation %A Anthony K. Seda %A Pascal Hitzler %K denotational semantics %K fixed-point theorems %K generalized distance functions %K Logic Programming %K stable model %K supported model %K topology %K ultra-metrics %X

We discuss a number of distance functions encountered in the theory of computation, including metrics, ultra-metrics, quasi-metrics, generalized ultra-metrics, partial metrics, d-ultra-metrics and generalized metrics. We consider their properties, associated fixed-point theorems and some general applications they have within the theory of computation. We consider in detail the applications of generalized distance functions in giving a uniform treatment of several important semantics for logic programs, including acceptable programs and natural generalizations of them, and also the supported model and the stable model in the context of locally stratified extended disjunctive logic programs and databases.

%B Computer Journal %V 53 %P 443–464 %G eng %U http://dx.doi.org/10.1093/comjnl/bxm108 %R 10.1093/comjnl/bxm108 %0 Conference Paper %B Linked Data Meets Artificial Intelligence, Papers from the 2010 AAAI Spring Symposium %D 2010 %T Linked Data Is Merely More Data %A Prateek Jain %A Pascal Hitzler %A Peter Z. Yeh %A Kunal Verma %A Amit Sheth %E Dan Brickley %E Vinay K. Chaudhri %E Harry Halpin %E Deborah McGuinness %X

In this position paper, we argue that the Linked Open Data (LoD) Cloud, in its current form, is only of limited value for furthering the Semantic Web vision. Being merely a weakly linked “triple collection,” it will only be of very limited bene- fit for the AI or Semantic Web communities. We describe the corresponding problems with the LoD Cloud and give directions for research to remedy the situation.

%B Linked Data Meets Artificial Intelligence, Papers from the 2010 AAAI Spring Symposium %I AAAI %C Stanford, California, USA %G eng %U http://www.aaai.org/ocs/index.php/SSS/SSS10/paper/view/1130 %0 Conference Paper %B Proceedings of the 23rd International Workshop on Description Logics (DL 2010) %D 2010 %T A MapReduce Algorithm for EL+ %A Raghava Mutharaju %A Frederick Maier %A Pascal Hitzler %E Volker Haarslev %E David Toman %E Grant E. Weddell %X

Recently, the use of the MapReduce framework for distributed RDF Schema reasoning has shown that it is possible to compute the deductive closure of sets of over a billion RDF triples within a reasonable time span [22], and that it is also possible to carry the approach over to OWL Horst [21]. Following this lead, in this paper we provide a MapReduce algorithm for the description logic EL+, more precisely for the classification of EL+ ontologies. To do this, we first modify the algorithm usually used for EL+ classification. The modified algorithm can then be converted into a MapReduce algorithm along the same key ideas as used for RDF schema.

%B Proceedings of the 23rd International Workshop on Description Logics (DL 2010) %I CEUR-WS.org %C Waterloo, Ontario, Canada %V 573 %P 464-474 %G eng %U http://ceur-ws.org/Vol-573/paper_35.pdf %0 Book %B Studies in Informatics %D 2010 %T Mathematical Aspects of Logic Programming Semantics %A Pascal Hitzler %A Anthony K. Seda %B Studies in Informatics %I Chapman and Hall/CRC Press %P 304 %G eng %0 Conference Paper %B The 4th Chinese Semantic Web Symposium %D 2010 %T Normalized MEDLINE Distance in Context-Aware Life Science Literature Searches %A Yan Wang %A Cong Wang %A Yi Zeng %A Zhisheng Huang %A Vassil Momtchev %A Bo Andersson %A Xu Ren %A Ning Zhong %B The 4th Chinese Semantic Web Symposium %I Tsinghua Science & Technology %G eng %0 Conference Paper %B The Semantic Web - ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010 %D 2010 %T Ontology Alignment for Linked Open Data %A Prateek Jain %A Pascal Hitzler %A Amit Sheth %A Kunal Verma %A Peter Z. Yeh %E Peter F. Patel-Schneider %E Yue Pan %E Pascal Hitzler %E Peter Mika %E Lei Zhang %E Jeff Z. Pan %E Ian Horrocks %E Birte Glimm %X

The Web of Data currently coming into existence through the Linked Open Data (LOD) effort is a major milestone in realizing the Semantic Web vision. However, the development of applications based on LOD faces difficulties due to the fact that the different LOD datasets are rather loosely connected pieces of information. In particular, links between LOD datasets are almost exclusively on the level of instances, and schema-level information is being ignored. In this paper, we therefore present a system for finding schema-level links between LOD datasets in the sense of ontology alignment. Our system, called BLOOMS, is based on the idea of bootstrapping information already present on the LOD cloud. We also present a comprehensive evaluation which shows that BLOOMS outperforms state-of-the-art ontology alignment systems on LOD datasets. At the same time, BLOOMS is also competitive compared with these other systems on the Ontology Evaluation Alignment Initiative Benchmark datasets.

%B The Semantic Web - ISWC 2010 - 9th International Semantic Web Conference, ISWC 2010 %I Springer %C Shanghai, China %V 6496 %P 402–417 %G eng %U http://dx.doi.org/10.1007/978-3-642-17746-0_26 %R 10.1007/978-3-642-17746-0_26 %0 Journal Article %J Logic Journal of the IGPL %D 2010 %T Perspectives and challenges for recurrent neural network training %A Marco Gori %A Barbara Hammer %A Pascal Hitzler %A Guenther Palm %B Logic Journal of the IGPL %V 18 %P 617–619 %G eng %U http://dx.doi.org/10.1093/jigpal/jzp042 %R 10.1093/jigpal/jzp042 %0 Journal Article %J Annals of Mathematics and Artificial Intelligence %D 2010 %T Preface - Special issue on commonsense reasoning for the semantic web %A Frank van Harmelen %A Andreas Herzig %A Pascal Hitzler %A Guilin Qi %B Annals of Mathematics and Artificial Intelligence %V 58 %P 1–2 %G eng %U http://dx.doi.org/10.1007/s10472-010-9209-7 %R 10.1007/s10472-010-9209-7 %0 Conference Paper %B Scientific and Statistical Database Management, 22nd International Conference, SSDBM 2010 %D 2010 %T Provenance Context Entity (PaCE): Scalable Provenance Tracking for Scientific RDF Data %A Satya S. Sahoo %A Olivier Bodenreider %A Pascal Hitzler %A Amit Sheth %A Krishnaprasad Thirunarayan %E Michael Gertz %E Bertram Ludäscher %K Biomedical knowledge repository %K Context theory %K Provenance context entity %K Provenance Management Framework. %K Provenir ontology %K RDF reification %X

The Semantic Web Resource Description Framework (RDF) format is being used by a large number of scientific applications to store and disseminate their datasets. The provenance information, describing the source or lineage of the datasets, is playing an increasingly significant role in ensuring data quality, computing trust value of the datasets, and ranking query results. Current Semantic Web provenance tracking approaches using the RDF reification vocabulary suffer from a number of known issues, including lack of formal semantics, use of blank nodes, and application-dependent interpretation of reified RDF triples that hinders data sharing. In this paper, we introduce a new approach called Provenance Context Entity (PaCE) that uses the notion of provenance context to create provenance-aware RDF triples without the use of RDF reification or blank nodes. We also define the formal semantics of PaCE through a simple extension of the existing RDF(S) semantics that ensures compatibility of PaCE with existing Semantic Web tools and implementations. We have implemented the PaCE approach in the Biomedical Knowledge Repository (BKR) project at the US National Library of Medicine to support provenance tracking on RDF data extracted from multiple sources, including biomedical literature and the UMLS Metathesaurus. The evaluations demonstrate a minimum of 49% reduction in total number of provenancespecific RDF triples generated using the PaCE approach as compared to RDF reification. In addition, using the PACE approach improves the performance of complex provenance queries by three orders of magnitude and remains comparable to the RDF reification approach for simpler provenance queries. 

%B Scientific and Statistical Database Management, 22nd International Conference, SSDBM 2010 %I Springer %C Heidelberg, Germany %V 6187 %P 461–470 %G eng %U http://dx.doi.org/10.1007/978-3-642-13818-8_32 %R 10.1007/978-3-642-13818-8_32 %0 Journal Article %J Semantic Web %D 2010 %T A Reasonable Semantic Web %A Pascal Hitzler %A Frank van Harmelen %K Automated Reasoning %K Formal Semantics %K Knowledge representation %K Linked Open Data %K Semantic Web %X

The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenges, which forces us to question established lines of research and to rethink the underlying approaches. We argue that reasoning for the Semantic Web should be understood as "shared inference," which is not necessarily based on deductive methods. Model-theoretic semantics (and sound and complete reasoning based on it) functions as a gold standard, but applications dealing with large-scale and noisy data usually cannot afford the required runtimes. Approximate methods, including deductive ones, but also approaches based on entirely different methods like machine learning or natureinspired computing need to be investigated, while quality assurance needs to be done in terms of precision and recall values (as in information retrieval) and not necessarily in terms of soundness and completeness of the underlying algorithms.

%B Semantic Web %V 1 %P 39–44 %G eng %U http://dx.doi.org/10.3233/SW-2010-0010 %R 10.3233/SW-2010-0010 %0 Journal Article %J AI Magazine %D 2010 %T Reports of the AAAI 2010 Conference Workshops %A David W. Aha %A Mark S. Boddy %A Vadim Bulitko %A Artur S. d'Avila Garcez %A Prashant Doshi %A Stefan Edelkamp %A Christopher W. Geib %A Piotr J. Gmytrasiewicz %A Robert P. Goldman %A Pascal Hitzler %A Charles L. Isbell %A Darsana P. Josyula %A Leslie Pack Kaelbling %A Kristian Kersting %A Maithilee Kunda %A Luís C. Lamb %A Bhaskara Marthi %A Keith McGreggor %A Vivi Nastase %A Gregory Provan %A Anita Raja %A Ashwin Ram %A Mark O. Riedl %A Stuart J. Russell %A Ashish Sabharwal %A Jan-Georg Smaus %A Gita Sukthankar %A Karl Tuyls %A Ron van der Meyden %A Alon Y. Halevy %A Lilyana Mihalkova %A Sriraam Natarajan %B AI Magazine %V 31 %P 95–108 %G eng %U http://www.aaai.org/ojs/index.php/aimagazine/article/view/2318 %0 Journal Article %J Semantic Web %D 2010 %T Semantic Web - Interoperability, Usability, Applicability %A Pascal Hitzler %A Krzysztof Janowicz %X

The Semantic Web journal is set up to be a forum for highest-quality research contributions on all aspects of the Semantic Web. Its scope encompasses work in neighboring disciplines which is motivated by the Semantic Web vision. Besides the publishing of research contributions, it is also an outlet for reports on tools, systems, applications, and ontologies which enable research, rather than being direct research contributions. The journal also publishes top-quality surveys which serve as introductions to core topics of Semantic Web research.

%B Semantic Web %V 1 %P 1–2 %G eng %U http://dx.doi.org/10.3233/SW-2010-0017 %R 10.3233/SW-2010-0017 %0 Conference Proceedings %B 9th International Semantic Web Conference, ISWC 2010 %D 2010 %T The Semantic Web - ISWC 2010. 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, November 7-11, 2010, Revised Selected Papers, Part I %E Peter F. Patel-Schneider %E Yue Pan %E Pascal Hitzler %E Peter Mika %E Lei Zhang %E Jeff Z. Pan %E Ian Horrocks %E Birte Glimm %B 9th International Semantic Web Conference, ISWC 2010 %I Springer %C Shanghai, China %V 6496 %G eng %0 Conference Proceedings %B 9th International Semantic Web Conference, ISWC 2010 %D 2010 %T The Semantic Web - ISWC 2010. 9th International Semantic Web Conference, ISWC 2010, Shanghai, China, November 7-11, 2010, Revised Selected Papers, Part II %E Peter F. Patel-Schneider %E Yue Pan %E Pascal Hitzler %E Peter Mika %E Lei Zhang %E Jeff Z. Pan %E Ian Horrocks %E Birte Glimm %B 9th International Semantic Web Conference, ISWC 2010 %I Springer %C Shanghai, China %V 6497 %G eng %0 Conference Paper %B Active Media Technology, 6th International Conference, AMT 2010, Toronto, Canada, August 28-30, 2010. Proceedings %D 2010 %T Social Relation Based Search Refinement: Let Your Friends Help You! %A Xu Ren %A Yi Zeng %A Yulin Qin %A Ning Zhong %A Zhisheng Huang %A Yan Wang %A Cong Wang %B Active Media Technology, 6th International Conference, AMT 2010, Toronto, Canada, August 28-30, 2010. Proceedings %P 475–485 %G eng %U http://dx.doi.org/10.1007/978-3-642-15470-6_48 %R 10.1007/978-3-642-15470-6_48 %0 Conference Paper %B International Symposium on Collaborative Technologies and Systems %D 2010 %T Targeted Ontology Matching %A Michelle Cheatham %B International Symposium on Collaborative Technologies and Systems %C Chicago, IL %G eng %0 Conference Paper %B Active Media Technology, 6th International Conference, AMT 2010, Toronto, Canada, August 28-30, 2010. Proceedings %D 2010 %T User Interests: Definition, Vocabulary, and Utilization in Unifying Search and Reasoning %A Yi Zeng %A Yan Wang %A Zhisheng Huang %A Danica Damljanovic %A Ning Zhong %A Cong Wang %B Active Media Technology, 6th International Conference, AMT 2010, Toronto, Canada, August 28-30, 2010. Proceedings %P 98–107 %G eng %U http://dx.doi.org/10.1007/978-3-642-15470-6_11 %R 10.1007/978-3-642-15470-6_11 %0 Conference Proceedings %B 4th International Conference on Web Reasoning and Rule Systems %D 2010 %T Web Reasoning and Rule Systems. Fourth International Conference, RR 2010, Bressanone, Italy, September 22-24, 2010, Proceedings %E Pascal Hitzler %E Thomas Lukasiewicz %B 4th International Conference on Web Reasoning and Rule Systems %I Springer %C Bressanone, Italy %V 6333 %G eng %0 Conference Paper %B Knowledge Science, Engineering and Management, Third International Conference, KSEM 2009 %D 2009 %T An Anytime Algorithm for Computing Inconsistency Measurement %A Yue Ma %A Guilin Qi %A Guohui Xiao %A Pascal Hitzler %A Zuoquan Lin %E Dimitris Karagiannis %E Zhi Jin %X

Measuring inconsistency degrees of inconsistent knowledge bases is an important problem as it provides context information for facilitating inconsistency handling. Many methods have been proposed to solve this problem and a main class of them is based on some kind of paraconsistent semantics. In this paper, we consider the computational aspects of inconsistency degrees of propositional knowledge bases under 4-valued semantics. We first analyze its computational complexity. As it turns out that computing the exact inconsistency degree is intractable, we then propose an anytime algorithm that provides tractable approximation of the inconsistency degree from above and below. We show that our algorithm satisfies some desirable properties and give experimental results of our implementation of the algorithm.

%B Knowledge Science, Engineering and Management, Third International Conference, KSEM 2009 %I Springer %C Vienna, Austria %V 5914 %P 29–40 %G eng %U http://dx.doi.org/10.1007/978-3-642-10488-6_7 %R 10.1007/978-3-642-10488-6_7 %0 Conference Proceedings %B Second Conference on Artificial General Intelligence, AGI 2009 %D 2009 %T Artificial General Intelligence. Second Conference on Artificial General Intelligence, AGI 2009, Arlington, Virginia, USA, March 6-9, 2009. Proceedings %E Ben Goertzel %E Pascal Hitzler %E Marcus Hutter %B Second Conference on Artificial General Intelligence, AGI 2009 %I Atlantis Press %C Arlington, Virginia, USA %G eng %0 Book %B Studies in Informatics %D 2009 %T Conceptual Structures in Practice %E Pascal Hitzler %E Henrik Schärfe %B Studies in Informatics %I Chapman and Hall/CRC %P 425 %G eng %0 Conference Paper %B Poster at DECOI2009, the International Workshop on Collective Intelligence andEvolution %D 2009 %T An Evolutionary Computing Approach for Reasoning in the Semantic Web %A Gaston Tagni %A Christophe Gueret %A Stefan Schlobach %A Sebastian Rudolph %A Pascal Hitzler %B Poster at DECOI2009, the International Workshop on Collective Intelligence andEvolution %C Leiden, The Netherlands %G eng %0 Journal Article %J Künstliche Intelligenz %D 2009 %T Facets of Artificial General Intelligence %A Pascal Hitzler %A Kai-Uwe Kühnberger %X

We argue that time has come for a serious endeavor to work towards artificial general intelligence (AGI). This positive assessment of the very possibility of AGI has partially its roots in the development of new methodological achievements in the AI area, like new learning paradigms and new integration techniques for different methodologies. The article sketches some of these methods as prototypical examples for approaches towards AGI.

%B Künstliche Intelligenz %V 23 %P 58–59 %G eng %U http://www.kuenstliche-intelligenz.de/fileadmin/template/main/archiv/pdf/ki2009-02_page58-59_web_full.pdf %0 Book %B Textbooks in Computing %D 2009 %T Foundations of Semantic Web Technologies %A Pascal Hitzler %A Markus Krötzsch %A Sebastian Rudolph %B Textbooks in Computing %I Chapman and Hall/CRC Press %P 455 %G eng %0 Conference Paper %B Second Conference on Artificial General Intelligence, AGI 2009 %D 2009 %T The Importance of Being Neural-Symbolic – A Wilde Position %A Pascal Hitzler %A Kai-Uwe Kühnberger %E Ben Goertzel %E Pascal Hitzler %E Marcus Hutter %X

We argue that Neural-Symbolic Integration is a topic of central importance for the advancement of Artificial General Intelligence.

%B Second Conference on Artificial General Intelligence, AGI 2009 %C Arlington, Virginia, USA %P 208-209 %G eng %0 Journal Article %J KI - Künstliche Intelligenz %D 2009 %T KI 2009 - AI Mashup Challenge 2009 %A Brigitte Endres-Niggemeyer %A Pascal Hitzler %A Valentin Zacharias %B KI - Künstliche Intelligenz %P 52 %G eng %0 Book Section %B Handbook on Ontologies %D 2009 %T Ontologies and Rules %A Pascal Hitzler %A Bijan Parsia %E Steffen Staab %E Rudi Studer %B Handbook on Ontologies %7 2 %I Springer %P 111-132 %G eng %0 Conference Paper %B Ohio Collaborative Conference on BioInformatics (OCCBIO 2009), Posters & Demos %D 2009 %T Ontology Driven Integration of Biology Experiment Data %A Raghava Mutharaju %A Satya S. Sahoo %A D. Brent Weatherly %A Pramod Anantharam %A Flora Logan %A Amit Sheth %A Rick Tarleton %B Ohio Collaborative Conference on BioInformatics (OCCBIO 2009), Posters & Demos %C Cleveland, OH, USA %G eng %0 Conference Paper %B On the Move to Meaningful Internet Systems: OTM 2009, Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009, Proceedings, Part II %D 2009 %T Ontology-Driven Provenance Management in eScience: An Application in Parasite Research %A Satya S. Sahoo %A D. Brent Weatherly %A Raghava Mutharaju %A Pramod Anantharam %A Amit Sheth %A Rick Tarleton %E Robert Meersman %E Tharam S. Dillon %E Pilar Herrero %X

Provenance, from the French word “provenir”, describes the lineage or history of a data entity. Provenance is critical information in scientific applications to verify experiment process, validate data quality and associate trust values with scientific results. Current industrial scale eScience projects require an end-to-end provenance management infrastructure. This infrastructure needs to be underpinned by formal semantics to enable analysis of large scale provenance information by software applications. Further, effective analysis of provenance information requires well-defined query mechanisms to support complex queries over large datasets. This paper introduces an ontology-driven provenance management infrastructure for biology experiment data, as part of the Semantic Problem Solving Environment (SPSE) for Trypanosoma cruzi (T.cruzi). This provenance infrastructure, called T.cruzi Provenance Management System (PMS), is underpinned by (a) a domain-specific provenance ontology called Parasite Experiment ontology, (b) specialized query operators for provenance analysis, and (c) a provenance query engine. The query engine uses a novel optimization technique based on materialized views called materialized provenance views (MPV) to scale with increasing data size and query complexity. This comprehensive ontology-driven provenance infrastructure not only allows effective tracking and management of ongoing experiments in the Tarleton Research Group at the Center for Tropical and Emerging Global Diseases (CTEGD), but also enables researchers to retrieve the complete provenance information of scientific results for publication in literature.

%B On the Move to Meaningful Internet Systems: OTM 2009, Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009, Proceedings, Part II %I Springer %C Vilamoura, Portugal %V 5871 %P 992–1009 %G eng %U http://dx.doi.org/10.1007/978-3-642-05151-7_18 %R 10.1007/978-3-642-05151-7_18 %0 Web Page %D 2009 %T OWL 2 Web Ontology Language: Primer %A Pascal Hitzler %A Markus Krötzsch %A Bijan Parsia %A Peter F. Patel-Schneider %A Sebastian Rudolph %P W3C Recommendation %8 10/27/2009 %G eng %U http://www.w3.org/TR/2009/REC-owl2-primer-20091027 %0 Conference Paper %B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %D 2009 %T Paraconsistent Reasoning for OWL 2 %A Yue Ma %A Pascal Hitzler %E Axel Polleres %E Terrance Swift %X

A four-valued description logic has been proposed to reason with description logic based inconsistent knowledge bases. This approach has a distinct advantage that it can be implemented by invoking classical reasoners to keep the same complexity as under the classical semantics. However, this approach has so far only been studied for the basid description logic ALC. In this paper, we further study how to extend the four-valued semantics to the more expressive description logic SROIQ which underlies the forthcoming revision of the Web Ontology Language, OWL 2, and also investigate how it fares when adapated to tractable description logics including EL++, DL-Lite, and Horn-DLs. We define the four-valued semantics along the same lines as for ALC and show that we can retain most of the desired properties.

%B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %I Springer %C Chantilly, VA, USA %V 5837 %P 197–211 %G eng %U http://dx.doi.org/10.1007/978-3-642-05082-4_14 %R 10.1007/978-3-642-05082-4_14 %0 Conference Paper %B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %D 2009 %T A Preferential Tableaux Calculus for Circumscriptive ALCO %A Stephan Grimm %A Pascal Hitzler %E Axel Polleres %E Terrance Swift %X

Nonmonotonic extensions of description logics (DLs) allow for default and local closed-world reasoning and are an acknowledged desired feature for applications, e.g. in the Semantic Web. A recent approach to such an extension is based on McCarthy’s circumscription, which rests on the principle of minimising the extension of selected predicates to close off dedicated parts of a domain model. While decidability and complexity results have been established in the literature, no practical algorithmisation for circumscriptive DLs has been proposed so far. In this paper, we present a tableaux calculus that can be used as a decision procedure for concept satisfiability with respect to conceptcircumscribed ALCO knowledge bases. The calculus builds on existing tableaux for classical DLs, extended by the notion of a preference clash to detect the non-minimality of constructed models.

%B Web Reasoning and Rule Systems, Third International Conference, RR 2009 %I Springer %C Chantilly, VA, USA %V 5837 %P 40–54 %G eng %U http://dx.doi.org/10.1007/978-3-642-05082-4_4 %R 10.1007/978-3-642-05082-4_4 %0 Conference Proceedings %B Fifth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'09, at the 21st International Joint Conference on Artificial Intelligence %D 2009 %T Proceedings of the Fifth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'09, at the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, July 2009 %E Artur S. d'Avila Garcez %E Pascal Hitzler %B Fifth International Workshop on Neural-Symbolic Learning and Reasoning, NeSy'09, at the 21st International Joint Conference on Artificial Intelligence %I CEUR-WS.org %C Pasadena, California %V 481 %G eng %U http://ceur-ws.org/Vol-481 %0 Conference Proceedings %B INFORMATIK 2009 - Im Fokus das Leben %D 2009 %T Proceedings of the Fourth International Workshop on Applications of Semantic Technologies, AST2009, at Informatik2009, Lübeck, Germany, October 2009 %E Stephan Grimm %E Pascal Hitzler %B INFORMATIK 2009 - Im Fokus das Leben %I Bonner Köllen Verlag %C Lübeck, Germany %P 381-400 %G eng %0 Conference Paper %B The Semantic Web: Research and Applications, 6th European Semantic Web Conference, ESWC 2009 %D 2009 %T RaDON - Repair and Diagnosis in Ontology Networks %A Qiu Ji %A Peter Haase %A Guilin Qi %A Pascal Hitzler %A Steffen Stadtmüller %E Lora Aroyo %E Paolo Traverso %E Fabio Ciravegna %E Philipp Cimiano %E Tom Heath %E Eero Hyvönen %E Riichiro Mizoguchi %E Eyal Oren %E Marta Sabou %E Elena Paslaru Bontas Simperl %X

One of the major challenges in managing networked and dynamic ontologies is to handle inconsistencies in single ontologies, and inconsistencies introduced by integrating multiple distributed ontologies. Our RaDON system provides functionalities to repair and diagnose ontology networks by extending the capabilities of existing reasoners. The system integrates several new debugging and repairing algorithms, such as a relevance-directed algorithm to meet the various needs of the users.

%B The Semantic Web: Research and Applications, 6th European Semantic Web Conference, ESWC 2009 %I Springer %C Heraklion, Crete, Greece %V 5554 %P 863–867 %G eng %U http://dx.doi.org/10.1007/978-3-642-02121-3_71 %R 10.1007/978-3-642-02121-3_71 %0 Conference Paper %B Web Information Systems Engineering - WISE 2009, 10th International Conference %D 2009 %T Spatio-Temporal-Thematic Analysis of Citizen Sensor Data: Challenges and Experiences %A Meenakshi Nagarajan %A Karthik Gomadam %A Amit Sheth %A Ajith Ranabahu %A Raghava Mutharaju %A Ashutosh Jadhav %E Gottfried Vossen %E Darrell D. E. Long %E Jeffrey Xu Yu %X

We present work in the spatio-temporal-thematic analysis of citizen-sensor observations pertaining to real-world events. Using Twitter as a platform for obtaining crowd-sourced observations, we explore the interplay between these 3 dimensions in extracting insightful summaries of social perceptions behind events. We present our experiences in building a web mashup application, Twitris [1] that extracts and facilitates the spatio-temporal-thematic exploration of event descriptor summaries.

%B Web Information Systems Engineering - WISE 2009, 10th International Conference %I Springer %C Poznan, Poland %V 5802 %P 539–553 %G eng %U http://dx.doi.org/10.1007/978-3-642-04409-0_52 %R 10.1007/978-3-642-04409-0_52 %0 Conference Paper %B Proceedings of the 5th International Workshop on {OWL:} Experiences and Directions {(OWLED} 2009), Chantilly, VA, United States, October 23-24, 2009 %D 2009 %T Suggestions for OWL 3 %A Pascal Hitzler %E Rinke Hoekstra %E Peter F. Patel-Schneider %X

With OWL 2 about to be completed, it is the right time to start discussions on possible future modifications of OWL. We present here a number of suggestions in order to discuss them with the OWL user community. They encompass expressive extensions on polynomial OWL 2 profiles, a suggestion for an OWL Rules language, and expressive extensions for OWL DL.

%B Proceedings of the 5th International Workshop on {OWL:} Experiences and Directions {(OWLED} 2009), Chantilly, VA, United States, October 23-24, 2009 %I CEUR-WS.org %C Chantilly, VA, United States %V 529 %G eng %U http://ceur-ws.org/Vol-529/owled2009_submission_6.pdf %0 Conference Paper %B GeoSpatial Semantics, Third International Conference, GeoS 2009 %D 2009 %T Towards Reasoning Pragmatics %A Pascal Hitzler %E Krzysztof Janowicz %E Martin Raubal %E Sergei Levashkin %X

The realization of Semantic Web reasoning is central to substantiating the Semantic Web vision. However, current mainstream research on this topic faces serious challenges, which force us to question established lines of research and to rethink the underlying approaches.

%B GeoSpatial Semantics, Third International Conference, GeoS 2009 %I Springer %C Mexico City, Mexico %V 5892 %P 9–25 %G eng %U http://dx.doi.org/10.1007/978-3-642-10436-7_2 %R 10.1007/978-3-642-10436-7_2 %0 Conference Paper %B Ohio Collaborative Conference on BioInformatics (OCCBIO 2009), Posters & Demos %D 2009 %T Trykipedia: Collaborative Bio-Ontology Development using Wiki Environment %A Pramod Anantharam %A Satya S. Sahoo %A D. Brent Weatherly %A Flora Logan %A Raghava Mutharaju %A Amit Sheth %A Rick Tarleton %B Ohio Collaborative Conference on BioInformatics (OCCBIO 2009), Posters & Demos %C Cleveland, OH, USA %G eng %0 Conference Paper %B Semantic Web Challenge at the 8th International Semantic Web Conference (ISWC 2009) %D 2009 %T Twitris: Socially Influenced Browsing %A Ashutosh Jadhav %A Wenbo Wang %A Raghava Mutharaju %A Pramod Anantharam %A Vinh Nguyen %A Amit Sheth %A Karthik Gomadam %A Meenakshi Nagarajan %A Ajith Ranabahu %X

In this paper, we present Twitris, a semantic Web application that facilitates browsing for news and information, using social perceptions as the fulcrum. In doing so we address challenges in large scale crawling, processing of real time information, and preserving spatiotemporal-thematic properties central to observations pertaining to realtime events. We extract metadata about events from Twitter and bring related news and Wikipedia articles to the user. In developing Twitris, we have used the DBPedia ontology.

%B Semantic Web Challenge at the 8th International Semantic Web Conference (ISWC 2009) %C Washington DC, USA %G eng %0 Book %D 2008 %T Semantic Web Grundlagen %A Pascal Hitzler %A Markus Krötzsch %A Sebastian Rudolph %A York Sure %I Springer textbook %P 277 %G eng %0 Conference Paper %B Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings %D 2007 %T Data Complexity in the EL Family of Description Logics %A Adila Krisnadhi %A Carsten Lutz %E Nachum Dershowitz %E Andrei Voronkov %X We study the data complexity of instance checking and conjunctive query answering in the EL family of description logics, with a particular emphasis on the boundary of tractability. We identify a large number of intractable extensions of EL, but also show that in ELIf , the extension of EL with inverse roles and global functionality, conjunctive query answering is tractable regarding data complexity. In contrast, already instance checking in EL extended with only inverse roles or global functionality is EXPTIME-complete regarding combined complexity %B Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, October 15-19, 2007, Proceedings %I Springer %V 4790 %P 333-347 %8 10/2007 %G eng %U http://dx.doi.org/10.1007/978-3-540-75560-9_25 %R 10.1007/978-3-540-75560-9_25 %0 Conference Paper %B Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007 %D 2007 %T Data Complexity in the EL family of DLs %A Adila Krisnadhi %A Carsten Lutz %E Diego Calvanese %E Enrico Franconi %E Volker Haarslev %E Domenico Lembo %E Boris Motik %E Anni-Yasmin Turhan %E Sergio Tessaris %B Proceedings of the 2007 International Workshop on Description Logics (DL2007), Brixen-Bressanone, near Bozen-Bolzano, Italy, 8-10 June, 2007 %I CEUR-WS.org %V 250 %8 06/2007 %G eng %U http://ceur-ws.org/Vol-250/paper_15.pdf %0 Thesis %D 2007 %T Data Complexity of Instance Checking in the EL Family of Description Logics %A Adila Krisnadhi %X Subsumption in the description logic (DL) EL is known to be tractable even when it is done with respect to the most general form of terminology, namely a set of general inclusion axioms (GCIs). Recently, this tractability boundary has been clarified by identifying DL constructors that causes intractability of subsumption when added to EL and that do not. These results provide us with a characterization of the complexity of subsumption for the EL family of DLs (i.e., EL and its extensions). Besides subsumption, there are other standard reasoning problems studied in DL. Among them, the instance checking problem is the most basic reasoning problem that is concerned with deriving implicit knowledge about individuals in a DL knowledge base. Such a knowledge base consists of an intensional part in the form of a terminology (TBox) and an extensional or data part in the form of assertions about particular individuals in the domain of the knowledge base (ABox). Like other reasoning problems, complexity of instance checking is usually measured in the size of the whole input - thus called combined complexity - which, in this case, consists of a TBox, an ABox, a query concept and an individual name. On the other hand, it is common to assume that the data (ABox) is very large compared to the TBox and the query. Therefore, it is often more realistic to use a complexity measure based only on the size of the ABox, i.e., data complexity. For the EL family, results for the combined complexity of instance checking can be derived from the complexity results for subsumption. But results which are concerned with data complexity are still lacking. This motivates us to investigate the data complexity of instance checking in the EL family. In particular, we are interested in whether there are extensions of EL which are intractable regarding combined complexity, but tractable regarding data complexity. The first part of this thesis establishes coNP-hardness (and even coNP-completeness) results regarding data complexity of instance checking w.r.t. sets of GCIs for extensions of EL with negation, disjunction, value restriction, number restriction and role constructors such as role negation, role union and transitive closures. The lower bounds of data complexity for these DLs are proved by polynomial reductions from the complement of 2+2-SAT, a variant of propositional satisfiability problem which is NP-complete, whereas the upper bounds follow from known results of data complexity for ALC and SHIQ. The second part identifies an extension of EL called ELIf, for which data complexity of instance checking w.r.t. sets of GCIs is tractable. The DL ELIf is obtained from EL by adding inverse roles and global functionality. This result is interesting since adding only one of those two constructors leads to intractability of reasoning w.r.t. combined complexity. The result is derived by giving an algorithm that decides instance checking in ELIf w.r.t. sets of GCIs and runs in time polynomial in the size of the input ABox. %I Technische Universität Dresden %C Dresden %V Master of Science %P v+68 %8 03/2007 %G eng %U http://lat.inf.tu-dresden.de/research/mas/#Kri-Mas-07 %9 Master's %0 Conference Paper %B International Conference on Data Mining %D 2007 %T Feature Selection for Collaborative Team Formation via Social Network Analysis %A Michelle Cheatham %A Felicia Harlow %A Kevin Cleereman %B International Conference on Data Mining %C Las Vegas, NV %G eng %0 Conference Paper %B International Symposium on Collaborative Technologies and Systems %D 2006 %T Application of Social Network Analysis to Collaborative Team Formation %A Michelle Cheatham %A Kevin Cleereman %B International Symposium on Collaborative Technologies and Systems %C Las Vegas, NV %G eng %0 Conference Paper %B International Conference on Information Technology - New Generations %D 2006 %T Feature and Prototype Evolution for Nearest Neighbor Classification of Web Documents %A Michelle Cheatham %A Mateen Rizki %B International Conference on Information Technology - New Generations %C Las Vegas, NV %G eng %0 Report %D 2006 %T Traceability from Use Case to .NET Assembly via Design Patterns %A Raghava Mutharaju %A Banshi D. Chaudhary %I Motilal Nehru National Institute of Technology (MNNIT) %C Allahabad, India %G eng %0 Conference Paper %B International Conference on Integration of Knowledge Intensive Multi-Agent Systems %D 2005 %T AI Planning in Portal-based Workflow Management Systems %A Michelle Cheatham %A Michael Cox %B International Conference on Integration of Knowledge Intensive Multi-Agent Systems %C Waltham, MA %G eng %0 Conference Paper %B International Symposium on Collaborative Technologies and Systems %D 2005 %T AI Workflow Management in a Collaborative Environment %A Michelle Cheatham %A Michael Cox %B International Symposium on Collaborative Technologies and Systems %C St. Louis, MO %G eng