<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>27</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Joseph Zalewski</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Krzysztof Janowicz</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Semantic Compression with Region Calculi in Nested Hierarchical Grids (Technical Report)</style></title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Hierarchical Grids</style></keyword><keyword><style  face="normal" font="default" size="100%">Knowledge Graphs</style></keyword><keyword><style  face="normal" font="default" size="100%">RCC5</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2021</style></year></dates><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aaron Eberhart</style></author><author><style face="normal" font="default" size="100%">Monireh Ebrahimi</style></author><author><style face="normal" font="default" size="100%">Lu Zhou</style></author><author><style face="normal" font="default" size="100%">Cogan Shimizu</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Completion Reasoning Emulation for the Description Logic EL+</style></title><secondary-title><style face="normal" font="default" size="100%">Proceedings of the AAAI 2020 Spring Symposium on Combining Machine Learning and Knowledge Engineering in Practice</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Deep Learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Description Logic</style></keyword><keyword><style  face="normal" font="default" size="100%">EL+</style></keyword><keyword><style  face="normal" font="default" size="100%">LSTM</style></keyword><keyword><style  face="normal" font="default" size="100%">NeSy</style></keyword><keyword><style  face="normal" font="default" size="100%">Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2020</style></year><pub-dates><date><style  face="normal" font="default" size="100%">03/2020</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://ceur-ws.org/Vol-2600/paper5.pdf</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">CEUR-WS.org</style></publisher><pub-location><style face="normal" font="default" size="100%">Stanford University, Palo Alto, California, USA</style></pub-location><volume><style face="normal" font="default" size="100%">2600</style></volume><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;We 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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Amir Hossein Yazdavar</style></author><author><style face="normal" font="default" size="100%">Mohammad Saeid Mahdavinejad</style></author><author><style face="normal" font="default" size="100%">Goonmeet Baja</style></author><author><style face="normal" font="default" size="100%">William Romine</style></author><author><style face="normal" font="default" size="100%">Amit Sheth</style></author><author><style face="normal" font="default" size="100%">Amir Hassan Monadjemi</style></author><author><style face="normal" font="default" size="100%">Krishnaprasad Thirunarayan</style></author><author><style face="normal" font="default" size="100%">John M. Meddar</style></author><author><style face="normal" font="default" size="100%">Annie Myers</style></author><author><style face="normal" font="default" size="100%">Jyotishman Pathak</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Multimodal mental health analysis in social media</style></title><secondary-title><style face="normal" font="default" size="100%">PLoS ONE</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Explainable Machine Learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Hypothesis Testing</style></keyword><keyword><style  face="normal" font="default" size="100%">National Language Processing</style></keyword><keyword><style  face="normal" font="default" size="100%">Prediction</style></keyword><keyword><style  face="normal" font="default" size="100%">Regression</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2020</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://journals.plos.org/plosone/article/file?id=10.1371/journal.pone.0226248&amp;type=printable</style></url></web-urls></urls><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;p.p1 {margin: 0.0px 0.0px 0.0px 0.0px; font: 9.5px Helvetica}&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;Depression is a major public health concern in the U.S. and globally. While successful early&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;identification and treatment can lead to many positive health and behavioral outcomes,&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;depression, remains undiagnosed, untreated or undertreated due to several reasons,&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;including denial of the illness as well as cultural and social stigma. With the ubiquity of social&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;media platforms, millions of people are now sharing their online persona by expressing their&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;thoughts, moods, emotions, and even their daily struggles with mental health on social&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;media. Unlike traditional observational cohort studies conducted through questionnaires&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;and self-reported surveys, we explore the reliable detection of depressive symptoms from&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;tweets obtained, unobtrusively. Particularly, we examine and exploit multimodal big (social)&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;data to discern depressive behaviors using a wide variety of features including individuallevel&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;demographics. By developing a multimodal framework and employing statistical techniques&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;to fuse heterogeneous sets of features obtained through the processing of visual,&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;textual, and user interaction data, we significantly enhance the current state-of-the-art&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;approaches for identifying depressed individuals on Twitter (improving the average F1-&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;Score by 5 percent) as well as facilitate demographic inferences from social media. Besides&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;providing insights into the relationship between demographics and mental health, our&lt;/p&gt;

&lt;p class=&quot;p1&quot;&gt;research assists in the design of a new breed of demographic-aware health interventions.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Aaron Eberhart</style></author><author><style face="normal" font="default" size="100%">Michelle Cheatham</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Pseudo-Random ALC Syntax Generation</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web: ESWC 2018 Satellite Events - ESWC 2018 Satellite Events, Heraklion, Crete, Greece, June 3-7, 2018, Revised Selected Papers</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">ALC</style></keyword><keyword><style  face="normal" font="default" size="100%">Description Logic</style></keyword><keyword><style  face="normal" font="default" size="100%">DL</style></keyword><keyword><style  face="normal" font="default" size="100%">random generation</style></keyword><keyword><style  face="normal" font="default" size="100%">synthetic data</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2018</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">https://doi.org/10.1007/978-3-319-98192-5\_4</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Heraklion, Crete, Greece</style></pub-location><volume><style face="normal" font="default" size="100%">11155</style></volume><pages><style face="normal" font="default" size="100%">19–22</style></pages><isbn><style face="normal" font="default" size="100%">978-3-319-98191-8</style></isbn><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">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.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Maryam Labaf</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></secondary-authors><tertiary-authors><author><style face="normal" font="default" size="100%">Anthony B. Evans</style></author></tertiary-authors></contributors><titles><title><style face="normal" font="default" size="100%"> Propositional rule extraction from neural networks under background knowledge</style></title><secondary-title><style face="normal" font="default" size="100%">Twelfth International Workshop on Neural-Symbolic Learning and Reasoning</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Background knowledge</style></keyword><keyword><style  face="normal" font="default" size="100%">Neural Network</style></keyword><keyword><style  face="normal" font="default" size="100%">Propositional Logic</style></keyword><keyword><style  face="normal" font="default" size="100%">Rule Extraction</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2017</style></year><pub-dates><date><style  face="normal" font="default" size="100%">07/2017</style></date></pub-dates></dates><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Cristina Feier</style></author><author><style face="normal" font="default" size="100%">Cuenca Grau, Bernardo</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Ian Horrocks</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">EL-ifying Ontologies</style></title><secondary-title><style face="normal" font="default" size="100%">Automated Reasoning - 7th International Joint Conference, IJCAR 2014, Held as Part of the Vienna Summer of Logic, {VSL} 2014, Vienna, Austria, July 19-22, 2014. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rewriting</style></keyword><keyword><style  face="normal" font="default" size="100%">Tractable Reasoning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-319-08587-6_36</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">464–479</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;The OWL 2 profiles are fragments of the ontology language OWL 2 for which standard reasoning tasks are feasible in polynomial time. Many OWL ontologies, however, contain a typically small number of out-of-profile axioms, which may have little or no influence on reasoning outcomes. We investigate techniques for rewriting axioms into the EL and RL profiles of OWL 2. We have tested our techniques on both classification and data reasoning tasks with encouraging results.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Extending Description Logic Rules</style></title><secondary-title><style face="normal" font="default" size="100%">The Semantic Web: Research and Applications - 9th Extended Semantic Web Conference, ESWC 2012, Heraklion, Crete, Greece, May 27-31, 2012. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rules</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-30284-8_30</style></url></web-urls></urls><pages><style face="normal" font="default" size="100%">345–359</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Description Logics – the logics underpinning the Web Ontology Language OWL – and rules are currently the most prominent paradigms used for modeling knowledge for the Semantic Web. While both of these approaches are based on classical logic, the paradigms also differ significantly, so that naive combinations result in undesirable properties such as undecidability. Recent work has shown that many rules can in fact be expressed in OWL. In this paper we extend this work to include some types of rules previously excluded. We formally define a set of first order logic rules, C-Rules, which can be expressed within OWL extended with role conjunction. We also show that the use of nominal schemas results in even broader coverage.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Matthias Knorr</style></author><author><style face="normal" font="default" size="100%">David Carral</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Adila Krisnadhi</style></author><author><style face="normal" font="default" size="100%">Frederick Maier</style></author><author><style face="normal" font="default" size="100%">Cong Wang</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Markus Krötzsch</style></author><author><style face="normal" font="default" size="100%">Umberto Straccia</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Recent Advances in Integrating OWL and Rules</style></title><secondary-title><style face="normal" font="default" size="100%">Web Reasoning and Rule Systems - 6th International Conference, RR 2012, Vienna, Austria, September 10-12, 2012. Proceedings</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">Rules</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">09/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-33203-6_20</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Austria, Vienna</style></pub-location><volume><style face="normal" font="default" size="100%">7497</style></volume><pages><style face="normal" font="default" size="100%">225-228</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">As part of the quest for a unifying logic for the Semantic Web Technology Stack, a central issue is finding suitable ways of integrating description logics based on the Web Ontology Language (OWL) with rule-based approaches based on logic programming. Such integration is difficult since naive approaches typically result in the violation of one or more desirable design principles. For example, while both OWL 2 DL and RIF Core (a dialect of the Rule Interchange Format RIF) are decidable, their naive union is not, unless carefully chosen syntactic restrictions are applied.

We report on recent advances and ongoing work by the authors in integrating OWL and rulesWe take an OWL-centric perspective, which means that we take OWL 2 DL as a starting point and pursue the question of how features of rulebased formalisms can be added without jeopardizing decidability. We also report on incorporating the closed world assumption and on reasoning algorithms. This paper essentially serves as an entry point to the original papers, to which we will refer throughout, where detailed expositions of the results can be found.</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>10</ref-type><contributors><secondary-authors><author><style face="normal" font="default" size="100%">Barbara Hammer</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Wolfgang Maass</style></author><author><style face="normal" font="default" size="100%">Marc Toussaint</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">10302 Abstracts Collection - Learning paradigms in dynamic environments</style></title><secondary-title><style face="normal" font="default" size="100%">Learning paradigms in dynamic environments</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Autonomous learning</style></keyword><keyword><style  face="normal" font="default" size="100%">Dynamic systems</style></keyword><keyword><style  face="normal" font="default" size="100%">Neural-symbolic integration</style></keyword><keyword><style  face="normal" font="default" size="100%">Neurobiology</style></keyword><keyword><style  face="normal" font="default" size="100%">Recurrent neural networks</style></keyword><keyword><style  face="normal" font="default" size="100%">Speech processing</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://drops.dagstuhl.de/opus/volltexte/2010/2804</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany</style></publisher><pub-location><style face="normal" font="default" size="100%">Dagstuhl, Germany</style></pub-location><language><style face="normal" font="default" size="100%">eng</style></language></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Jens Lehmann</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Concept learning in description logics using refinement operators</style></title><secondary-title><style face="normal" font="default" size="100%">Machine Learning</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">description logics</style></keyword><keyword><style  face="normal" font="default" size="100%">Inductive logic programming</style></keyword><keyword><style  face="normal" font="default" size="100%">OWL</style></keyword><keyword><style  face="normal" font="default" size="100%">refinement operators</style></keyword><keyword><style  face="normal" font="default" size="100%">Semantic Web</style></keyword><keyword><style  face="normal" font="default" size="100%">Structured Machine Learning</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://springerlink.metapress.com/content/c040n45u15qrnu44/</style></url></web-urls></urls><volume><style face="normal" font="default" size="100%">78</style></volume><pages><style face="normal" font="default" size="100%">203–250</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;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.&lt;/p&gt;
</style></abstract></record><record><source-app name="Biblio" version="7.x">Drupal-Biblio</source-app><ref-type>47</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Satya S. Sahoo</style></author><author><style face="normal" font="default" size="100%">Olivier Bodenreider</style></author><author><style face="normal" font="default" size="100%">Pascal Hitzler</style></author><author><style face="normal" font="default" size="100%">Amit Sheth</style></author><author><style face="normal" font="default" size="100%">Krishnaprasad Thirunarayan</style></author></authors><secondary-authors><author><style face="normal" font="default" size="100%">Michael Gertz</style></author><author><style face="normal" font="default" size="100%">Bertram Ludäscher</style></author></secondary-authors></contributors><titles><title><style face="normal" font="default" size="100%">Provenance Context Entity (PaCE): Scalable Provenance Tracking for Scientific RDF Data</style></title><secondary-title><style face="normal" font="default" size="100%">Scientific and Statistical Database Management, 22nd International Conference, SSDBM 2010</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Biomedical knowledge repository</style></keyword><keyword><style  face="normal" font="default" size="100%">Context theory</style></keyword><keyword><style  face="normal" font="default" size="100%">Provenance context entity</style></keyword><keyword><style  face="normal" font="default" size="100%">Provenance Management Framework.</style></keyword><keyword><style  face="normal" font="default" size="100%">Provenir ontology</style></keyword><keyword><style  face="normal" font="default" size="100%">RDF reification</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2010</style></year></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://dx.doi.org/10.1007/978-3-642-13818-8_32</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer</style></publisher><pub-location><style face="normal" font="default" size="100%">Heidelberg, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">6187</style></volume><pages><style face="normal" font="default" size="100%">461–470</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p class=&quot;rtejustify&quot;&gt;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.&amp;nbsp;&lt;/p&gt;
</style></abstract></record></records></xml>