Foundations for the Web of Information and Services
Dieter Fensel Editor
Foundations for the Web of Information and Services A Review of 20 Years of Semantic Web Research
Editor Dieter Fensel STI Innsbruck, ICT-Technologiepark University of Innsbruck Technikerstr. 21a Innsbruck 6020 Austria
[email protected]
ISBN 978-3-642-19796-3 e-ISBN 978-3-642-19797-0 DOI 10.1007/978-3-642-19797-0 Springer Heidelberg Dordrecht London New York Library of Congress Control Number: 2011929496 © Springer-Verlag Berlin Heidelberg 2011 This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. Cover design: deblik, Berlin Printed on acid-free paper Springer is part of Springer Science+Business Media (www.springer.com)
Foreword: A History of the Semantic Web
In putting together this volume in honor of Professor Rudi Studer, it was realized that the origins of much of this work were somewhat obscure, and that some history would help people to understand the origins of the papers included in this volume. It was also realized that the number of the key early projects in which Rudi participated would help to make it clear that he was an important player in the founding of this important technology. By dint of being one of the other folks who was around “from the beginning,” I was asked if I would write up this brief introduction. In honor of Rudi, I’m happy to accept.
In the Beginning It is hard to know who first had the idea of creating a language on the World Wide Web that could be used to express the domain knowledge needed to improve Web applications. By the mid 1990s, before most people even knew the Web existed, several research groups were playing with the idea that if web markup (it was all HTML back then) contained some machine readable “hints” to the computer, then we could do a better job of Web tasks like search, query, and faceted browsing. It’s important to note that at that time, the potential power of the Web was still being debated, and there were many who were sure it would fail. However, by 1997 or so, it was clear the Web was going to be around for a while, and there was a burst of energy going on. Various people were publishing algorithms suggesting that different approaches could be used for searching the Web than the traditional AI approaches, and it was around this time that Sergey Brin and Larry Page published their famous “PageRank” paper, which led to the creation of Google and the growth of the modern search engine.1 1I
mention this here as I often hear people saying that the Semantic Web was created to improve search. That is partly true, but it is important to note that search as we knew it back then, preGoogle, was not the same as the current keyword search that powers so much of the modern Web. v
vi
Foreword: A History of the Semantic Web
At this time, we also see the first “real” refereed publications coming about machine-readable knowledge on the Web. One of these approaches was the SHOE (Simple HTML Ontology Extensions) project which I led at the University of Maryland.2 Another was the ONTOBROKER project led by Dieter Fensel and Rudi Studer.3 The slogan for the SHOE project, which continues to be a popular quote in Semantic Web topic, was on shirts we had printed ca. 1998, “A little semantics goes a long way.” This idea drove the early work in projects like SHOE and Ontobroker, and it is important to note that while these early projects looked at what we now call “web ontology languages,” they were driven less by the AI-inspired push for expressive languages, and more by the needs of the emerging Web—what we would now call semantic annotation or tagging. About that same time, a research effort was growing in Europe that merged two main trends, an effort called XOL (XML Ontology Language) and the work growing out of Ontobroker. The new effort was named OIL (which at various times had slightly different acronyms, but mostly it became known as the Ontology Interchange Language). OIL had significant support from Description Logic (DL) researchers, which is to a large degree why many of the later ontology languages used DL for their logical modeling. In parallel with this Web representation work, the World Wide Web consortium (W3C) had begun to explore whether some sort of Web markup language could be defined to help bring data to the Web. The Metadata Content Framework4 working group was drafting a language that was later to be named the Resource Description Format (RDF). I will not recap the history of the split between XML and RDF, it was more political than technical, but suffice to say it added some confusion to the industrial story.5
Increasing Research Interest In 1999, I began a three year position as a funding agent for the US’ Defense Advanced Research Projects Agency and convinced them to invest in this emerging technology area. My primary argument was that this could be used to help solve a lot of the DoD’s (and, of course, everyone else’s) data integration problems. To help sell the US government on funding this research area, the techniques pioneered in ONTOBROKER and SHOE were used to build some demos showing the potential for these new languages. Based on these demos, a project called the DARPA Agent Markup Language (DAML) was launched. MIT’s Semantic Web Advanced Development, led by Tim 2 http://www.cs.umd.edu/projects/plus/SHOE/. 3 http://ontobroker.semanticweb.org/. 4 http://www.w3.org/TR/NOTE-MCF-XML-970624/. 5 The
2002 paper “XML and the Semantic Web” addresses some of this background http://www. ulitzer.com/?q=node/40496.
Foreword: A History of the Semantic Web
vii
Berners-Lee, was funded under this program, with a proposal to base the emerging language in the emerging Resource Description Framework language. RDF, like SHOE, used Universal Resource Indicators (URIs) to name concepts, an important aspect of “webizing” the representation languages for the Web. Along the way, the community (both research and industrial) came to accept Tim’s name for this work: The Semantic Web. In actuality, it is worth noting that the Semantic Web was a realization of part of Tim’s original conception of the Web. In fact, in a 1994 talk he said: Documents on the web describe real objects and imaginary concepts, and give particular relationships between them. . . . For example, a document might describe a person. The title document to a house describes a house and also the ownership relation with a person. . . . This means that machines, as well as people operating on the web of information, can do real things. For example, a program could search for a house and negotiate transfer of ownership of the house to a new owner. The land registry guarantees that the title actually represents reality. As this work grew, it was decided that an effort was needed to bring together the key players in this emerging area. The outcome of this was a Dagstuhl Workshop entitled “Semantics for the Web” which was held in March of 2000.6 It was chaired by Dieter Fensel, Wolfgang Wahlster, Henry Lieberman and me. One of the first people we invited was Rudi, as we knew his group was beginning to do exciting work in this area. The workshop was quite successful, leading to an increasing realization that this new technology had significant potential.7 Also in 2000, I held a meeting with Hans-Georg Stork, then working for the European Commission funding AI research. We met to discuss the possibility of an international effort to bring forth a standard language, rather than to have competing US (DAML) and European (OIL) efforts. Based on these discussions, and the approval of our respective organizations, a group called the “Ad hoc US/EU Working Group on Agent Markup Languages” was formed. (Rudi was an active member of this group.) Despite its unwieldy name, the group met on a regular basis and created a language that integrated the best features of the DAML language emerging from the DARPA program and the OIL language coming from the EU researchers. The resulting language, which was called DAML + OIL, became a de facto standard used in research efforts on both sides of the Atlantic. Another important event in showing the academic respectability of the emerging field was the publication of the first Semantic Web thesis. Jeff Heflin, a student in the SHOE group at Maryland started playing extended the annotation language to include a rule-based reasoner, a Web scraper for extracting SHOE from nonannotated Web sites, a visual query by example system and a bunch of other things. His thesis8 included the first formal description of the Semantic Web—defined in terms of multiple ontologies linked together. 6 http://www.dagstuhl.de/en/program/calendar/semhp/?semnr=00121. 7 Many
of the papers from this workshop appeared in the MIT Press Book Spinning the Semantic Web, edited by the four workshop organizers.
8 Available
online at http://www.cse.lehigh.edu/~heflin/pubs/heflin-thesis.pdf.
viii
Foreword: A History of the Semantic Web
Not long after, several European theses on the use of semantics on the Web were completed (and of course one of the leading universities in this was the University of Karlsruhe under Rudi). These theses expanded the work well beyond Jeff’s start, adding technologies such as text-mining, ontology development and learning, automated reasoning, and many others. The growing community, funded by DARPA in the US and the Information Society Technologies (IST) Program9 in the EU, realized it needed to come together more formally, and in 2001 formed a symposium held in San Francisco in 2000, that evolved the following year into the International Semantic Web Conference (ISWC) which has been held every year since. ISWC is run by an international organization called the “Semantic Web Science Association10 ” and at the first meeting of this organization, Rudi was elected the President of SWSA, a role he filled until 2008 when, at the end of his second three-year term, he moved on to the Past President role. Starting in 2001, a great deal of research went into developing ontologies on the Web, funded to a large degree by IST funding to researchers coming out of the AI community. While RDF development continued, and the redesigned RDF and RDF Schema became recommendations in 2004, there was a more visible effort going on in the world of ontology languages. Based on the DAML + OIL work, the World Wide Web Consortium created the “Web Ontology Working Group” (often referred to as WOW-G), which created the Web ontology language OWL. (OWL also became a W3C recommendation in 2004.) OWL remains the primary language being used in current AI-based Semantic Web work, its reference manuals have been translated into a number of languages, and there are a number of books available on OWL use. Rudi’s research groups, of course, were major players in the IST framework projects, in the design of OWL, and in a number of other important aspects of the emerging Web ontology world. In short, no matter where one looked during the formative days of the Semantic Web, Rudi and/or members of a research group he ran were always present.
Forward to the Present Since the goal of this foreword was primarily to discuss the earlier history of the Semantic Web, I won’t spend a lot of time on the intervening years from then to now. I do however want to talk about one aspect of the Semantic Web community that has emerged in the years since. As mentioned previously, much of the work in the early Semantic Web research community was funded in the AI space for work in ontologies. However, around 2006, as the weaknesses in pure social tagging became more and more evident, and 9 This was later renamed the Information and Communication Technologies area, which funded the
large Framework 6 and Framework 7 EU projects. 10 http://www.iswsa.org/.
Foreword: A History of the Semantic Web
ix
as the Semantic Web query language, SPARQL,11 joined the W3C’s growing stack of Semantic Web recommendation and reports, Web application developers became more and more interested in the Semantic Web languages, but primarily the use of RDF as part of the Web architecture (perhaps enhanced with a few terms from RDFS and OWL, but primarily using very little OWL). This community, which is sometimes called the “linked data” community, because it takes much of its inspiration from the earlier “Web of Data” aspects of the Semantic Web, focuses much more on the scaling and Web application use of semantic technologies, and much less on the expressive ontologies of the research community. At this point in 2010, both communities are healthy, although the linked-data community is showing up far more in applied work, as it makes use of the more mature parts of the Semantic Web technology stack and as it fits nicely with some of the business needs of the modern Web community. In recent days, there have been announcements of the use of RDF-based technologies by Facebook and Twitter, Semantic Search is being actively pursued at Google, Microsoft Live Labs and other large Web companies. A number of small “Web 3.0” companies have emerged, and many of these use some simple ontologies, and a lot of data, to try to gain an advantage over their competitors. Countries around the world are starting to explore the exporting of data to the linked data world, led by efforts in the UK (http://data.gov.uk) and the US (http://data.gov). This primarily non-academic use of Semantics has not been largely powered by expressive ontologies, but rather by simpler data structures and very simple vocabularies. As I write this, Facebook’s “Open Graph Protocol” (OGP)12 is emerging as a widely used technology on the Web. The “ontology” (if one could call it that) of the OGP is very simple, consisting of a few main properties such as title, type, image and URL. So, for example, the open government data project at RPI (http://logd.tw.rpi.edu) has a like button on it. The embedded RDFa reads: ...
This enables any user to click on the Web page and say (on their Facebook page) that they like this Web site. This may not seem very much like AI (it’s not), nor very much in the way of linked data (the type field is just a string), but these little bits of RDFa are starting to show up on thousands of Web sites, and it is not too unlikely that OGP will soon be the most used ontology in history, given the power of Facebook in the Web world. There is also growing interest in mechanisms for 11 http://www.w3.org/TR/rdf-sparql-query/. 12 See
http://developers.facebook.com/docs/opengraph for more details.
x
Foreword: A History of the Semantic Web
having the type fields contain reference to online vocabularies (such as SKOS files) increasing the interest in these other, simple, Semantic Web products. It probably will come as no surprise to the readers of this book that within the Semantic Web research world, there is some tension between those who believe that expressive KR is the future of the technology, and those who feel that studying scaling, data integration and the appropriate use of language and semantic data technologies are the way to go. Most research groups are heavily involved in one or the other of these, and it is clear that in many places, bringing together the linked-data and Semantic Web worlds will be a considerable effort. I was thus extremely pleased on a recent visit to “Semantic Karlsruhe,” where there are several research groups and many projects led by Rudi, to discover that not only were there a number of researchers working in each of these areas, but that they knew and respected each others’ work. New ideas in the combination of these technologies and in finding “middle ground” for exploring with new Semantic Web projects is clearly something we see happening there, a promising sign for the future of both sides of the Semantic Web community.
What Comes Next? As the Semantic Web is starting to flourish in the applied research community and to transition from our laboratories to the “real world” of the Web, there is clearly a lot of discussion as to the future of the research enterprise in semantics. As this was not what I was asked to write about, I’ll hold my opinions on this for some later, more contentious, article. However, there is one opinion I hold that I have not heard anyone dispute—I believe that, as he has been since the beginning of the Semantic Web work, Rudi will be a leading researcher in whatever the future brings. Troy, USA August, 2010
Jim Hendler
Preface
I met Rudi more than 20 years ago, while I was searching for a place to do a PhD on Artificial Intelligence. Originally, I was more interested in Machine Learning but with his great spirit of non-directional leadership, Rudi slowly moved me in the direction of knowledge acquisition and knowledge engineering. What surprised me most about these areas was that they looked more like applied sociology than computer science, and only the recent web science adventure surprised me even more. Anyway, I followed his advice-for many years trying to discover what the “formal semantics” of these areas really were. After earning my PhD with Rudi and my interesting research period in Amsterdam, I really gained some insight and got excited about it. I focused on heuristic problem solvers and tried to answer the questions of why and when they are better than global problem solvers. In the end, all our life is about compromising results by restricting effort. This culminated in an exciting Habilitation that, aside from myself, very few people in the world have ever understood.1 Then Rudi shocked me once again. Basically, he told me that I should either focus on something simpler, or I should forget the idea of ever getting a Professorship. I did not like his message but I felt he was right. Reality was simply not ready for my genius. He proposed that I work on Ontologies. Frankly, I hated this suggestion as I regarded Ontologies as quite a boring area of Science and Engineering. First, they are only about data structure, where very few dynamic events happen. Second, most Ontologists have missed the last five hundred years of philosophical development that introduced the notion of an observer and his perspective on any world view. Even conservative physicians had to adopt this point of view nearly one hundred years ago. It was naive of me to assume to know THE model of reality, and to be surprised that others do not share this point of view. That is really not appropriate to the state of philosophy after Descartes and others. Anyway, I had been infected with a virus in Amsterdam that generated an interesting potential of using Ontologies as flexible data schemas. It was the Web. Academics from the hypertext area found 1 My
colleague Enrico Motta from Open University managed to implement some pieces of this grand vision. xi
xii
Preface
the Web primitive, academics from the database area found it even illegal, but I got caught by it. So in Karlsruhe in 1996, we began to work on extending HTML by means of adding semantics to textual and graphical information on the Web. Happily, we found similar work published by Jim Hendler’s group and throgh Tim Berners-Lee’s work, and then later the RDF work of W3C. This period of time significantly changed my life and I would like to thank Rudi for the great support he gave me for nearly a decade and for the great cooperation we have had since then. Therefore, it is my duty and pleasure to edit this “Festschrift” that has collected contributions from his colleagues and academic offspring. The book starts with a preface by Jim Hendler that you have already read if you are reading this book in linear order. He provides a historical view on the development of semantic web research and we would like to mention again his early work on SHOE that was a great encouragement for our work. We then collected six contributions from Rudi’s peers (and actually, one ‘super peer’ is included). The core usage of semantic technology is to provide scalable means to achieve interoperability in large, distributed, heterogeneous, and dynamic environments. The article by Haslhofer and Neuhold2 puts Rudi’s work in context by providing a retrospective on semantics and interoperability research as applied in computer science. His colleagues Oberweis, Schmeck, Seese, Stucky, and Tai from the Institute AIFB, relate Rudi’s work to other areas of applied computer science such as Logic, Complexity Management, Efficient Algorithms, Organic Computing, and Business Process Management. There has always been a close link between semantic technology and database technology on the one hand, and knowledge technology on the other. One could even argue that there is a complexity chain of data, information, and knowledge where semantics is mostly busy with the intermediate item, i.e., information. The article contributed by Lockemann, a colleague from the University of Karlsruhe, provides an excellent analysis of the communalities and differences between database and Ontology technology in terms of efficiency and effectiveness. Personally, I think this article already makes this book a good buy! Van Harmelen and Ten Teije from the VU Amsterdam and Wache from the University of Applied Science in Switzerland take a look from the opposite angle, considering semantics from the knowledge technology perspective. Their work on knowledgebased web service selection discusses a pathway for reunifying heuristic problem solving with semantic web technology. The application of semantic technologies for knowledge management issues is discussed in the article by Davies, British Telecom, Warren, Eurescom, and Sure,3 GESIS and the University of Koblenz-Landau. Using semantics for knowledge management also indicates that the borderline between semantic and knowledge technology is at least as fuzzy as the borderline between database and semantic technology. Finally, Horrocks, from the University of Oxford, takes a technical view on the core of semantic technology, focussing on tools to work and reason with Ontologies. 2 Obviously,
it is the role of Erich Neuhold to put the work of Rudi in context!
3 Each classification system has to deal with exceptions. York Sure is actually an academic offspring
of Rudi.
Preface
xiii
These articles are followed by eleven contributions provided by Rudi’s Academic offspring. Four articles are about the Web of data, information and knowledge, focusing on knowledge mining, knowledge networks, and knowledge diversity. The following four articles go beyond the static web of data and discuss the role semantic technology can play in the Web of software and services by modeling software, services, cloud computing, and event-driven architectures. Finally, applications of semantic technology are discussed for knowledge management scenarios. I wish Rudi many more years of productivity and I am looking forward to cooperating with him in as many projects in the future as we have in the past.
Acknowledgment I would like to thank Amy Anna Mary Strub for her excellent work as English proofreader, and Birgit Leiter for making it possible to publish this book on time. Furthermore, I would like to thank FZI, GESIS, KIT/AIFB, ontoprise GmbH, STI Innsbruck, STI International and WeST for their sponsorship and great support. Innsbruck, Austria November, 2010
Dieter Fensel
Sponsor Information
FZI Application research in the fields of information technology, engineering and economics with reliable knowledge and technology transfer is the core business and expertise of FZI Forschungszentrum Informatik. As a non-profit institution, established 25 years ago by the State of Baden-Württemberg and the University of Karlsruhe (now Karlsruhe Institute of Technology) we deliver the results of scientific research directly to you. As an independent research institution, FZI works for companies and public institutions regardless of company size: from small business to large corporations, from local public administrations to the European Union.
GESIS As the largest infrastructure facility in Germany, GESIS offers a variety of services related to the social sciences. Based on original research and experience, the scientific community finds a wide range of services, consultation, data, and information at all stations of the research data lifecycle from information research and survey design, data collection, archiving, registration, and provision to data analysis.
xv
xvi
Sponsor Information
KIT/AIFB The Karlsruhe Institute of Technology (KIT) is the merger of the former Universität Karlsruhe (TH) and the former Forschungszentrum Karlsruhe. With about 8000 employees and an annual budget of 700 million Euros, KIT is the largest technical research institution within Germany. The Institute AIFB (Applied Informatics and Formal Description Methods) at KIT is one of the world-leading institutions in Semantic Web technology. Approximately 20 researchers of the knowledge management research group are establishing theoretical results and scalable implementations for the field, closely collaborating with the sister institute KSRI (Karlsruhe Service Research Institute), the start-up companies ontoprise and fluid Operations, and the Knowledge Management group at the FZI Research Center for Information Technologies.
ontoprise GmbH ontoprise GmbH is a leading provider of products, solutions and services in the area of semantic technologies. These make it possible to: Describe the meaning of information to be machine-readable, structure knowledge, record complex interrelationships and to integrate distributed information. Thereby, employees involved in knowledge-intensive processes are optimally supplied with the right information. Additionally, companies are empowered in making the right conclusions from existing information.
STI Innsbruck The Semantic Technology Institute (STI) Innsbruck (http://www.sti-innsbruck. at), formerly known as DERI Innsbruck, was founded in 2002 and has developed into a challenging and dynamic research institute. Through STI International, we collaborate with a network of international institutes and global industrial partners
Sponsor Information
xvii
in Asia, Europe and the USA. Our major objective is to establish Semantic technologies as a core pillar of modern Computer Science, thereby providing interoperability and scalability for the web of data and services.
STI International STI International is a global network carrying out research, education, innovation and commercialization activities on semantic technologies facilitating their deployment within industry and society at large. STI International is organized as a collaborative association of interested scientific, industrial and governmental parties that share a common vision. It sets up its own research infrastructure and implements public and internal services that support the individual partner organizations in their research collaboration, standardization, dissemination and exploitation activities
WeST The institute “WeST—Web Science and Technologies” works on issues related to the usage and the technologies of the World Wide Web. Researchers consider the technical aspects of the Web being a globally networked information system and information services as well as the personal and social aspects of Web usage. They aim at understanding the structure and evolution of the Web, for making the Web even more useful and for ensuring its future prosperity and usefulness. Germane to these aspects are the novel technologies of the Semantic Web, Web Retrieval, Multimedia Web, Interactive Web and the Software Web.
Contents
Part I
Colleagues and Historical Roots
A Retrospective on Semantics and Interoperability Research . . . . . . . Bernhard Haslhofer and Erich J. Neuhold Semantic Web and Applied Informatics: Selected Research Activities in the Institute AIFB . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andreas Oberweis, Hartmut Schmeck, Detlef Seese, Wolffried Stucky, and Stefan Tai Effectiveness and Efficiency of Semantics . . . . . . . . . . . . . . . . . . Peter C. Lockemann Knowledge Engineering Rediscovered: Towards Reasoning Patterns for the Semantic Web . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Frank van Harmelen, Annette ten Teije, and Holger Wache Semantic Technology and Knowledge Management . . . . . . . . . . . . John Davies, Paul Warren, and York Sure
3
29
41
57 77
Tool Support for Ontology Engineering . . . . . . . . . . . . . . . . . . . 103 Ian Horrocks Part II
Academic Legacy
Combining Data-Driven and Semantic Approaches for Text Mining . . . 115 Stephan Bloehdorn, Sebastian Blohm, Philipp Cimiano, Eugenie Giesbrecht, Andreas Hotho, Uta Lösch, Alexander Mädche, Eddie Mönch, Philipp Sorg, Steffen Staab, and Johanna Völker From Semantic Web Mining to Social and Ubiquitous Mining . . . . . . . 143 Andreas Hotho and Gerd Stumme Towards Networked Knowledge . . . . . . . . . . . . . . . . . . . . . . . 155 Stefan Decker, Siegfried Handschuh, and Manfred Hauswirth xix
xx
Contents
Reflecting Knowledge Diversity on the Web . . . . . . . . . . . . . . . . . 175 Elena Simperl, Denny Vrandeˇci´c, and Barry Norton Software Modeling Using Ontology Technologies . . . . . . . . . . . . . . 193 Gerd Gröner, Fernando Silva Parreiras, Steffen Staab, and Tobias Walter Intelligent Service Management—Technologies and Perspectives . . . . . 215 Sudhir Agarwal, Stephan Bloehdorn, and Steffen Lamparter Semantic Technologies and Cloud Computing . . . . . . . . . . . . . . . . 239 Andreas Eberhart, Peter Haase, Daniel Oberle, and Valentin Zacharias Semantic Complex Event Reasoning—Beyond Complex Event Processing 253 Nenad Stojanovic, Ljiljana Stojanovic, Darko Anicic, Jun Ma, Sinan Sen, and Roland Stühmer Semantics in Knowledge Management . . . . . . . . . . . . . . . . . . . . 281 Andreas Abecker, Ernst Biesalski, Simone Braun, Mark Hefke, and Valentin Zacharias Semantic MediaWiki . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 311 Markus Krötzsch and Denny Vrandeˇci´c Real World Application of Semantic Technology . . . . . . . . . . . . . . 327 Juergen Angele, Hans-Peter Schnurr, Saartje Brockmans, and Michael Erdmann
Contributors
Andreas Abecker FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected]; disy Informationssysteme GmbH, Karlsruhe, Germany,
[email protected] Sudhir Agarwal Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany,
[email protected] Juergen Angele ontoprise GmbH, An der RaumFabrik 29, 76227 Karlsruhe, Germany,
[email protected] Darko Anicic FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Ernst Biesalski EnBW Energie Baden-Württemberg AG, Karlsruhe, Germany,
[email protected] Stephan Bloehdorn Karlsruhe Institute of Technology (KIT), Karlsruhe, Germany,
[email protected] Sebastian Blohm Microsoft Search Technology Center Europe, Munich, Germany,
[email protected] Simone Braun FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Saartje Brockmans ontoprise GmbH, An der RaumFabrik 29, 76227 Karlsruhe, Germany,
[email protected] Philipp Cimiano Semantic Computing Group, Cognitive Interaction Technology Excellence Center (CITEC), University of Bielefeld, Bielefeld, Germany,
[email protected] John Davies Future Business Applications and Services, BT Innovate and Design, British Telecommunications Plc., Ipswich, UK,
[email protected] xxi
xxii
Contributors
Stefan Decker Digital Enterprise Research Institute (DERI), National University of Ireland, Galway, IDA Business Park, Lower Dangan, Galway, Ireland,
[email protected] Andreas Eberhart Fluid Operations, 69190 Walldorf, Germany,
[email protected] Michael Erdmann ontoprise GmbH, An der RaumFabrik 29, 76227 Karlsruhe, Germany,
[email protected] Eugenie Giesbrecht FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Gerd Gröner Institute for Web Science and Technologies, University of KoblenzLandau, Universitätsstrasse 1, Koblenz 56070, Germany,
[email protected] Peter Haase Fluid Operations, 69190 Walldorf, Germany,
[email protected] Siegfried Handschuh Digital Enterprise Research Institute (DERI), National University of Ireland, Galway, IDA Business Park, Lower Dangan, Galway, Ireland,
[email protected] Frank van Harmelen Dept. of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands,
[email protected] Bernhard Haslhofer Department of Distributed and Multimedia Systems, University of Vienna, Liebiggasse 4/3-4, 1010 Vienna, Austria,
[email protected] Manfred Hauswirth Digital Enterprise Research Institute (DERI), National University of Ireland, Galway, IDA Business Park, Lower Dangan, Galway, Ireland,
[email protected] Mark Hefke Manager Innovation & Business Development, CAS Software AG, Karlsruhe, Germany,
[email protected] Ian Horrocks Department of Computer Science, University of Oxford, Oxford, UK,
[email protected] Andreas Hotho Data Mining and Information Retrieval Group, University of Würzburg, 97074 Würzburg, Germany,
[email protected] Markus Krötzsch Oxford University Computing Laboratory, University of Oxford, Oxford, UK,
[email protected] Uta Lösch Karlsruher Institut für Technologie, Karlsruhe, Germany,
[email protected] Steffen Lamparter Siemens AG, Corporate Technology, Munich, Germany,
[email protected]
Contributors
xxiii
Peter C. Lockemann Karlsruhe Institute of Technology (KIT), Department of Informatics, 76128 Karlsruhe, Germany,
[email protected]; Forschungszentrum Informatik, Karlsruhe, Germany Alexander Mädche Institute for Enterprise Systems (InES), University of Mannheim, Mannheim, Germany,
[email protected] Eddie Mönch ontoprise GmbH, Karlsruhe, Germany,
[email protected] Jun Ma FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Erich J. Neuhold Department of Distributed and Multimedia Systems, University of Vienna, Liebiggasse 4/3-4, 1010 Vienna, Austria,
[email protected] Barry Norton Institut AIFB, Karlsruhe Institute of Technology, Karlsruhe, Germany,
[email protected] Daniel Oberle SAP Research, 76131 Karlsruhe, Germany,
[email protected] Andreas Oberweis Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany,
[email protected] Fernando Silva Parreiras Institute for Web Science and Technologies, University of Koblenz-Landau, Universitätsstrasse 1, Koblenz 56070, Germany,
[email protected] Hartmut Schmeck Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany,
[email protected] Hans-Peter Schnurr ontoprise GmbH, An der RaumFabrik 29, 76227 Karlsruhe, Germany,
[email protected] Detlef Seese Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany,
[email protected] Sinan Sen FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Elena Simperl Institut AIFB, Karlsruhe Institute of Technology, Karlsruhe, Germany,
[email protected] Philipp Sorg Karlsruher Institut für Technologie, Karlsruhe, Germany,
[email protected] Roland Stühmer FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Steffen Staab Institute for Web Science and Technologies, University of KoblenzLandau, Universitätsstrasse 1, Koblenz 56070, Germany,
[email protected] Ljiljana Stojanovic FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected] Nenad Stojanovic FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected]
xxiv
Contributors
Wolffried Stucky Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany,
[email protected] Gerd Stumme Knowledge & Data Engineering Group, University of Kassel, 34121 Kassel, Germany,
[email protected]; L3S Research Center, Hannover, Germany York Sure GESIS—Leibniz Institute for the Social Sciences and Institute WeST, University of Koblenz-Landau, Mannheim, Germany,
[email protected]; Professor for Applied Informatics in the Social Sciences, University of KoblenzLandau, Koblenz, Germany,
[email protected] Stefan Tai Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany,
[email protected] Annette ten Teije Dept. of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands,
[email protected] Johanna Völker KR & KM Research Group, University of Mannheim, Mannheim, Germany,
[email protected] Denny Vrandeˇci´c Institut AIFB, Karlsruhe Institute of Technology, Karlsruhe, Germany,
[email protected] Holger Wache School of Business, University of Applied Sciences Northwestern Switzerland (FHNW), Brugg, Switzerland,
[email protected] Tobias Walter Institute for Web Science and Technologies, University of KoblenzLandau, Universitätsstrasse 1, Koblenz 56070, Germany,
[email protected] Paul Warren Eurescom GmbH, Heidelberg, Germany,
[email protected] Valentin Zacharias FZI Forschungszentrum Informatik, Karlsruhe, Germany,
[email protected]
Part I
Colleagues and Historical Roots
A Retrospective on Semantics and Interoperability Research Bernhard Haslhofer and Erich J. Neuhold
Abstract Interoperability is a qualitative property of computing infrastructures that denotes the ability of sending and receiving systems to exchange and properly interpret information objects across system boundaries. Since this property is not given by default, the interoperability problem and the representation of semantics have been an active research topic for approximately four decades. Early database models such as the Relational Model used schemas to express semantics and implicitly aimed at achieving interoperability by providing programming independence of data storage and access. Thereafter the Entity Relationship Model was introduced providing the basic building blocks of modeling real-world semantics. With the advent of distributed and object-oriented databases, interoperability became an obvious need and an explicit research topic. After a number of intermediate steps such as hypertext and (multimedia) document models, the notions of semantics and interoperability became what they have been over the last ten years in the context of the World Wide Web. With this article we contribute a retrospective on semantics and interoperability research as applied in major areas of computer science. It gives domain experts and newcomers an overview of existing interoperability techniques and points out future research directions.
1 Introduction Whenever an application processes data it must reflect the meaning—the semantics—of these data. Since this awareness is not given by default, the application designer needs to define a model, identify and structure atomic data units, and describe their meaning. Only if an application is aware of the structure and semantics of data, can it process them correctly. In this context, we often find the distinction between data, information, and knowledge, which has been the subject of intensive discussions in the Information Science literature for years. For a more comprehensive and actual discussion of these terms we refer to Rowley [53]. Here, we simply B. Haslhofer () Department of Distributed and Multimedia Systems, University of Vienna, Liebiggasse 4/3-4, 1010 Vienna, Austria e-mail:
[email protected] D. Fensel (ed.), Foundations for the Web of Information and Services, DOI 10.1007/978-3-642-19797-0_1, © Springer-Verlag Berlin Heidelberg 2011
3
4
B. Haslhofer and E.J. Neuhold
define data as being symbols without any meaning and information objects as being a collection of data that carry semantics, which is a pre-condition for correct interpretation. Interoperability problems arise when distinct applications communicate and exchange information objects with each other: often the structure and semantics of these objects is defined by autonomous designers, each having an individual interpretation of the real world in mind. When an object leaves the boundary of a sending system or application, the interpretation of these objects in a receiving application is often not possible due to the heterogeneities between the involved applications. The problem of how to represent semantics and how to establish interoperability between information objects in distinct autonomous, distributed, and heterogeneous information systems has been a central and very active topic in database and information systems research throughout the past four decades. While the motivation in early database systems was to achieve data independence and interoperation for data-oriented applications, the topic has become increasingly important with the advent of distributed (multimedia) databases and information systems. Today it is still a major research issue in the largest currently existing (multimedia) information system—the World Wide Web. The heterogeneities that impede systems and applications from being interoperable were investigated several times in different domains (e.g., [50, 54, 60, 62]). Although the notions vary, we can broadly categorize them as follows: – Technical Heterogeneities: denotes all system platform and exchange protocol differences that prevent applications from sending and receiving information objects. – Structural and Syntactic Heterogeneities: occur when data units in information objects are represented using different structures and syntactic conventions. – Semantic Heterogeneities: are conflicts that occur because of the differences in the semantics of data units. Analogous to these heterogeneity definitions we can define the various types of interoperability that can be achieved: technical, structural and syntactic, and semantic interoperability. In the following, when we use the term interoperability, we mainly refer to the latter two notions. Before proceeding with our analysis of the various approaches that were developed for achieving interoperability, we introduce an illustrative example, which we will use throughout this work to explain the technical characteristics of these approaches. We assume a scenario in which two film studios, denoted as Studio A and Studio B, independently set up internal movie databases. Over the years both studios collected a large amount of data about movies; they have now decided to share and exchange these data. Figure 1 depicts the differences in how these two studios represent information about the same real-world movie. We allow that an actor can play in several movies and a movie has several actors. The notation we are using here is abstract and represents only the available information. It is not bound to any semantic modeling technique because this is what we want to achieve in the subsequent sections.
A Retrospective on Semantics and Interoperability Research
5
Fig. 1 Illustrative Example. Studio A records for each Movie its title, the year when it was first presented, the genre, its length, and the stars playing in the movie. Studio B records for each Film the title, the releaseYear, the genre, the length, and for each starring role the name and birthDate of the Actor
Fig. 2 Semantics and Interoperability Research in Computer Science
The aim of this chapter is to provide a retrospective on the developments in semantics and interoperability research throughout the past four decades from the perspective of database and information system research. Solutions developed by other disciplines (e.g., Information Retrieval, Data Mining, or Artificial Intelligence), that of course encounter similar problems, are out of the scope of this paper. We will present a selected but, as we believe, representative set of approaches that enable the expression of data semantics and/or allow us to deal with the heterogeneities between applications. Our illustrative example will help us to explain the technical characteristics of some of these approaches. As illustrated in Fig. 2, we start our retrospective in the early 1970s and present early database models in Sect. 2. Then, in Sect. 3, we move along to distributed databases and object-oriented database models, which allow application-oriented and context-dependent design of databases. In Sect. 4, we describe major models and languages for the representation of semantics in distributed and heterogeneous information systems. Then, in Sect. 5, we describe the Semantic Web and the ideas behind the currently on-going Linked Data movement as a way to represent data semantics on the Web. Finally, we summarize our retrospective in Sect. 6 and give an outlook on future research topics in the area of semantics and interoperability research.
6
B. Haslhofer and E.J. Neuhold
2 Early Database Models Very early in the development of file systems and databases it was realized that a model-driven approach to data storage would allow a better separation between the data stores and the application programs using those data. In a way, this so-called data independence was a first step towards data-oriented interoperation of programs. At the same time this data independence brought explicit semantics into play in the sense that a data model reflected the real world and allowed programmers and end users to better share and understand the meaning of those data and therefore to utilize them more effectively. In this section, we first focus on the Relational Model (Sect. 2.1), which forms the current predominant formal basis for modern database systems. Then we describe the Entity Relationship Model (Sect. 2.2) and other related logical and conceptual data models (Sect. 2.3) from that period.
2.1 The Relational Model In the 1970s, a large number of modeling approaches were proposed, and quite a number of them are still in use today. The Relational Model [19] had a seminal influence on this field because the simplicity of the table-oriented visualization allowed easy understanding and use of the data in a data storage independent way. Each row (tuple) in a relational table describes an entity with named attributes. With its keys, as identifiers, and normal forms (2nd, 3rd, Boyce-Codd etc.), representing functional dependencies, early examples of semantics, i.e., reflections on the properties of the real world, became expressible. Figure 3 shows our illustrative example represented in the Relational Model. After the invention of the Relational Model, several efforts to develop languages for manipulating and retrieving data stored in relational database management systems (RDBMS) started. Initial proposals such as SEQUEL [15], which was developed by IBM, and QUEL, which was part of the INGRES effort [55], merged into the standardized Structured Query Language (SQL), which, until today, has remained the predominant data definition and manipulation language for RDBMS. The goal of the SQL standardization was to provide interoperability for applications so that they could access and manipulate data independently from the underlying RDBMS implementation. Today there are three different SQL standards (SQL, SQL2, SQL-99) in existence and several vendor-specific dialects, which is a major drawback from an interoperability perspective. Soon it became clear that the Relational Model was too restrictive to allow for an easy expression of more sophisticated semantic situations that would be needed when designing databases for multiple applications and usage environments. As a consequence, semantically richer models were developed. One of the first conferences oriented strongly towards semantics was the IFIP TC 2 Working Conference on Database Management Systems held 1974 in Corsica. There, Abrial introduced the Binary Relational Model [4] by defining objects as models of concrete or abstract objects of the real world and binary relations between them. In doing so he
Fig. 3 Relational Model Sample. This example shows how Studio A and B could structure their data in relations. Studio A stores the information about movie and stars in a single relation, which can lead to data redundancies as well as update and deletion anomalies. Studio B decomposed its data into separate relations and thereby eliminates these shortcomings. The choice of keys in B causes a large data load in the Starring relation because the relationship between films and actors is established via their keys and foreign keys
A Retrospective on Semantics and Interoperability Research 7
8
B. Haslhofer and E.J. Neuhold
introduced unique internal identifiers and showed that binary relations were sufficient to model the data-related properties of the real world. Semantics was expressed by object properties like synonyms, equivalence or relational symmetry, reflexivity and transitivity but also by handling three valued logic (true, false, unknown) to allow for an open world assumption. Today we can still find some of these concepts in the RDF model (see Sect. 5.1). At the same conference, Sungren introduced his thesis [57] where he applied, for the first time, the Meta-Information concept for database models. This allows for the representation of even richer semantics about the real world modeled in the database including formal and informal information about objects, properties and relations. Another important aspect of metadata is information like quality of the data, changeability of the model, reliability of the information, the source of the data, etc. Metadata help the designer of the database to decide on the proper schema and help the user when locating relevant information in the database.
2.2 The Entity Relationship Model In 1975, Chen published the Entity Relationship Model (see [17] and [18]). This model streamlined a number of the earlier approaches into the somewhat simpler to understand concepts of Entities, Attributes and Relations as the basic building blocks for modeling the real world. Again, the constraints placed on entities (e.g., cardinality, atomicity), relations (e.g., n : m) and attributes (single- or multi-valued, types) allow for the expression of semantics. The ER model gave rise to a series of conferences starting in 1979 and continuing up until today. The semantic modeling aspect for designing databases as well as the interoperability of programs using those databases was considered in the development and the extensions of the ER model. Up until about 1985 the ER model did not discuss, for instance, is-a and inheritance [23]. Figure 4 shows the Entity Relationship model for our illustrative example.
2.3 Other Models Through the 1970s and to some degree since then, quite a number of additional models were proposed. The Object Role Model (ORM) originally proposed by Falkenberg [25] and Njissen as NIAM [46] was later adopted for the ORM modeling technique which in turn influenced (e.g., Halpin [33]) the data modeling part of the nowadays predominant Unified Modeling Language (UML). Most of these models were developed to allow semantic-oriented design of databases and data independence. Interoperability aspects were only mentioned as borderline criteria. That, however, changed with the Architecture Model of the ANSI/X3/SPARC proposal [5]. This model differentiates between three levels of database schemas:
A Retrospective on Semantics and Interoperability Research
9
Fig. 4 Entity Relationship Model Sample. The example shows how Studio A and B could model their data structures using the Entity Relationship Model (in Chen’s original notation). Studio A models the names of the movie stars as multi-valued attributes (marked with double circles). Studio B models the associations between instances of movies and actors as a relationship. The underlined attributes indicate primary keys
an internal model (e.g., a relational model), a conceptual model (e.g., a global ER Model), and multiple external models representing the usage views of the database and reflecting the individual semantic needs of the usage in a heterogeneous interoperability environment. This immediately led to a number of research issues on how to map the different levels into each other without loss of essential information.
3 Distributed and Object-Oriented Database Systems The powerful (relational) database systems developed in the 1970s ensured data independence and interoperability of application programs. At the same time, it was realized that more powerful data models were needed that expose more of the semantics of these data and allow application-oriented and context-dependent design of databases. In the late 1970s and early 1980s the rise of powerful computer networks began. It was henceforth possible to place data on various computer nodes, either locally or distributed throughout larger networks. In this section, we first describe the research area of distributed databases and how they deal with semantic heterogeneities (Sect. 3.1). Then we introduce the central characteristics of object-oriented database models and systems (Sect. 3.2).
3.1 Distributed databases In the late 1970s, the research field of distributed databases1 grew rapidly in importance. Early papers on distributed databases were Distributed INGRES [56] and 1 See
Ceri et al. [14] for an overview of distributed databases.
10
B. Haslhofer and E.J. Neuhold
Fig. 5 Homogeneous and Heterogeneous Distributed Databases Sample. In (a) we assume that Studio B distributes the relations of its schema to two distinct database systems. In (b) the schema of Studio B serves as global schema and also as local export model of B’s database. A mapping M between the global schema and the local schema of database of Studio A needs to be established in order to bridge the heterogeneities between the involved databases
POREL [45], both approaches based on the Relational Data Model. They introduced the concept of global versus local schemas and the three-level architecture for centralized database systems, which was later extended to five layers: the (multiple) local internal models, the local conceptual models, the local (conceptual) export models, the global (conceptual) model, and the (multiple) external models. In order to design such a system, additional semantic meta-information was needed, as, for example, on the data distribution, the size and break-up of entity sets, the relations between them, the cardinality and selectivity of attributes, etc. The data models had to be extended accordingly, but in many cases those extensions were attached to an underlying relational model and not to the conceptual models of the various layers. The interoperability of applications and databases was then assured via the single global schema that would be used both by the local databases as well as by all of the global applications. It was recognized that in principle two situations for distributed databases can exist: (i) homogeneous and (ii) heterogeneous distributed databases. Figure 5 shows how our illustrative example can be deployed in a distributed setting. In the first case, a top-down design is realized by integrating external schemas into a single global schema. Guided by application-oriented metadata the design of the local schemas for the different computers in the network then follows. Here, considerable research effort was spent on strategies for splitting relations horizontally or vertically but, in retrospect, difficulties often arose from the low level of available semantic information. Some other research prototypes next to Distributed Ingres and POREL are SDD-1 of the Computer Corporation of America [37] and R* of IBM [31]. In the second case, heterogeneous systems follow a bottom-up design to cover situations where a number of pre-existing or autonomous databases must be inte-
A Retrospective on Semantics and Interoperability Research
11
grated into a single data management system in order to be shared by global applications. Using the information contained in the local conceptual schemas and the global knowledge about the applications, the export schemas can be developed and then be integrated into a single global schema by means of a mapping specification. The research prototype MULTIBASE [41] uses Daplex, a logical data specification language, for modeling the various schemas. Heterogeneous SIRIUS-DELTA [42] uses the Relational Model only and demonstrates the integration of PHLOX, which is a database system of the CODASYL Model family. However, it does not provide the equivalent functionality to databases as no real global schema is assumed, no local users are allowed, and mapping functions are to be provided by the local database management systems. As it turns out, homogeneous distributed database systems have become a feature of the major database products, whereas heterogeneous systems are still difficult to handle, even today. The main problems arise from the scarcity of explicit semantics that can be provided for the external schemas and the global applications that use those schemas as well as the semantics for the local schemas used for designing the local databases. With the advent of heterogeneous distributed database systems, the need for model compatibility, data consistency and object identity became apparent when interoperability was to be achieved. In our illustrative example, Studio B uses the attribute BirthDate as part of the primary key for the relation Actors. Studio A represents actors as a multi-valued attribute with the consequence that actors can only be identified by their names; information about an actor’s birthdate is not available in Studio A’s database. Therefore, Studio A cannot distinguish between actors having the same names and runs into problems when integrating its data with those of Studio B: if the schema of Studio B is used as global schema, it is not possible to define identity for the actors from Studio A’s database, because birth dates are not given. The models discussed so far neither allow for the specification of behavior nor are they flexible enough to allow for the expression of properties like equivalence, inheritance, and composition. As a consequence, the attention of the database research community shifted to object-oriented databases that allow for the specification of object identity, structures, semantics, behaviors, and constraints for the objects to be stored in the database as described in the following section.
3.2 Object-Oriented database Models and Systems Even when main stream databases—the relational model based systems, whether central or distributed—were enhanced with Entity Relationship type semantic descriptions, they did not show enough flexibility to support, for instance, the interoperation of heterogeneous systems or the extensibility for new appearing data types like semistructured and unstructured information. BLOBs (Binary Large Objects) used as a first solution actually led to the loss of data independence, a paradigm that originally gave rise to the databases concept.
12
B. Haslhofer and E.J. Neuhold
In the early 1980s, object-oriented programming (Smalltalk, C++) became popular and the need for the persistent storage of those new types of data arose. This triggered research in Object-Oriented Database Management Systems (OODBMS) and Object-Oriented Data Models (OODM), which started simultaneously in many locations. Many prototypes and even some commercial systems became available in the late 80s. An extensive description of those systems can be found in Dogac et al. [21] and also in Bukhres et al. [12]. Basically an object-oriented database model introduces application behavior (semantics) into databases by supporting a number of concepts, some of them well known in the object-oriented programming world, others specific to the persistence mechanism used for storing. – Object Identity: every object has a unique identifier attached permanently at object creation time for object recognition. Unfortunately, this does not solve the object identity problem in heterogeneous systems where for the same real world object two different database objects could have been created. – Type Extensibility: the basic data types in the database can be extended with new basic types and their handling functions. Type constructors would allow for new complex (abstract) data types. The typing systems could allow static binding or dynamic binding of data to the operations. – Object Classes: real-world entities of the same kind, that is, those modeled as objects having the same data types, object attributes, behavior and relationships to other objects, can be collected into a single class. – Inheritance: objects of a subclass (a more specific description) inherit properties of a superclass via the semantic concept of an is-a relationship including inheritance from multiple superclasses, e.g., as in case of the two superclasses SUV and Truck and the subclass SportTruck that has properties of both the SUV and Truck classes. – Object Instance: some OODM allow that an object instance can populate all the superclasses it inherits properties from, others only allow the instance in the ultimate subclass where its most specific description is located. Missing information, later added, would change the class of an object whereas in the first case the object instance only would be added to the newly relevant subclass. The first case would also simplify the problem of interoperability in heterogeneous multi-OODBMSs. Of course it would still not solve the problem of object identity. We believe that no single prototype or product fully supported all the possible features and also that no clear winner has ever been established in the OODBMS world. As it happens, object-oriented features were added by the relational database vendors as object-relational database management systems and today the “pure” OODBMS’s can only be found in niche application fields. A simple example of and OODBM schema is given in Fig. 6. To tackle the problem of heterogeneous distributed OODBMSs with their sometimes distinct formal semantics, more (formal) semantic flexibility was desirable. The VODAK Modeling Language (VML) [39] was an attempt to solve the problem by extending the two level models Application Class and Instance and the relationship is-instance-of with two additional levels, the Meta Class (MC) level and the
A Retrospective on Semantics and Interoperability Research
13
Fig. 6 Object-Oriented (UML) Model. The example shows the schema of Studio B in an object-oriented representation using the UML notation. To illustrate the inheritance feature of OO model, we introduced a superclass Person that defines all the attributes that would describe persons (not only actors) in the real world. The class Actor inherits all the properties from Person and introduces the additional attribute ActivePeriod
Meta-Meta Class (MMC) level (or Root Metaclass). The MC classes would specify the behavior of the specific Class Model, e.g. inheritance of all properties for all subclasses or only for specific properties or no inheritance at all could be specified. In case of heterogeneous OODBMSs, a global schema could then be used to integrate the individual different (formal) models and achieve interoperability between the databases. Today the idea of multi-level model architectures is reflected in the Object Management’s Group (OMG) MOF model [48] and serves as formal basis for UML [49], which is now the de-facto standard for object-oriented application design. However, as it soon turned out, even with the powerful object-oriented models, which allowed for the expression of many real-world semantic properties and behaviors, the expressive power needed in the growing world of multimedia and the World Wide Web was still missing. As a consequence, the OODBMSs never became the database concept envisioned in the late 1980s and early 1990s, despite the fact that some of their features can be found even today in multimedia, document, streaming, etc. data models.
4 Semantics in Distributed and Heterogeneous Information Systems Distributed databases split data across several nodes and increased the performance and scalability in data management. The distinction between different types of schemas and the development of more application-oriented data models such as the Object-Oriented Data Model introduces novel ways of expressing data semantics. However, with the rapidly increasing size of local and wide area computer networks, those established database-oriented interoperability mechanisms turned out to be insufficient due to the technical heterogeneities of the involved network nodes. In the late 1980s and early 90s information integration started to become an active research field having the goal to provide uniform access to data stored in distributed, heterogeneous, and autonomous systems. The Semistructured Data Model
14
B. Haslhofer and E.J. Neuhold
Fig. 7 Semistructured Model Example. A directed labeled graph represents the data of Studio B. The graph is self-describing because the data also carry schema information
(Sect. 4.1) plays a central role in this context. In parallel, research on Markup Languages (Sect. 4.2) evolved to a first agreed-upon standard (SGML), a derivative of which (XML) was later integrated with the Semistructured Data Model. Hypertext and Hypermedia research (Sect. 4.3) focused not only on data and document representation, but also on navigation and access to documents in distributed environments. All these efforts had a direct impact on Multimedia Data and Document Models, which aimed at representing the semantics and behaviors of non-textual multimedia objects. As a representative for these developments we discuss MPEG-7 (Sect. 4.4) and briefly outline other metadata interoperability approaches (Sect. 4.5).
4.1 The Semistructured Data Model In all models available so far (Relational Model, ER Model, OO Model), there has been a fixed schema describing the semantics of data. This leads to problems when data are exchanged across systems, because the underlying databases usually do not share the same schema even if they store similar data. This was the primary motivation for developing a more flexible data model, called the Semistructured Data Model. The original model evolved from the LORE [3] and TSIMMIS [16] projects at Stanford University and was first described by Papakonstantinou et al. [51]. Unlike the other existing data models at that time, the semistructured model does not separate the schema from the data. It is self-describing, meaning that the data themselves carry their schema information. Data represented by the semistructured model takes the form of a directed labeled graph. The nodes in such a graph stand for objects or attribute values. An edge indicates the semantics of the relationship two nodes have with each other. Unlike previous models, an edge merges the notions of attributes and relationships into a single primitive. Figure 7 shows our illustrative example in a semistructured representation.
A Retrospective on Semantics and Interoperability Research
15
The semistructured data model provides the necessary flexibility for exchanging data across system boundaries. However, the price for this flexibility is the loss of efficiency in query processing. This is one of the reasons why most of today’s data is still represented in the very efficient relational model and the technologies based on the semistructured model are primarily used for exchanging data. An architectural pattern combining the benefits of the static-schema and schema-less approaches is the mediator-wrapper architecture proposed by Wiederhold [63]. An extensive explanation of the Semistructured Data Model and its succeeding technologies is provided by Abitebul et al. [2].
4.2 Markup Languages The motivation for the development of markup languages comes from the publishing industry and early works on electronic document management systems. Without any markup, documents are simply files containing a sequence of symbols. Applications processing these documents cannot anticipate, for instance, what are the section headings to be presented to the user or where in the character sequence the information about the authors is located. Therefore document exchange and consequently interoperability between applications and between vendors becomes very difficult. As a consequence, the goal of markup languages is to add explicit semantics to plain character sequences. Markers (tags) allow for the annotation of electronic documents in order to add data-, presentation-, and processing-semantics to character subsequences. The IBM Generalized Markup Language (GML) [27] invented by Mosher, Lorie, and Goldfarb was the first technical realization of a markup language. Scribe [52] was the first language that introduced the separation of content and format and applied a grammar controlling the usage of descriptive markup elements. These works lead to the standardization of the Standard Generalized Markup Language (SGML) [35] in 1986. SGML is a metalanguage for describing markup languages and defines a common syntax for the markup or identification of structural textual units as well the grammar—the document type definition (DTD)—for defining the structure and allowed for tags in a document. Prominent derivatives of the SGML are HTML, which was developed in 1991, and XML, which was standardized in 1998. HTML [7] is a presentation-oriented markup language that allows users to easily create Web sites without adhering to the strict formal requirements imposed by the SGML DTDs. In fact, it eliminates DTD’s and only suggests structural and very few (formal) semantic features such as HTML META-Tags. Nevertheless, the extensibility and flexibility of HTML was one of the key factors for the success of the World Wide Web, with the result that today HTML is still the most widely used markup language. While HTML mainly provides markup elements that define presentation semantics of document parts, XML [61] goes back to SGML, eliminates complex properties and streamlines DTD’s. As a consequence, XML provides a simplified meta
16
B. Haslhofer and E.J. Neuhold
Casablanca 1946 Drama 102 Humphrey Bogart 1899-12-25 Ingrid Bergman 1915-08-29 Fig. 8 XML Document Example. It shows the movie data of Studio B represented in XML. The first line contains an XML processing instruction, the following lines the XML elements and values that describe the movie and its actors
markup language for defining documents that contain data to be communicated between applications. Since XML is backwards-compatible to SGML, DTDs can be applied for imposing element definitions and document structures on XML documents. The elements in XML documents indicate the semantics of contained data values. Nowadays, however, DTDs are superseded by the XML Schema, which offers the great advantage that not only data but also the schema information is represented in XML. Figure 8 shows our illustrative example represented in XML. It was soon discovered that the freedom of the original HTML specification, as a presentation-oriented markup language, lead to semantic interoperability problems among web browsers and applications. Around the year 2000, XHTML was developed in order to bind the features of HTML to an XML format. The goal was to represent Web documents as well-formed XML documents, which promised greater interoperability but less freedom in the creation of Web sites. With the development of XHTML 22 and HTML 53 a competition on the next generation markup language started. At the time of writing, HTML 5 seems to be the winner in the field of Web-markup languages because of its less strict, more evolutionary design approach. However, despite this development the expressibility of real-world semantics remained weak and led to the development of additional meta-languages such as RDF/S and OWL, which will be discussed in Sect. 5. HTML 5 now provides the possibility to include metadata content expressed in RDF in Web documents. 2 http://www.w3.org/TR/xhtml2/. 3 http://www.whatwg.org/specs/web-apps/current-work/multipage/.
A Retrospective on Semantics and Interoperability Research
17
4.3 Hypertext and Hypermedia Inspired by Vannevar Bush’s vision of Memex [13], Ted Nelson and Douglas Engelbart started their research on hypertext and hypermedia systems in the late 1960s (cf., [24, 44]). The goal of hypertext was to extend the traditional notion of linear flat text files by allowing a more complex organization of the material. Hypertext systems should allow direct machine-supported references from one textual chunk to another. Via dedicated interfaces, the user should have the ability to interact with these chunks and to establish new relationships between them. Hypertext was considered as a non-linear extension of traditional text organization. In its simplest form, hypertext consists of nodes and plain links, which are just connections between two nodes. They carry no explicit semantics but simply serve for the navigation between documents or document chunks. But links can also be used to connect a comment or annotation to a text. In such a case, the links that connect data with other data express semantics. When links have explicit types assigned, as described in Trigg et al. [59], they explicitly define the semantic relationship between nodes. There is a clear analogy between explicitly typed links in hypertext systems and the semistructured model described in Sect. 4.1: the underlying models are directed labeled graphs. Hypermedia is an extension of hypertext that also includes non-textual multimedia objects such as audio, video, and images. A detailed survey on early hypertext research and existing hypertext systems is available in [20]. However, hypermedia inherits the properties of hypertext and has also only limited means to express the semantics of the involved media objects and the relationships between them. For achieving interoperability and exchanging hypertext and hypermedia documents between applications, it soon became clear that a standardized exchange format is required in order to provide interoperability. HyTime, as an extension of SGML, is an example for such a standard (see Goldfarb [28]). Also the work in the Dexter Group focused on hypertext exchange formats and architectural models that should facilitate the exchange of hypertext [29, 32]. The World Wide Web is the most popular hypertext application in use today. One of the success factors of the Web was that several technologies were integrated into an easy-to-use technology stack: Uniform Resource Identifiers (URIs) and Uniform Resource Locators (URLs) for addressing documents in the Web, HTML (and its extensions) as a flexible markup language for creating hypertext documents, and HTTP as a protocol for the communication between clients and servers (see [36]).
4.4 The MPEG-7 Metadata Interoperability Framework With the release of the MPEG-7 standard in February 2002, a powerful metadata system for describing multimedia content was introduced. The goal was to provide higher flexibility in data management and interoperability of data resources. The difference between MPEG-7 and other already existing MPEG standards is that
18
B. Haslhofer and E.J. Neuhold
MPEG-7 does not specify any coded representation of audio-visual information but focuses on the standardization of a common interface for describing multimedia materials [43]. MPEG-7 aims to avoid being a single monolithic system for multimedia description but rather an extensible metadata framework for describing audiovisual information. MPEG-7 standardizes an extensive set of content Descriptors (D) and Description Schemas (DS) and offers a mechanism to specify new Description Schemas, such as the Description Definition Language (DDL). It is a description standard for all kind of media (audio, image, video, graphics, etc.) and creates a common basis for describing different media types by a single standard. It thereby eases interoperability problems between media types as well as applications. MPEG-7 uses XML for encoding content descriptions into a machine-readable format. XML Schema serves as the basis for the DDL that is used for the syntactic definition of the MPEG-7 description tools and that allows for extensibility of the description tools. Further details on MPEG-7 are available in Kosch [40]. MPEG-7 was not developed with a restricted application domain in mind. With the ability to define media description schemas by means of the DDL, MPEG-7 is intended to be applicable to a wide range of multimedia applications ranging from home entertainment (e.g., personal multimedia collections) to cultural services (e.g., art galleries) and surveillance (e.g., traffic control). However, this wide application spectrum has resulted in an enormous complexity of that standard, which, in our opinion, is one of the reasons why the ambitious goals of MPEG-7 remain unreached.
4.5 Other Metadata Interoperability Approaches The relevant characteristics of the 1990s are the emergence of the World Wide Web and an increasing need for interoperability among distributed applications. The availability of markup languages such as XML promoted the development of metadata interoperability standards that should allow the exchange of information objects across system boundaries. These standards ranged from rather generallyapplicable schemas such as Dublin Core [22] to very domain-specific schemas such as ONIX [58], which provides standardization for the publishing industry. This was also the period when global models covering the semantics of whole application domains emerged. Those models are supposed to define the common notions used in a domain and serve as a global schema for the integration of data in a heterogeneous distributed environment. The CIDOC CRM4 model, for instance, is such a model. It defines a conceptual model that aims at providing interoperability among information systems in cultural heritage institutions. This is architecturally similar to the idea of heterogeneous databases (cf., Sect. 3.1) where a global schema defines the model primitives for querying the underlying databases. The difference 4 http://cidoc.ics.forth.gr/.
A Retrospective on Semantics and Interoperability Research
19
from the 1990s onwards is that global model interoperability approaches are being applied in the Web, which is an open-world environment. However, they inherit the problems distributed databases can only cope with in their much smaller closedworld environment. As in databases, one must always deal with semantic ambiguities in the interpretations of the involved schemas and provide adequate mappings to bridge the heterogeneities. For a more detailed discussion on techniques for achieving metadata interoperability, we refer to a recent survey provided by Haslhofer and Klas [34].
5 The Semantic Web and Linked Data The late 1990s were characterized by the success of the World Wide Web. A set of simple-to-use technologies (URI, HTTP, HTML) suddenly allowed also nontechnical users to easily create and publish documents in a globally accessible information space. This was one of the reasons for the rapid spread of the Web. However, the information published on the Web was intended for human consumption and not for machine-interpretation. This motivated the development of the Semantic Web, which is an extension of the existing Web and has the goal to use the Web as a universal medium for the exchange of data. The Web should become a place where data can be shared and processed by automated tools as well as by people.5
Section 5.1 focuses on early Semantic Web activities and briefly describe the major specifications in place. Section 5.2 summarizes current activities in the area of Linked Data.
5.1 The Semantic Web The term Semantic Web was coined by Tim Berners-Lee and popularized in an article published in Scientific American in 2001 [8]. There the Semantic Web is described as a new form of Web content that is meaningful to computers and will unleash a revolution in new possibilities. In the early Semantic Web vision intelligent agents should act on behalf of their users and automatically fulfill tasks in the Web (e.g., making a doctor’s appointment). This of course requires that these agents understand the semantics of the information exposed on the Web. Based on this vision, the Semantic Web Activity was started at the W3C and has lead to the specification of several standards that technically enable this described vision: RDF/S, OWL, OWL-S, SKOS, and SPARQL. Since one of the major design principles was to build the Semantic Web upon the existing Web architecture, URIs form the basis for all these standards. Hence, 5 http://www.w3.org/2001/sw/Activity.
20
B. Haslhofer and E.J. Neuhold
all resources in the Semantic Web—including, but not limited to, those describing real-world objects—should have URIs assigned. The Resource Description Framework (RDF) serves as data model for representing metadata about a certain resource. It allows us to formulate statements about resources, each statement consisting of a subject, a predicate, and an object. The subject and predicate in a statement must always be resources, the object can either be a resource or a literal node. A statement is represented as a triple and several statements form a graph. RDF data can be exchanged between applications by serializing graphs using one of the RDF serialization syntaxes (e.g., RDF/XML, NTriple, Turtle). We will give an example of an RDF graph in Fig. 9 in Sect. 5.2. The RDF Vocabulary Description Language RDF Schema (RDFS) and the Web Ontology Language (OWL) are means of describing the vocabulary terms used in an RDF model. RDFS provides the basic constructs for describing classes and properties and allows for their arrangement into simple subsumption hierarchies. Since the expressiveness of RDFS is limited and misses some fundamental modeling features often required to construct vocabularies, the Web Ontology Language (OWL) was created. It is based on RDFS and allows the distinction between attribute-like (owl:DatatypeProperty) and relationship-like (owl:ObjectProperty) properties and provides several other expressive modeling primitives (e.g., class union and intersections, cardinality restrictions on properties, etc.) that allow us to express more complex models, which are then called ontologies. With RDFS and OWL one has the possibility to define models that explicitly express the semantics and specify and process possible inferences of data. The formal grounding of OWL (Description Logics) allows applications to reason on RDF statements and infer logical consequences. The binding of semantics to a logical system reduces interpretation ambiguities and leads to greater semantic interoperability between applications. OWL-S Semantic Markup for Web Services is a specific upper-level ontology for the description of services on the Web (Semantic Web Services). It should enable automatic Web service discovery and invocation by Web agents as well as automatic Web service composition and interoperation. Therefore, OWL-S can be considered as an attempt to establish interoperability between services in the Semantic Web. The Simple Knowledge Organization System (SKOS) is a model for expressing the structure and constituents of concept schemas (thesauri, controlled vocabularies, taxonomies, etc.) in RDF so that they become machine-readable and exchangeable between applications. With SKOS one can attach multi-lingual labels to concepts and arrange them in two major kinds of semantic relationships: broader and narrower relationships for constructing concept hierarchies and associative relationships for linking semantically related concepts. The SPARQL Query Language for RDF is an expressive language for formulating structured queries over RDF data sources. It defines a protocol for sending queries from clients to an SPARQL endpoint and for retrieving the retrieved results via the Web. Currently, the abstract protocol specification has bindings for HTTP and SOAP. This allows clients to execute a query against a given endpoint (e.g., http://dbpedia.org/sparql) and to retrieve the result set through common Web transport protocols. The underlying motivation for defining the SPARQL query language
A Retrospective on Semantics and Interoperability Research
21
is analogous to the motivation for defining SQL (see Sect. 2.1): to be able to access RDF stores via a uniform interface in order to achieve greater interoperability. A core belief of the early Semantic Web was that intelligent agents should be able to reason and draw conclusions based on the available data. This is why, in the Semantic Web, the meaning of terminology used in Web documents, that is the semantics of data, is expressed in terms of ontologies. The term ontology has its technical origin in the Artificial Intelligence domain and is defined as a specification of a conceptualization (see e.g., [30]). In its core, an ontology is similar to a database schema: a model defining the structure and semantics of data. Noy and Klein [47] describe several features that distinguish ontologies from database schema, most importantly that ontologies are logical systems that define a set of axioms that enable automated reasoning over a set of given facts. Although intensive research has been conducted in the Semantic Web domain over the last ten years, this early vision of the Semantic Web has not been implemented yet. The limitations of the Semantic Web lie in formal issues like decidability and computational complexity but also in its conceptual complexity. It is difficult to make it clear to the user (and the system designers) what the inferences implied by a given fact are.
5.2 Linked Data In 2006 Tim Berners-Lee proposed the so-called Linked Data principles [6] as a guideline or recommended best practice to share structured data on the Web and to connect related data that were not linked before. These are: 1. Use URIs to identify things. 2. Use HTTP URIs so that people can look up those names. 3. When someone looks up a URI, provide useful information, using the standards (RDF, SPARQL). 4. Include links to other URIs, so that one can discover more things. These principles eclipse the reasoning part of the Semantic Web, accentuate the data-centric aspects of existing Semantic Web technologies and thereby demystify their application in real-world environments. A central point in the Linked Data principles is the application of HTTP URIs as an object (resource) identification mechanism. When an application dereferences such a URI it receives data expressed in RDF. Structured access to RDF data within data sources is provided by SPARQL. This, in fact, resembles the central features provided by traditional (relational) database systems. The goal of the fourth principle is to interlink semantically related resources on the Web. If, for instance, two studios maintain a data record about the same movie, they should be interlinked. The semantics of the link depends on the application scenario; existing Semantic Web languages provide a set of predefined properties (rdfs:seeAlso, owl:sameAs, skos:closeMatch, etc.) for defining the meaning of links. Figure 9 shows how our illustrative example is represented in the Web of Data.
Fig. 9 Linked Data Example. The example how the data of Studio B could be exposed on the Web following the Linked Data guidelines. The prefixes expand as follows: dbpedia to http://dbpedia.org/resource, dbpprop to http://dbpedia.org/property/, dbpedia-owl to http://dbpedia.org/ontology/, and category to http://dbpedia.org/resource/Category:
22 B. Haslhofer and E.J. Neuhold
A Retrospective on Semantics and Interoperability Research
23
The Linked Data idea rapidly raised interest in various communities. Shortly after the formation of the W3C Linking Open Data Community project,6 DBpedia [11] was launched as the first large linked data set on the Web. It exposes all the information available in Wikipedia in a structured form and provides links to related information in other data sources such as the Linked Movie Database.7 As of November 2009, the DBpedia knowledge base describes more than 2.9 million things such as persons, music albums, or films in 91 different languages. It provides a user-generated knowledge organization system comprising of approximately 415 000 categories and millions of links to semantically related resources on the Web. After DBpedia, many other data sources followed. Today this so-called Web of Data comprises an estimated number of 4.7 billion RDF triples and 142 million RDF links [10]. For data consumers this has the advantage that data as well as schema information is now available on the Web (see The Best Practice Recipes for Publishing Vocabularies8 ) and can easily be accessed via widely accepted Web technologies, such as URI and HTTP. RDF simply serves as a model for representing data on the Web. This pragmatic Web of Data principles also resembles the notion of dataspaces [26] that was coined in the database community. However, as with all of the previously described interoperability attempts and technologies, Linked Data does not solve the complete stack of interoperability problems either. From the Semantic Web it inherits a set of technologies (RDF/S, OWL, etc.) that provide the necessary technical and structural interoperability, which in turn makes data easily accessible on the Web. But this does not solve the semantic interoperability problem. The data in the Linked Data Web are still heterogeneous because they use different vocabularies to describe the same real-world entities or the same vocabulary to describe different real-world entities. This leads to interpretation conflicts and usually requires manual interventions in terms of mappings. Although there exists a wealth of work in the are of semantic mediation and mapping (see e.g., [38]), the complexity of finding potential mappings between concepts grows with the size of the involved vocabularies. A fully automatic matching is considered to be an AI-complete problem, that is, as hard as reproducing human intelligence [9].
6 Summary and Future Research Directions Interoperability is a qualitative property of computing infrastructures. It enables a receiving system to properly interpret the information objects received from a sender and vice versa. Since this is not given by default, the representation of semantics has been an active research topic for four decades. 6 http://esw.w3.org/topic/SweoIG/TaskForces/CommunityProjects/LinkingOpenData. 7 http://www.imdb.com/. 8 http://www.w3.org/TR/swbp-vocab-pub/.
24
B. Haslhofer and E.J. Neuhold
In this chapter, we gave a retrospective on semantics and interoperability research as applied in major areas of computer science. We started with the Relational Model developed in the 1970s and ended with the currently on-going activities in the Semantic Web and Linked Data community. The technical outcome of all these activities were models that allow for the expression of data semantics and system architectures for the integration of data from several (heterogeneous) sources. From the late 1990s on, when research was driven by the evolving World Wide Web, the semistructured data model gained importance. Different from previous models, it is self-describing, meaning that data itself carries schema information. In essence, all presented models and system architectures enable the representation of data and the description of the semantics of these data. If one and the same model were used for exchanging information objects, interoperability would be established at least on a technical level and to some extent also on a syntactic and structural level. The Web is a good example of that; it provides a uniform way of identifying resources, a common exchange protocol, and a simple standardized markup language. If the involved parties also agree on the semantics of terms, as it is the goal of the various metadata standardization attempts, interoperability can also be established on a semantic level. In practice, however, such an agreement is hard to achieve, especially when multiple parties from a broad range of application domains are involved. We can observe numerous attempts of defining general (ontology) models for a complete domain (e.g., MPEG-7 for multimedia metadata, CIDOC CRM for the cultural heritage domain); although they provide a very detailed domain description, they hardly found their implementation in practice. As long as people are the designers of models, different conceptions and interpretations will always exist, even for superficially homogeneous domains and application contexts. We therefore believe that research in the area of semantic interoperability should take this situation into account and find solutions that deal with a multitude of models and allow for their semi-automatic or manual reconciliation. We believe that the World Wide Web will continue to be the predominant area for semantics and interoperability research. Applications that were available on the Desktop before (e.g., Email, Calendar, Office Suites, etc.) are now on the Web. A more Web-centric solution for data management is, in our opinion, a logical consequence. The Linked Data movement is definitely an important starting point in this direction. However, it will require further research on the integration of existing data sources and the development of scalable graph-based data stores. Additionally, since data are exposed on the Web and they should in the end, also be consumable by machines, further research must be conducted in the areas of data quality, changeability of models, reliability of information, and data provenance. In fact, these research topics were already identified in the early years of database research. Now, however, the open, distributed, and uncontrolled nature of the Web calls for a review of these approaches and possibly their adaption to a Web-based environment. The evolution of schemas and ontologies in decentralized semantic structures such as the World Wide Web also calls for further research. Aberer et al. [1] coined the term Emergent Semantics, which denotes a research field focusing on the under-
A Retrospective on Semantics and Interoperability Research
25
standing of semantics by investigating the relationships between syntactic structures using social networking concepts for the necessary human interpretations.
References 1. Aberer, K., Catarci, T., Cudré-Mauroux, P., Dillon, T., Grimm, S., Hacid, M.-S., Illarramendi, A., Jarrar, M., Kashyap, V., Mecella, M., Mena, E., Scannapieco, M., Saltor, F., Santis, L.D., Spaccapietra, S., Staab, S., Studer, R., Troyer, O.D.: Emergent semantics systems. In: In International Conference on Semantics of a Networked World (ICSNW), pp. 14–43 (2004) 2. Abiteboul, S., Buneman, P., Suciu, D.: Data on the Web: From Relations to Semistructured Data and XML. Morgan Kaufmann, San Mateo (1999). 3. Abiteboul, S., Quass, D., McHugh, J., Widom, J., Wiener, J.L.: The lorel query language for semistructured data. Int. J. Digit. Libr. 1(1), 68–88 (1997) 4. Abrial, J.-R.: Data semantics. In: Klimbie, J.W., Koffeman, K.L. (eds.) Data Base Management, pp. 1–60. North-Holland, Amsterdam (1974) 5. ANSI/X3/SPARC Study Group on Data Base Management Systems: Interim report. FDT— Bulletin of ACM SIGMOD 7(2), 1–140 (1975) 6. Berners-Lee, T.: Linked Data. World Wide Web Consortium, (2006). World Wide Web Consortium. Available at http://www.w3.org/DesignIssues/LinkedData.html 7. Berners-Lee, T., Conolly, D.: RFC 1866—Hypertext Markup Language—2.0. Network Working Group (1995) 8. Berners-Lee, T., Hendler, J., Lassila, O.: The semantic web. Scientific American (May 2001) 9. Bernstein, P.A., Melnik, S., Petropoulos, M., Quix, C.: Industrial-strength schema matching. SIGMOD Rec. 33(4), 38–43 (2004) 10. Bizer, C., Heath, T., Berners-Lee, T.: Linked data—the story so far. Int. J. Semant. Web Inf. Systems (IJSWIS) 5(3) (2009) 11. Bizer, C., Lehmann, J., Kobilarov, G., Auer, S., Becker, C., Cyganiak, R., Hellmann, S.: DBpedia—a crystallization point for the web of data. J. Web Semant. 7(3), 154–165 (2009) 12. Bukhres, O.A., Elmagarmid, A.K. (eds.): Object-Oriented Multidatabase Systems: A Solution for Advanced Applications. Prentice Hall, New York (1996) 13. Bush, V.: As we may think. Atlantic Monthly 176(1), 101–108 (1945) 14. Ceri, S., Pelagatti, G.: Distributed Databases: Principles and Systems. McGraw-Hill, New York (1984) 15. Chamberlin, D.D., Boyce, R.F.: Sequel: a structured English query language. In: SIGFIDET ’74: Proceedings of the 1974 ACM SIGFIDET (now SIGMOD) Workshop on Data Description, Access and Control, pp. 249–264. ACM, New York (1974). doi:10.1145/800296.811515 16. Chawathe, S., Garcia-Molina, H., Hammer, J., Ireland, K., Papakonstantinou, Y., Ullman, J.D., Widom, J.: The TSIMMIS project: integration of heterogeneous information sources. In: 16th Meeting of the Information Processing Society of Japan, Tokyo, Japan, pp. 7–18 (1994) 17. Chen, P.P.: The entity-relationship model: toward a unified view of data. In: Kerr, D.S. (ed.) VLDB, p. 173. ACM, New York (1975) 18. Chen, P.P.: The entity-relationship model—toward a unified view of data. ACM Trans. Database Syst. 1(1), 9–36 (1976) 19. Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377–387 (1970) 20. Conklin, J.: Hypertext: an introduction and survey. Computer 20(9), 17–41 (1987). doi:10.1109/MC.1987.1663693 21. Dogac, A., Özsu, M.T., Biliris, A., Sellis, T.K. (eds.): Advances in Object-Oriented Database Systems, Proceedings of the NATO Advanced Study Institute on Object-Oriented Database Systems, Held in Izmir, Kusadasi, Turkey, August 6–16, 1993. NATO ASI Series F: Computing and Systems Sciences, vol. 130 (1994)
26
B. Haslhofer and E.J. Neuhold
22. Dublin Core Metadata Initiative. Dublin Core Metadata Element Set, version 1.1. Available at: http://dublincore.org/documents/dces/ (December 2006) 23. Elmasri, R., Weeldreyer, J., Hevner, A.: The category concept: an extension to the entity-relationship model. Data Knowl. Eng. 1(1), 75–116 (1985). doi:10.1016/0169-023X(85)90027-8 24. Engelbart, D.C.: Augmenting Human Intellect: A Conceptual Framework. Stanford Research Institute, Menlo Park (1962) 25. Falkenberg, E.D.: Concepts for modelling information. In: Nijssen, G.M. (ed.) IFIP Working Conference on Modelling in Data Base Management Systems, Freudenstadt, Germany, pp. 95–109. North-Holland, Amsterdam (1976) 26. Franklin, M., Halevy, A., Maier, D.: From databases to dataspaces: a new abstraction for information management. SIGMOD Rec. 34(4), 27–33 (2005). doi:10.1145/1107499.1107502 27. Goldfarb, C.F.: A generalized approach to document markup. In: Proceedings of the ACM SIGPLAN SIGOA Symposium on Text Manipulation, pp. 68–73. ACM, New York (1981). doi:10.1145/800209.806456 28. Goldfarb, C.F.: Standards-HyTime: a standard for structured hypermedia interchange. Computer 24(8), 81–84 (1991). doi:10.1109/2.84880 29. Grønbæk, K., Trigg, R.H.: Hypermedia system design applying the dexter model. Commun. ACM 37(2), 26–29 (1994). doi:10.1145/175235.175236 30. Gruber, T.: A translation approach to portable ontology specifications. Knowl. Acquis. 5, 199– 220 (1993) 31. Haas, L.M., Selinger, P.G., Bertino, E., Daniels, D., Lindsay, B.G., Lohman, G.M., Masunaga, Y., Mohan, C., Ng, P., Wilms, P.F., Yost, R.A.: R* : A research project on distributed relational DBMS. IEEE Database Eng. Bull. 5(4), 28–32 (1982) 32. Halasz, F., Schwartz, M.: The dexter hypertext reference model. Commun. ACM 37(2), 30–39 (1994). doi:10.1145/175235.175237 33. Halpin, T.: Object-role modeling (ORM/NIAM). In: Handbook on Architectures of Information Systems, pp. 81–102. Springer, Berlin (1998) 34. Haslhofer, B., Klas, W.: A survey of techniques for achieving metadata interoperability. ACM Comput. Surv. 42(2) (2010) 35. ISO JTC1 SC34. ISO 8879:1986 Information Processing—Text and Office Systems— Standard Generalized Markup Language (SGML) (1986) 36. Jacobs, I., Walsh, N.: Architecture of the World Wide Web, Volume One. Available at: http://www.w3.org/TR/webarch/ (December 2004) 37. Rothnie, J.B. Jr., Bernstein, P.A., Fox, S., Goodman, N., Hammer, M., Landers, T.A., Reeve, C.L., Shipman, D.W., Wong, E.: Introduction to a system for distributed databases (sdd-1). ACM Trans. Database Syst. 5(1), 1–17 (1980) 38. Kalfoglou, Y., Schorlemmer, M.: Ontology mapping: the state of the art. Knowl. Eng. Rev. 18(1), 1–31 (2003). doi:10.1017/S0269888903000651 39. Klas, W., Aberer, K., Neuhold, E.J.: Object-oriented modeling for hypermedia systems using the VODAK model language. In: NATO ASI OODBS, pp. 389–433 (1993) 40. Kosch, H.: Distributed Multimedia Database Technologies Supported MPEG-7 and by MPEG-21. CRC Press LLC, Boca Raton (2003) 41. Landers, T.A., Rosenberg, R.: An overview of multibase. In: DDB, pp. 153–184 (1982) 42. Litwin, W., Boudenant, J., Esculier, C., Ferrier, A., Glorieux, A.M., Chimia, J.L., Kabbaj, K., Moulinoux, C., Rolin, P., Stangret, C.: Sirius system for distributed data management. In: DDB, pp. 311–366 (1982) 43. Nack, F., Lindsay, A.T.: Everything you wanted to know about MPEG-7: Part 1. IEEE MultiMedia 6(3), 65–77 (1999) 44. Nelson, T.H.: Complex information processing: a file structure for the complex, the changing and the indeterminate. In: Proceedings of the 1965 20th National Conference, pp. 84–100. ACM, New York (1965). doi:10.1145/800197.806036 45. Neuhold, E.J., Biller, H.: Porel: A distributed data base on an inhomogeneous computer network. In: VLDB, pp. 380–395. IEEE Computer Society, Los Alamitos (1977)
A Retrospective on Semantics and Interoperability Research
27
46. Nijssen, G.M.: Current issues in conceptual schema concepts. In: Nijssen, G.M. (ed.) Proc. 1977 IFIP Working Conf. on Modelling in Data Base Management Systems, Nice, France, pp. 31–66. North-Holland, Amsterdam (1977) 47. Noy, N.F., Klein, M.: Ontology evolution: Not the same as schema evolution. Knowl. Inf. Syst. 6(4), 428–440 (2004). doi:10.1007/s10115-003-0137-2 48. Object Management Group (OMG). Meta Object Facility (MOF) core specification— version 2.0. Available at: http://www.omg.org/spec/MOF/2.0/PDF/ (January 2006) 49. Object Management Group (OMG). Unified Modelling Language (UML). Available at: http:// www.uml.org/ (2007) 50. Ouksel, A.M., Sheth, A.: Semantic interoperability in global information systems. SIGMOD Rec. 28(1), 5–12 (1999). doi:10.1145/309844.309849 51. Papakonstantinou, Y., Garcia-Molina, H., Widom, J.: Object exchange across heterogeneous information sources. In: Eleventh International Conference on Data Engineering (ICDE 1995), pp. 251–260 (1995) 52. Reid, B.K.: A high-level approach to computer document formatting. In: POPL ’80: Proceedings of the 7th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 24–31. ACM, New York (1980). doi:10.1145/567446.567449 53. Rowley, J.: The wisdom hierarchy: representations of the DIKW hierarchy. J. Inf. Sci. 33(2), 163–180 (2007). doi:10.1177/0165551506070706 54. Sheth, A.P., Larson, J.A.: Federated database systems for managing distributed, heterogeneous, and autonomous databases. ACM Comput. Surv. 22(3), 183–236 (1990). doi:10.1145/96602.96604 55. Stonebraker, M., Held, G., Wong, E., Kreps, P.: The design and implementation of INGRES. ACM Trans. Database Syst. 1(3), 189–222 (1976). doi:10.1145/320473.320476 56. Stonebraker, M., Neuhold, E.J.: A distributed database version of INGRES. In: Berkeley Workshop, pp. 19–36 (1977) 57. Sundgren, B.: An infological approach to data bases. PhD thesis, University of Stockholm (1973) 58. The EDItEUR Group: Online Information Exchange (ONIX). Available at: http://www. editeur.org/onix.html (2007) 59. Trigg, R.H., Weiser, M.: Textnet: a network-based approach to text handling. ACM Trans. Inf. Syst. 4(1), 1–23 (1986). doi:10.1145/5401.5402 60. Visser, P.R.S., Jones, D.M., Bench-Capon, T.J.M., Shave, M.J.R.: An analysis of ontological mismatches: Heterogeneity versus interoperability. In: AAAI 1997 Spring Symposium on Ontological Engineering, Stanford University, Stanford (1997) 61. W3C XML Activity. Extensible Markup Language (XML) 1.0. W3C. Available at: http:// www.w3.org/TR/1998/REC-xml-19980210 (1998) 62. Wache, H.: Semantische Mediation für heterogene Informationsquellen. PhD thesis, University of Bremen (2003) 63. Wiederhold, G.: Mediators in the architecture of future information systems. Computer 25(3), 38–49 (1992). doi:10.1109/2.121508
Semantic Web and Applied Informatics: Selected Research Activities in the Institute AIFB Andreas Oberweis, Hartmut Schmeck, Detlef Seese, Wolffried Stucky, and Stefan Tai
Abstract Research on Semantic Web has a long tradition in the Institute AIFB, and has largely influenced many research projects in the broader field of Applied Informatics. This article reports on a selection of research activities that illustrate the fruitful exchange of Semantic Web and Applied Informatics, covering the topics of Logic and Complexity Management, Efficient Algorithms, Organic Computing, and Business Process Management. This article does not have the character of a research paper in the classical sense. As a contribution to this Festschrift, it comprises a very special and personal selection of topics and research activities and should be considered as a message of greetings in honor of our colleague: Rudi Studer.
1 Introduction The advent of the Internet has changed the world. New business applications, free flow of information, new services and software architectures, and new global business processes are emerging. The Internet is developing into a comprehensive database storing all the knowledge of mankind, and is becoming the active brain of mankind used for science (storing old discoveries and enabling new ones), for qualitatively new forms of organization of business (new companies—e.g. Amazon, Google, eBay, and others—as well as new products and new services) and politics. With the evolution of “a new generation of open and interacting social machines” enabling “interactive ‘read/write’ technologies (e.g. Wikis, blogs, and photo/video sharing)” [26] the modern Web is changing human life every day. But at the same time, these new advantages introduce some scientific and technological challenges. On the one hand, information needed to solve a specific problem can be at our fingertips when we need it, but on the other hand we are drowning in information and are not able to master the complexity and the dynamics of the processes created (consider, for example, the growing product complexity, i.e. the great array of variants caused by the diversity requirements of well-informed customers). A. Oberweis () Institute AIFB, Karlsruhe Institute of Technology (KIT), 76128 Karlsruhe, Germany e-mail:
[email protected] url: http://www.aifb.kit.edu D. Fensel (ed.), Foundations for the Web of Information and Services, DOI 10.1007/978-3-642-19797-0_2, © Springer-Verlag Berlin Heidelberg 2011
29
30
A. Oberweis et al.
Semantic web technology is an enabling factor for many of the new applications, products, and services, and at the same time helps to address some of their shortcomings. This technology needs a scientific foundation rooted in Mathematics, Logic, and Theoretical Computer Science. It is an integral part of Applied Informatics, and closely related to Efficient Algorithms and Organic Computing, Business Information and Communication Systems, Service Computing and Service Engineering, Software and Process Engineering and Complexity Management, all of which are the areas of research represented in the Institute AIFB (www.aifb.kit.edu). The objective of this article is to demonstrate (using specific examples) that there is a fruitful interconnection between semantic web technology and the above mentioned areas of Applied Informatics, which is beneficial for all sides and stimulates further research, either in joint projects, where we benefit directly from each other’s competence, or in individual projects integrating topics from other groups. Cooperation starts with joint discussions and regular meetings to enable and create a good working atmosphere in the Institute AIFB and to exchange ideas to solve all kinds of daily problems. This paper presents a personal selection of topics and problems born out of the fruitful cooperation and collaboration with Rudi Studer at the Institute AIFB that has been carried out over several years and is motivated by our friendship with him, and simply by having him as such a productive colleague. This article is definitely not a research paper in the classical sense. As a contribution to this Festschrift, it should be considered a message of greetings in honor of our colleague Rudi Studer. The article is organized as follows: In the first section we discuss as a general introduction, the challenging interrelationship between the expressive power of suitable languages to describe and access knowledge and the complexity of the problems to solve. The next section surveys recent work in the field of semantic business process management at the Institute AIFB. This is followed by a wrap-up of joint research on distributed market structures and system architectures related to innovative energy systems and on the role of semantic web technologies for selforganization and organic computing.
2 A Logical Way to Master Complexity: the Challenging Tradeoff Between Expressiveness and Tractability A significant amount of the world’s knowledge is stored on the World Wide Web, and this amount is constantly increasing. The rapid growth rate and dynamics of this development, together with the sheer number of different documents, their varieties, and their varying quality, emphasizes the challenging task of managing and finding information on the WWW. In order for users to handle this variety of information more comfortably, it is best to use highly expressive languages to formulate queries, as they are closest to the natural languages used on the Internet. Unfortunately, small doses of expressive power come at the price of significant computational complexity (see [12]). Hence, it is a natural way of using formal methods to support all the
Semantic Web and Applied Informatics
31
different tasks of knowledge processing in an automatic or at least, semiautomatic way. Historically, the most suitable way to support such tasks has been the toolbox of mathematical and philosophical logic (see e.g. [20] and [13]). This toolbox has provided suitable ways to represent and process knowledge, define a correct semantics, the notion of truth, the notion of model, and the notions of proof and deduction to infer new knowledge from known facts. It has also been the method of translating knowledge expressed in one language into knowledge expressed in another language via interpretations. It is here where the emerging semantic web technology finds solid ground to support one of its most urgent needs: finding the correct meaning of some of the knowledge represented in the web and giving the users’ questions their intended meaning—guiding the search for knowledge and enabling correct answer responses for queries. Here, ontologies are handy tools to support this task. Referring to e.g. [28] they “provide formal specifications and computationally tractable standardized definitions of terms used to represent knowledge of specific domains in ways designed to maximize intercommunicability with other domains. The importance of ontologies has been recognized in fields as diverse as e-commerce, enterprise and information integration, qualitative modeling of physical systems, natural language processing, knowledge engineering, database design, medical information science, geographic information science, and intelligent information access. In each of these fields a common ontology is needed in order to provide a unifying framework for communication.” But this huge variety of applications requires a sufficiently expressive language for knowledge representation and widely applicable methods to process knowledge, which should be understandable and should efficiently scale up to large knowledge bases. The price one must pay is that complexity prevents easy access to really efficient solutions for most of the interesting questions in knowledge representation and reasoning. Consider as examples the XML-based Semantic Web languages OWL (web ontology language, which was standardized in 2004 by the World Wide Web Consortium—W3C), and RDF (the Resource Description Framework, which allows statements to be expressed in the form of subject-predicate-object triples) and related description logics (DL). The DL-based variants OWL Lite and OWL DL are already EXPTIME- and NEXPTIME-complete, respectively, and reasoning already becomes algorithmically intractable in these languages (see [36]). Considering RDF, it was shown in [45] that for SPARQL, a query language for RDF, the evaluation of SPARQL patterns is PSPACE-complete. Moreover, for the satisfiability of special variants of description logics one observes: S is PSPACE-complete (without TBox), SI is PSPACE-complete, SH, SHIF and SHIQ are EXPTIME-complete and SHOIQ is NEXPTIME-hard (see e.g. [3, 6, 27, 52]). This personal selection of examples of complexity results illustrates the tradeoff of expressiveness vs. tractability. It is a general observation in mathematical logic that the algorithmic complexity of algorithmic problems, as e.g. satisfiability (for propositional logic this is the known “mother of NP-complete problems” SAT—its goal is to find a satisfying assignment of the input formula), consistency, model
32
A. Oberweis et al.
checking, grows with the expressive power of the underlying logic and with the structural complexity of the considered class of models. These results date back to early investigations into decidability of theories (see e.g. [8, 46, 51]). They can also be observed in recent investigations of Descriptive Complexity Theory (see [32]), Finite Model Theory (see [24, 38]) and Parameterized Complexity Theory (see [16, 23, 29]). There is, of course, a lot of research and stimulating progress in the area of Semantic Web research itself trying to make special algorithmic solutions more efficient and develop algorithms which are scalable in practice (see the articles in this volume, e.g. [5]). Following the history of the current development we can observe that, together with contemporary developments in Applied Informatics, the results and the tools developed in mathematical logic have stimulated and enabled the current success of the semantic web. But research in these areas is no one-way street—real progress will only be observed with cooperation between many areas. We assume that several questions could be of real interest here. Most of the complexity results use the quite general approach of worst-case and asymptotic complexity. Here, the approach of Parameterized Complexity (see [16] for a general introduction), which recommends the study and use of more specific fine structures of the problems (to find parameters k, specific to the problem, such that problems of input size n could be solved in f (k) ∗ nO(1) time), could help to lead to further improvements (see [23] for first promising steps), as it did in Computational Biology [37]. As an example, consider the maximum satisfiability problem of propositional calculus (MAX-SAT—it is the goal to find an assignment which maximizes the number of satisfying clauses). Even for the maximum clause size k = 2 the maximum 2-satisfiability (MAX 2-SAT) is NP-complete. A recent breakthrough however shows, that MAX 2-SAT can be solved in 1.74n steps [53], while even for the clause size 3 (MAX 3-SAT) the best known bound for n variables is 2n [43]. When the number of clauses is bounded by m, maximum 2-satisfiability (MAX 2-SAT) can be solved in 1.15m steps and when the formula length is bounded by l, MAX 2-SAT can be solved in 1.08l steps (see [43]). The advantage of using algorithmic ideas to maximize the weights of variable assignments which “indicate if they can be added to the knowledge base while keeping it as consistent as possible” is that “three steps that frequently occur separately in Information Extraction can be treated by solving one maximum satisfiability problem: pattern selection, entity disambiguation and consistency checking” [11]. It could be promising to investigate the possibility of improving the efficiency of these methods by using the machinery from parameterized algorithms (see also [47, 50]). Furthermore, it would be interesting to combine parameterized approaches with research on the real structure of queries and combining this with a careful analysis of the structure of the Web as a complex dynamic system (see e.g. [4, 7, 22]) using techniques from Algorithm Engineering (see e.g. [42]). Further approaches which could definitely be of interest are the use of Fuzzy Logic (see e.g. [1, 21, 33]) which could relax the overpowering demand of sound and complete deductions. Of special interest in this respect could be the use of Modal Logic and possible world semantics or Kripke models [18] or a relaxation given by approximate reasoning (see e.g. [52]).
Semantic Web and Applied Informatics
33
3 Semantic Business Process Management This section surveys recent work in the field of semantic business process management at the Institute AIFB in the research group on business information systems. Here, we focus on three aspects: – Search for similar business process models in a process model repository. – Coupling of process models from different organizations. – Automatic user support for business process model editors. Business process management provides languages, methods, and software tools to support the whole life cycle of business process types and of business process instances. Semantic business process management integrates modeling languages (e.g. Petri Nets, Event Driven Process Chains, Business Process Modeling Notation) from the field of business process management and semantic technologies.
3.1 Search for Similar Business Process Models in Process Model Repositories A business process may be modeled in different ways by different modelers, even when they use the same modeling language. Concepts for finding similar process models in a process repository must include appropriate methods for solving ambiguity issues caused by the use of synonyms, homonyms, or different abstraction levels for process element names. So-called semantic business process models, which are ontology-based descriptions of process models, allow the search for similar process models or process fragments in a repository. In [17] a concept to compute the similarity between business process models is presented based on an OWL DL description of Petri nets. The use of semantic technologies in this scenario has the advantage that business process models (including process activity names) can be described in an unambiguous format, which supports computer reasoning and the automation of process composition. A more detailed description of these concepts can be found in [17, 34]. Search for similar process models based on recommender systems is proposed in [30, 31, 35].
3.2 Coupling of Process Models from Different Organizations The rapid growth of electronic markets’ activities demands flexibility and automation of the involved IT-systems in order to facilitate the interconnectivity of business processes and to reduce the required communication efforts. Inter-organizational business collaborations bring up synergy effects and can reduce enterprise risks. However, the insufficient integration of enterprises hampers collaboration due to
34
A. Oberweis et al.
different interpretations of the meaning of the used vocabulary. Furthermore, the integration of collaborating business partners into one single value creation chain requires flexible business processes at both sides to reduce integration cost and time. The interconnectivity of business processes can fail due to company specific vocabularies even if business partners share similar demands. In [14] a method is presented for semantically aligning business process models. The method supports (semi)automatic interconnectivity of business processes. A representation of Petri nets in the ontology language OWL is proposed, to semantically enrich the business process models. This semantic alignment is improved by a background ontology modeled with a specific UML profile allowing it to be modeled visually. Given two structures (e.g., ontologies or Petri nets), aligning one structure with another one means that for each entity (e.g., concepts and relations, or places and transitions) in the first structure, one tries to find a corresponding entity, which has the same intended meaning, in the second structure. Semantic technologies allow for the quicker discovery of mutual relationships between process models. For further information on this concept see [14, 34].
3.3 Automatic User Support for Business Process Model Editors Manual modeling of business processes is a time consuming task. Typos and structural modeling errors make it particularly error prone to model business processes manually. Modelers can be assisted in editing business process models by providing an autocompletion mechanism during the modeling activity. In [10] autocompletion, support for a business process model editor is introduced. This approach is based upon an OWL DL description of Petri nets. The autocompletion mechanism requires validation methods to check required properties of the automatically completed business process. To solve ambiguity issues caused by the use of different names for describing the same tasks, a machine readable format, which might be used for automatic reasoning, is required for business process models. Business processes modeled, e.g., with Petri nets, can be translated into the Web Ontology Language OWL, an unambiguous format which allows ontological reasoning. These semantic business process models combine process modeling methods with semantic technologies. A semantic description of Petri nets makes it easier to find appropriate process templates (reference processes), which can be proposed for autocompletion. During the modeling process, a recommendation mechanism determines possible subsequent fragments of all templates by computing similarities. If the system detects a high similarity between one element of a template and a modeling element, then subsequent elements of this element template are proposed for autocompletion. To ensure correct process flow behavior the system must also check properties such as deadlock freeness. The benefit of semantic technologies in this scenario is the exploitation of reasoning techniques that are provided for OWL and allow the inference of appropriate process fragments to complete a given business process model. For a more detailed description see [10, 34, 35].
Semantic Web and Applied Informatics
35
Fig. 1 SESAM marketplace for energy products
4 Semantic Web Technologies in Self-organization and Organic Computing The semantic web inherently refers to research problems arising from a large network of distributed resources built on Internet technologies. The growth of the Internet and, in particular, the introduction of the World Wide Web have influenced social and economic structures in many aspects. The economic potential of Internet and web technologies for the economy has been the topic of the research program “Internet Economics” of the Federal Ministry of Education and Research (BMBF) from 2003 to 2007. At Karlsruhe, the project SESAM: Self-organization and Spontaneity in Liberalized and Harmonized Markets was funded by this program. Based on the unique combination of competences at the Karlsruhe Institute of Technology (KIT), ten chairs from management and economics, informatics, and law cooperated in the analysis and design of market structures and mechanisms which are heavily influenced by Internet technology. Starting from multi-utility markets, the major area of application has been the design of innovative markets for an energy system which is increasingly influenced by highly distributed components acting as consumers and producers of electric power. The objective of SESAM has been to design a distributed peer-to-peer based market for trading energy related products and services (see Fig. 1 and [15]), allowing for spontaneous entry and exit of participants and providing a range of services for the optimization of tariffs, bundling consumers or producers into virtual consumers and virtual power plants by forming cooperations of participants having matching (or, complementary) interests (see [2, 19]), for agent-based negotiations and legally binding contracts (see [9]). An inherent prerequisite for the construction and operation of such a market is a common basis of understanding of the essential terms describing technical, economic, or legal aspects. Consequently, the design of ontologies has been a backbone of this project. The appropriate combination of specific ontologies into the various combined aspects of such a market place provided a particular challenge (this is indicated in Fig. 2). In particular, if contracts have to be negotiated by agents rep-
36
A. Oberweis et al.
Fig. 2 Combination and derivation of market related ontologies
resenting stakeholders from different regions, an essential prerequisite for getting legally binding contracts is a common understanding of technical and legal terms and requirements. This could only be achieved by a solid modeling with combined ontologies. The SESAM project has been a perfect example of the potential benefits of cooperation between the research groups at the Institute AIFB, in this case related to optimization (of tariffs and cooperation of market participants), efficient implementation of distributed market mechanisms in peer-to-peer technologies, and a common understanding of terms provided by ontologies. The research carried out in this project has strongly influenced the shaping of a major follow-up research program by the Federal Ministry of Economics on E-Energy: Large so-called model regions are formed for the prototypical evaluation of various approaches for the use of information and communication technologies and market mechanisms in the electrical power grid, based on smart metering of the grid components (see the editorial [49] of the topical issue of it-information technology on E-Energy). One of the six selected model regions has been formed by the utility company EnBW together with ABB, IBM, SAP, the consulting company Systemplan and the KIT under the name MeRegio: Moving towards Minimum Emission Regions. Five chairs of the KIT are involved in this project, representing expertise in management and economics, informatics, and law (see [39] at http://www.meregio.de). As an extension, another large project started in 2009: In the project MeRegioMobil eleven chairs of the KIT are cooperating with Bosch, Daimler, EnBW, Opel, SAP, Stadtwerke Karlsruhe and Fraunhofer ISI on the use of ICT for the integration of electric vehicles into the power network. A broad range of topics has to be addressed: The charging of batteries of electric vehicles has to be controlled in order to prevent excessive peak load on the power grid. This control can be further utilized to exploit the potential of dynamically available storage for electricity for balancing supply and demand of electric power, in particular in the presence of fluctuations in the supply of power from renewable sources. Furthermore, electric vehicles will rely on the availability of public and semi-public charging stations. The recharging of batteries at these different types of stations has to be supported by appropriate services addressing topics such as the identification of cars, and the possibility of roaming, which means charging for the use of electric power by one provider only, based on individual contracts
Semantic Web and Applied Informatics
37
with the utility companies, and respecting privacy issues. An essential part of this project is the design of a reference model for electric mobility. Since several stakeholders have to cooperate on these issues, they need a common understanding of all the interrelated topics and official regulations referring to car manufacturers, utility companies, or providers of charging stations. Therefore, the design of appropriate ontologies forms an important part of this project, which is getting substantial input from the group of Rudi Studer at the Institute AIFB. A quite visible part of MeRegioMobil is the construction of a demo and research lab for the integration of (the batteries of) electric vehicles into a smart home environment. The smart home is equipped with intelligent household appliances like a refrigerator or washing machine and with solar panels and a micro-scale combined heat power plant. One of the challenges consists of balancing the demand and supply of electricity and heat so that personal preferences and network requirements are matched in the most efficient way possible. Scaled to a large number of households, this requires ontologies for effective communication and it relies on a potentially high degree of autonomy and self-organization, since it is infeasible to explicitly control the behavior of all the participating components. Self-organization in technical application scenarios and its adaptive control are the major topics of the research area of Organic Computing which has been influenced significantly by researchers from the Institute AIFB (see [41, 44, 48]). The research community in organic computing is concentrating on the design of system architectures and methods supporting controlled self-organization in highly distributed and dynamically changing environments. The overall goal of this research is the design of dependable systems which can operate in a highly autonomous way in spite of unanticipated situations in their operating environment, complying with the objectives and expectations of their human users (or their “controlling entities”). Therefore, communication and interaction in complex, highly networked technical application systems as addressed in Organic Computing could benefit significantly from technologies resulting from research on Semantic Web, as they would provide a basis for deriving meaningful interaction.
5 Conclusion In this contribution we have sketched a selection of research topics at the Institute AIFB which are examples of the broad interconnections between semantic web research and other areas of Applied Informatics. Due to restrictions of time and space, we have barely scratched the surface of the broad range of topics and joint research activities at the Institute AIFB. Some topics which we could not address but which are nevertheless highly relevant are the design of efficient algorithms for large scale applications on the Internet, the design of intelligent systems to support WebServices and service-oriented architectures and applications, aspects of Information Management and Market Engineering (http://www.ime.uni-karlsruhe.de), Software and Systems Engineering, and last but not least, Service Science. All these areas are represented at the Institute AIFB, and they provide the basis for cooperative research in challenging projects—in the past, at present, and in the future.
38
A. Oberweis et al.
Acknowledgements We wish to thank Agnes Koschmider for her contribution to Sect. 2 “Semantic Business Process Management”.
References 1. Agarwal, S., Hitzler, P.: Modeling fuzzy rules with description logics. In: Cuenca Grau, Bernardo, Horrocks, Ian, Parsia, Bijan, Patel-Schneider, Peter (eds.) Proceedings of Workshop on OWL Experiences and Directions, Galway, Ireland. CEUR Workshop Proceedings, vol. 188 (2005). Online: http://ftp.informatik.rwth-aachen.de/Publications/CEUR-WS/ Vol-188/sub5.pdf 2. Agarwal, S., Lamparter, S.: SMART: a semantic matchmaking portal for electronic markets. In: Proceedings of Seventh IEEE International Conference on E-Commerce Technology (CEC’05), pp. 405–408 (2005) 3. Ait-Kaci, H., Podelski, A., Smolka, G.: A feature constraint system for logic programming with entailment. Theor. Comput. Sci. 122(1&2), 263–283 (1994) 4. Albert, R., Barabási, A.L.: Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47–97 (2002) 5. Angele, J., Schnurr, H.P., Brockmans, S., Erdmann, M.: Real world application of semantic technology. In: Fensel, D. (ed.) Foundations for the Web of Information and Services, pp. 327– 341. Springer, Berlin (2011). This volume 6. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description-Logic Handbook. Cambridge University Press, Cambridge (2003) 7. Barabási, A.L., Dezso, Z., Ravasz, E., Yook, S.H., Oltvai, Z.: Scale-free and hierarchical structures in complex networks. In: Pastor-Satorras, R., Rubi, J., Diaz-Guilera, A. (eds.) Statistical Mechanics of Complex Networks. Lecture Notes in Physics. Springer, Berlin (2003) 8. Baudisch, A., Seese, D., Tuschik, P., Weese, M.: Decidability and quantifier-elimination. In: Barwise, J., Feferman, S., Model-Theoretic Logics, pp. 235–270. Springer, New York (1985). Chap. VII 9. Bergfelder, M., Nitschke, T., Sorge, C.: Signaturen durch elektronische Agenten— Vertragsschluss, Form und Beweis. Informatik Spektrum 28(3), 210–219 (2005) 10. Betz, S., Klink, S., Koschmider, A., Oberweis, A.: Automatic user support for business process modeling. In: Hinkelmann, K., Karagiannis, D., Stojanovic, N., Wagner, G. (eds.) Proc. Workshop on Semantics for Business Process Management at the 3rd European Semantic Web Conference, Budva/Montenegro, pp. 1–12 (2006) 11. Blohm, S.: Large-scale pattern-based information extraction from the world wide web. PhD Thesis at the Karlsruhe Institute of Technology (KIT) (2009) 12. Brachman, R.J., Levesque, H.J.: The tractability of subsumption in frame-based description languages. In: Brachman, R.J. (ed.) Proceedings of the National Conference on Artificial Intelligence (AAAI’84), Austin, USA, August 6–10, 1984, pp. 34–37. AAAI Press, Menlo Park (1984) 13. Brachman, J., Levesque, H.J.: Knowledge Representation and Reasoning. Elsevier, Amsterdam (2004) 14. Brockmans, S., Ehrig, M., Koschmider, A., Oberweis, A., Studer, R.: Semantic alignment of business processes. In: Manolopoulos, Y., Filipe, J., Constantopoulos, P., Cordeiro, J. (eds.) Proc. Eighth International Conference on Enterprise Information Systems (ICEIS 2006), pp. 191–196. INSTICC Press, Paphos/Cyprus (2006) 15. Conrad, M., Dinger, J., Hartenstein, H., Rolli, D., Schöller, M., Zitterbart, M.: A peer-to-peer framework for electronic markets. In: Peer-to-Peer Systems and Applications. Lecture Notes in Computer Science, vol. 3485. Springer, Berlin (2005) 16. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999) 17. Ehrig, M., Koschmider, A., Oberweis, A.: Measuring similarity between semantic business process models. In: Roddick, J.F., Hinze, A. (eds.) Conceptual Modelling 2007, Proc.
Semantic Web and Applied Informatics
18. 19.
20. 21. 22. 23. 24. 25.
26. 27. 28.
29. 30.
31.
32. 33. 34. 35.
36.
37.
38. 39. 40.
39
Fourth Asia-Pacific Conference on Conceptual Modelling (APCCM 2007), Ballarat, Victoria/Australia. Australian Computer Science Communications, vol. 67, pp. 71–80 (2007) Fitting, M.C.: Intuitionistic Logic Model Theory and Forcing. North-Holland, Amsterdam (1969) Franke, M., Rolli, D., Kamper, A., Dietrich, A., Geyer-Schulz, A., Lockemann, P., Schmeck, H., Weinhardt, C.: Impacts of distributed generation from virtual power plants. In: Proceedings of the 11th Annual International Sustainable Development Research Conference, pp. 1–12 (2005) Genesereth, M.L., Nilsson, N.J.: Logical Foundations of Artificial Intelligence. Morgan Kaufmann, Los Altos (1987) Geyer-Schulz, A.: Fuzzy Rule-Based Expert Systems and Genetic Machine Learning, second revised and enlarged edition. Physica-Verlag, Heidelberg (1997) Gil, R., García, R., Delgado, J.: Measuring the Semantic Web, ongoing research column: real world SW cases. AIS SIGSEMIS Bull. 1(2), 69–72 (2004) Gottlob, G., Szeider, S.: Fixed-parameter algorithms for artificial intelligence, constraint satisfaction and database problems. Comput. J. 51(3), 303–325 (2008) Grädel, E., Kolaitis, P.G., Libkin, L., Marx, M., Spencer, J., Vardi, M.Y., Venema, Y., Weinstein, S.: Finite Model Theory and Its Applications. Springer, Berlin (2007) Grimm, S., Steffen Lamparter, S., Abecker, A., Agarwal, S., Eberhart, A.: Ontology based specification of web service policies. In: Proceedings of Semantic Web Services and Dynamic Networks, Informatik04 (2004) Hendler, E., Berners-Lee, T.: From the semantic Web to social machines: a research challenge for AI on the World Wide Web. Artif. Intell. 174, 156–161 (2010) Hemaspaandra, L.A., Ogilhara, M.: The Complexity Theory Companion. Springer, Berlin (2002) Herre, H., Heller, B., Burek, P., Hoehndorf, R., Loebe, L., Michalek, H.: General Formal Ontology (GFO), Part I: Basic Principles, Version 1.0, OntoMed Report No. 8—July 2006. University Leipzig, Institute of Medical Informatics, Statistics and Epidemiology (IMISE) and Institute of Informatics (IfI) Department of Formal Concepts (2006). http://www.ontomed.de/ Hlineny, H., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326–362 (2008) Hornung, T., Koschmider, A., Oberweis, A.: Rule-based autocompletion of business process models. In: Proc. CAiSE Forum, 19th Conference on Advanced Information Systems Engineering, Trondheim/Norway (2007) Hornung, T., Koschmider, A., Lausen, G.: Recommendation based process modeling support: method and user experience. In: Li, Q., Spaccapietra, S., Yu, E., Olivé, A. (eds.) Proc. 27th International Conference on Conceptual Modeling (ER’08), Barcelona/Spain. Lecture Notes in Computer Science, pp. 265–278. Springer, Berlin (2008) Immerman, N.: Descriptive Complexity. Springer, New York (1998) Klir, G.J., Yuan, B.: Fuzzy Sets and Fuzzy Logic. Prentice Hall, New York (1995) Koschmider, A.: Ähnlichkeitsbasierte Modellierungsunterstützung für Geschäftsprozesse. Dissertation. Karlsruhe University Press, Universität Karlsruhe (TH) (2007) (in German) Koschmider, A., Oberweis, A.: Designing business processes with a recommendation-based editor. In: Rosemann, M., van Brocke, J. (eds.) Handbook on Business Process Management, vol. 1. Springer, Berlin (2010) Krötzsch, M., Rudolph, S., Hitzler, P.: Complexity boundaries for horn description logics. In: Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI-07), pp. 452–457. AAAI Press, Menlo Park (2007) Langston, M.A., Perkins, A.D., Saxton, A.M., Scharff, J.A., Voy, B.H.: Innovative computational methods for transcriptomic data analysis: a case study in the use of FPT for practical algorithm design and implementation. Comput. J. 51(1), 26–38 (2008) Libkin, L.: Elements of Finite Model Theory. Springer, Berlin (2004) MeRegio: Homepage of project MeRegio. http://meregio.forschung.kit.edu MeRegioMobil: Homepage of project MeRegioMobil. http://meregiomobil.forschung.kit.edu
40
A. Oberweis et al.
41. Müller-Schloer, C., Schmeck, H.: Organic computing: a grand challenge for mastering complex systems. it-Inf. Technol. 51(3), 135–141 (2010) 42. Näher, S., Wagner, D. (eds.): Algorithm Engineering: 4th International Workshop, Proceedings/WAE 2000, Saarbrücken, Germany, September 5–8, 2000. Lecture Notes in Computer Science, vol. 1982. Springer, Berlin (2001) 43. Niedermeir, R.: Invitation to Fixed-Parameter Algorithms. Ball, J., Welsh, D. (eds.) Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, London (2006) 44. SPP Organic Computing: Homepage. http://www.organic-computing.de/SPP 45. Pérez, J., Arenas, M., Gutierrez, C.: Semantics and complexity of SPARQL. In: Cruz, I., Decker, S., Allemang, D., Preist, C., Schwabe, D., Mika, P., Uschold, M., Aroyo, L.M. (eds.) ISWC 2006. Lecture Notes in Computer Science, vol. 4273, pp. 30–43. Springer, Heidelberg (2006) 46. Rabin, M.O.: Decidable theories. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 559–629. North-Holland, Amsterdam (1977) 47. Samer, M., Szeider, S.: Fixed-parameter tractability. In: Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability. IOS Press, Amsterdam (2009). Chap. 13 48. Schmeck, H.: Organic computing—a new vision for distributed embedded systems. In: Proceedings Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC 2005), Seattle, WA, USA, May 18–20, 2005, pp. 201–203. IEEE Comput. Soc., Los Alamitos (2005) 49. Schmeck, H., Karg, L.: Editorial: E-energy—paving the way for an Internet of energy. it-Inf. Technol. 51(2), 55–57 (2010) 50. Szeider, S.: Parameterized SAT. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Berlin (2008) 51. Tarski, A., Mostowski, A., Robinson, R.M.: Undecidable Theories. North-Holland, Amsterdam (1953) 52. Tserendorj, T.: Approximate assertional reasoning over expressive ontologies. PhD, Karlsruhe Institute of Technology (KIT) (2009) 53. Williams, R.: A new algorithm for optimal constraint satisfaction ant its implications. In: Proc. 31st ICALP. Lecture Notes in Computer Science, vol. 3142, pp. 1227–1237. Springer, Berlin (2004)
Effectiveness and Efficiency of Semantics Peter C. Lockemann
Abstract Processing of semantics by, e.g., analyzing ontologies, with the concomitant effort in building ontologies, will always have to compete with continuous advances in algorithms and encodings for graph theory, speech recognition and synthesis. Ultimately, the technique will prevail in a given situation that is superior in effectiveness (meeting a needed functionality not easily achievable by other means), and/or efficiency (providing the functionality with a minimum of resources). Coming from a database technology background, this paper gives a few examples of recent projects where the efficiency of database and web technologies was combined with the effectiveness of techniques around ontologies. The paper goes on to argue that by extending the concept of database views to semantics one obtains the means for systematically dealing with pragmatics.
1 To Start with: A Piece of History I have known Rudi Studer for about 25 years now. We first met when I tried to hire him as the senior scientist for my new research group at FZI. Unfortunately for me, but perhaps fortunately for him, he succumbed instead to an offer from IBM where he joined the LILOG project. LILOG (“Linguistic and logic methods and tools”) was a large project where young scientists from IBM collaborated with the best linguists and logicians from academia to develop technologies for the evolving need of natural language as an end-user interface—German in this case. The ultimate goal was to have a system that understands German text and to apply it to large bodies of text to build—what one would term today—a “knowledge base”, and then to use it to answer arbitrary questions. The project had an advisory board with professors Brauer, Schnelle and myself who regularly met with the project group over the course of 6 years. This is how I got to know Rudi Studer and his initial P.C. Lockemann () Karlsruhe Institute of Technology (KIT), Department of Informatics, 76128 Karlsruhe, Germany e-mail:
[email protected] P.C. Lockemann Forschungszentrum Informatik, Karlsruhe, Germany D. Fensel (ed.), Foundations for the Web of Information and Services, DOI 10.1007/978-3-642-19797-0_3, © Springer-Verlag Berlin Heidelberg 2011
41
42
P.C. Lockemann
work on semantics quite well. Rudi’s role was in developing systematic methods and tools for knowledge based systems, something that was then and still now is called “knowledge engineering”. LILOG published a final report in 1991, a volume of 750 pages that attests to the huge scientific output [1]. The advisory board was invited to write an introductory chapter [2]. I recently reread the chapter and was quite amused to find the following text. Everyone has faced this situation one time or another. Suppose you arrive by train in a city that you are not familiar with. Before leaving the station you look for a street map, and a plan for the public transportation network to find the best way to get to your destination. You wonder whether it is best just to walk, to take a bus or streetcar and if so which one, or to jump into a taxicab. Indeed, you find a city map right by the exit. You consult the alphabetic street guide which identifies the grid in which to search further. Examining the grid on the map you finally locate the desired street, but alas it is a very long one, and it takes considerable searching for the fine print to identify a house number close to the one of your destination. Now you scan the neighborhood to find the red line signifying a streetcar line close by, and the red dot which indicates a stop. Unfortunately, it is several streets and corners away so that you now memorize the directions and turns to take after alighting from the streetcar. Finally you make an educated guess as to the name of the streetcar stop. Walking out of the station you discover a streetcar stop in front of you. You hope to find a network plan there and a timetable, and indeed you do. On closer inspection you detect the streetcar stop—you guessed its name right. Unfortunately, there is no direct connection so you must change cars. Worse, there seem to be several possibilities to do so. Which one is the best? And how long do you have to wait for the next streetcar? How long would you have to wait for the connecting car? Turning to the timetable you determine that— since it is long after rush-hour—the streetcar runs every twenty minutes, and the previous one left just five minutes ago. By that time you probably become conscious of the taxi stand right across, you walk over and take a cab which brings you to your destination within fifteen minutes and without further ado. How much easier would it be if the city had an information desk at the station where you could just ask for the best way. But staffing such desks is an expensive affair these days, so you never seem to find one. But why have a person there? All you really need is a microphone close to the street map where you explain in your own language where you wish to go. A loudspeaker may convey to you the various alternatives you have, you may ask questions for clarification, an illustration may appear on the map to show you the route you should take, and finally a printer may provide you with a written log of the final recommendation. You may even go and ask for further advice on where to obtain the most suitable ticket, whether you need exact change or may use bills, and so on.
Effectiveness and Efficiency of Semantics
43
2 The Future Has Arrived—Or Has It? What is so amusing about the story from today’s perspective? Well, almost everyone keeps much of that hypothetical automatic help in his or her pocket. Smartphones will instantaneously provide you with all the needed information, by being location aware they minimize the dialog to a few keystrokes or sweeps across the touch pad, and with their high-resolution screens they provide comfortable visualizations. Tickets may be purchased by and loaded on the phone. True, acoustic input and output is not the rule, but that is more an issue of suitability than availability, as everyone using navigation help in an automobile can attest to. And all that has come about without any of the sophisticated semantic techniques and tools developed by LILOG and other research groups. Rather, most of the progress is due to spectacular advances in graph, speech recognition and synthesis algorithms and encodings, and the like. Of course, one may argue that the functionality is limited to a fairly narrow discourse domain. But then, for all practical purposes an ambitious semantic analysis must be limited in its domain as well in order to be effective and efficient. Is semantics a purely academic endeavor without practical needs, then? Not really, because even this simple scenario demonstrates some shortcomings. True, information—in smartphones as well as in navigation systems—often becomes focused by taking location into account. Location, however, is just one contextual characteristic. Why not make use of the calendar (if the meeting is in 15 minutes the system should only recommend a taxi), or purpose (if the visit is private, public transportation is a more likely choice)? Suppose also that after business you want to meet an old friend, and you are looking for a cozy café that serves your favorite pancakes and is within walking distance of your friend’s. Or what do you have to do if your streetcar suddenly gets held up by an accident? Try that with today’s smartphones, and you will fail miserably. Apparently, whenever you can state your problem only in general and qualitative terms but still need a definite solution— provided there is one at all—there seems to be good reason to invoke semantics as part of developing the solution.
3 A Database Techniques Perspective Evidently, semantics has an important role to play. As a database person I have been particularly intrigued by the impact semantic techniques have had on the growing interconnection of hitherto quite separate techniques, structured databases and semistructured or unstructured textual information [3]. But this interconnection not withstanding, in the face of an explosive growth of database volumes, performance—or efficiency—remains the single most pressing issue in practical applications. Even after more than 30 years of existence, relational databases remain the mainstay of data archiving because they are the most efficient way to store, select and access data, particularly if the data are to be interrelated. Consequently, some domain semantics can be translated into structural aspects of relations and referential key constraints
44
P.C. Lockemann
as described in a database schema, while the interpretation and exploitation of the remaining semantics is left to the user. Even today there is a tendency to process Web content by extracting information from the material and pressing it into some sort of structure [3, 4]. Another classical technique to achieve efficiency is indexing. It is a central part of relational databases but also exists independently, for example in information retrieval systems. Index techniques solely rely on textual correspondences, so again the link to semantics is left to the external user. Semantics is often tied to large data collections. Hence to be efficient, semantics should make good use of database and index systems. Effectiveness—meeting a needed functionality not easily achievable by other means—of semantic techniques will then have to be achieved by explicating the semantics on a layer on top of these systems. I shall use three examples from research in my FZI team to illustrate the approach: • How can one efficiently integrate semantics into the classical retrieval process? • How can one incorporate the rich semantics of images into database systems? • How can one effectively develop the semantic structures for a new domain? Semantics by itself is just a large pool of knowledge. Pragmatics is about turning the knowledge into actions. Actions need only a narrow part of semantic knowledge relevant to a given situation. The context of an action directs what should be visible in the knowledge base. In database parlance, context imposes a view on semantics. By narrowing visibility, views have the potential to further raise the efficiency of semantics. I shall discuss two further examples to demonstrate the issue: • How can one integrate personalized context into the retrieval process? • How well can semantics help in unexpected but nonetheless restricted situations? In the following we address each of these examples in turn.
4 Effectiveness and Efficiency 4.1 Ontologies in Information Retrieval The prevailing technique in information retrieval (IR) is the vector space model. Originally, authors or other specialist personnel employed background knowledge to annotate document texts with index terms that somehow relate to the content. Specialists search for interesting documents by querying the document base and couching the problem in expressions over search terms. Document retrieval is by and large based on the concurrence of index and search terms. Since authors and specialists view documents or solution space, respectively, from different angles, there are always relevant documents that are being missed (success is measured in terms of recall), and among those retrieved many are deemed irrelevant (success is described in terms of precision). To improve on both measures, one has included synonyms almost since inception of the technique.
Effectiveness and Efficiency of Semantics
45
Due to its high cost, manual annotation has long been supplanted by automatic annotation. Automatic annotation draws the index terms from the physical text (hence it is referred to as full-text search). Clearly, it results in a huge number of index terms. To discriminate somewhat among the large number of terms, relevance weights are computed by various statistical frequency measures and attached to the terms. Since the method is biased towards the choice of words by an author, the likelihood of mismatch between index and search terms will increase and the problems of precision and recall will be amplified. To overcome the relevance problems of full-text search, one may mimic manual annotation by automatically adding related index terms that are not explicitly contained in the text (so-called metadata). Metadata are drawn from thesauri—an early form of onotologies. However, there is no unambiguous evidence that thesauri have indeed a positive impact: while they definitely improve recall they often have a detrimental effect on precision. This raises the question of whether ontologies, because of their richer semantics, could have a more positive effect, i.e., raise both recall and precision over simple full-text search. In his dissertation, G. Nagypal has carefully examined the question [5]. He selected a test collection from the English Wikipedia web encyclopedia, defined a suite of test queries that employed abstract concepts that rarely showed up in the test documents, and then developed an ontology for those abstract concepts. A novel and intricate algorithm for deriving weighted metadata was used, that matches text fragments to ontology terms and then extends the metadata base. A non-trivial problem is how to combine the results of full-text and metadata search. He developed several variations. Equally difficult was the establishment of a full-text search baseline, so that several baselines (full-text search queries) had to be used. Add to this that the results quite definitely depend on the quality and sophistication of the algorithm for deriving the metadata, and one would hardly expect that unambiguous answers can be found. But the results are fairly unambiguous. Nagypal could show that metadata search already provides by itself good results in those areas that are covered by an ontology. Since ontology construction is a cumbersome and expensive affair, one would like to know whether, in terms of search quality, an imperfect ontology could be compensated for by full-text search. This seems to be true only as long as the ontology is comparatively poor, otherwise the high quality of metadata search seems to dominate. Finally, how much effort should be extended in perfecting an ontology? Nagypal explored the question in an indirect way, by leaving out certain steps in the metadata derivation. There, the results are somewhat mixed depending on which steps were left out. To be on the safe side, then, the complete algorithm should be applied. Now, given that ontologies are effective in improving search results, one wonders whether that improvement comes at the price of efficiency, since after all, ontologies must be structurally analyzed if not processed by deductive means. Moreover, one has a choice between utilizing the ontology at indexing time or at retrieval time. This is a typical problem of cost distribution: If a document is rarely or never used, the added cost of indexing does not amortize, if it is accessed quite often, the cost added to query processing multiplies.
46
P.C. Lockemann
Fig. 1 IRCON system architecture
Nagypal decides in favor of utilizing ontologies during indexing, not the least because by augmenting the list of index terms per document, the high efficiency of the vector space model can be fully utilized. He runs a number of experiments and measures the execution times for the two independent searches, full-text search and metadata search, and for the combination of the two results, as well as the additional overhead for, e.g., query parsing, loading of the results, and output generation. It turns out that the time for metadata search occupies only a fraction of between 10 and 30 percent of full-text search, and total response time remains in the realm of a few seconds. Figure 1 shows the system architecture of the IRCON prototype and demonstrates how different systems have been chosen where each has its special strengths: Lucene for high-performance index management, POSTGRES for efficient management of the structured data, GATE for efficient and effective natural language processing. The figure clearly demonstrates the use of ontologies at indexing time and the efficient use of the index search engine for both, full-text and metadata search. In summary then, if done in a technically sophisticated way, semantics can add effectiveness to information retrieval without loss of efficiency.
4.2 Semantics in Image Retrieval As the saying goes, “a picture is worth more than a thousand words”. There is much more information in a (two-dimensional) image than in a (linear) text. One would expect, then, that retrieving pictures from an image repository offers far more op-
Effectiveness and Efficiency of Semantics
47
Fig. 2 Retrieval of and navigation across images
portunities than text retrieval. Conversely, one should also expect that annotating pictures in a repository offers far more challenges than annotating pure text. Beginning with the opportunities, consider the following example from the ImageNotion project [6–8]. Take Fig. 2. Suppose you wish to retrieve a picture of Hermann Göring visiting the Vichy government. Given some suitable annotation (“Hermann Göring”, among others) and some background knowledge that the Vichy regime governed parts of France during World War II, you may ultimately retrieve the center image in Fig. 2. This image may now become the starting point for further navigation through the repository. For example, the annotation includes a description of the location where the picture was taken (St. Florentin-Vergigny). One may now navigate to other pictures taken at the same place, and may retrieve one that shows the railway car where the armistice was signed at the end of World War I. From there one may continue to navigate to the French marshal Foch provided the annotation of “Marshal Foch” was derived from analyzing smaller sections of the picture that seem to contain persons. The same principle may apply to the starting point where Philippe Pétain (the head of the Vichy government) had been recognized, and from there one may search for further pictures of Pétain. The ImageNotion project drew heavily from the experiences of G. Nagypal’s dissertation. For example, for efficiency reasons retrieval of images should make use of the vector space model. Consequently, annotations will have to be by textual index terms that can then be extended via an ontology. But this clearly is not sufficient. Since image parts are images in their own right, one obtains a (linked) part-of hierarchy of images. Moreover, to navigate across images requires further semantic
48
P.C. Lockemann
Fig. 3 Annotation of images
links (relations) between images. Often there is also background text accompanying the image, e.g., on a web page. To deal with these rich structures, the ImageNotion project introduces two core ideas. The first is the concept of “imagenotion” as a description of a picture (which may itself be part of a larger picture) and combines the picture, the textual annotation, and several links to its parts or its parent, to the imagenotions of related pictures, and to accompanying textual material. What is being retrieved, then, are imagenotions where the user may then decide which of its constituents to display. Since the imagenotions represent a good deal of semantics the second—almost natural— idea is to introduce the imagenotions as nodes into a traditional ontology. Thus retrieval may start by localizing one or more imagenotions and continue by exploiting any of the relations in the ontology. G. Nagypal and A. Walter have run several empirical studies to verify that image archive users inexperienced in semantics and particularly ontologies could easily familiarize themselves with the retrieval technique. Not surprisingly, the complex semantic structures have a counterpart in a complex annotation process. Figure 3 illustrates the elements of this process for the picture of St. Florentin-Vergigny in 1918. There are two ways to start the process: Either there is an expert who knows enough about the picture to manually add index terms, or there is background text (as shown in the figure) to which classical text analysis techniques are applied. Either way, it makes sense to augment the resulting terms by terms gained from an ontology describing the general background, leaving only the more specialized ontology to the retrieval phase. The subsequent step concentrates on the discovery of the image parts (that can then again be annotated). Two sets of discovery algorithms are used, one by NTUA for persons and object detection, and a second by Fraunhofer-Gesellschaft applied after person detection
Effectiveness and Efficiency of Semantics
49
Fig. 4 ImageNotion system architecture (data management level)
to find the faces (including gender determination) and to identify a face provided an annotated picture can be found in the archive where the face has already been associated with a person. In this case one can also establish navigational links among the pictures. Figure 3 also shows that the automated part of the annotation process may be applied iteratively in order to correct or refine the previous result. The quality of the annotations (the metadata) is critical for retrieval effectiveness, since in contrast to Sect. 4.1 no full-text search is available to compensate for incomplete metadata. Early experiments showed that users had great difficulties to cope with preconstructed ontologies. Therefore it was decided to start out with a small domain-independent ontology and then have the users, during annotation or retrieval, add to the ontology (and, incidentally, also the imagenotions) on their own terms. As a lesson, it seems that from a purely practical standpoint effectiveness of semantics can often be raised if one leaves much of its acquisition in the hands of the users. Efficiency of retrieval depends on the indexing technique, but also on efficient storage of the imagenotions because of their use in navigation. Figure 4 shows the main extensions to the data management level as compared to the IRCON architecture. MySQL is used in place of POSTGRES and manages the annotations, links, textual material and standard ITC photo metadata, and a file system serves as the image repository.
4.3 Collaborative Ontology Building The previous Sect. 4.2 claims that under certain conditions effective semantics requires collective ontology building. One may argue that this has to do with the wide range of domains covered by the pictures. However, while developing a serviceoriented environmental information systems [9] we discovered that difficulties arise even for narrower domains such as environmental data, be they measurement data, analysis results, diagrams, or regulations. The difficulties are due to the wide differences in viewpoints that users apply to environmental data. An essential component of a service-oriented infrastructure is the central service registry. Take an analyst who has been given the task to build a new public information portal for flood emergency management and has to find the already published
50
P.C. Lockemann
Fig. 5 Collaborative ontology building
services that might be useful. Suppose the analyst searches for a suitable service under the term of “flood level”. Then he or she will in all likelihood miss a service for retrieving the current water level of rivers, even though this would be a good candidate for building the portal. If we had a relation from “flood level” to “water level” and used it in the discovery process, chances would be much higher that more of the appropriate services would be found. More to the point, the same service implementation may be applicable in different business situations and, hence, may require quite different semantic descriptions. Take again the water level service. It may be viewed, and employed, differently by a flood manager, the manager of a river shipping company and the manager of a hydropower plant. In general, business users need to know which services are available for which business purpose, how these services can be connected, which services have to be replaced when a business process has to be changed, or whether new services are needed in order to adapt to new requirements. We decided to take a more methodical (and, hence, more general) approach to collaborative ontology building that serves all stakeholders. Accordingly, we look for a solution that lets the ontology evolve in communication and collaboration of the business experts whenever one sees the need. In today’s networked world such a solution should exploit what is called a “social network”. Figure 5 shows the system architecture. It consists of four main components: a UDDI-based technical registry, a Semantic MediaWiki-based business registry, an ontology server and an ontology engineering component. The figure also indicates the basic workflow within the architecture. A software developer as a service publisher can use any UDDIcompatible client to publish a new service into the registry, which may also include
Effectiveness and Efficiency of Semantics
51
a technical description like a WSDL file in the case of a Web service. In addition to the technical description, the software developer may add some keywords based on the ontology in order to roughly categorize the business use of the Web service. The content of the UDDI Registry is dynamically embedded into the content of the Semantic MediaWiki that forms the business-oriented registry. The keywords chosen by the software developer are used as an initial categorization for the service. From now on business users can search or navigate along the contents of the Semantic MediaWiki, add additional information to the dynamically generated pages, or create new pages. Since we cannot expect the analysts to be experts in building ontologies, the engineering of the ontology should be made as simple as possible. A Semantic MediaWiki is ideal as a frontend for business analysts because it is easy to use, allows adaptation to dynamic changes, stimulates collaboration among analysts, and is a suitable framework for the semantic needs. The ontology is visualized as a graph, and all modifications can be easily done by dragging and dropping the nodes of the visual presentation. The range of possible modifications is restricted (hence the name “lightweight engineering” [10]). For example, concepts can only be connected via broader-narrower and related relations. Business analysts can create new Wiki pages or modify existing ones (including generated Wiki pages) for the purpose of adding further annotations. The annotation of Wiki pages can be carried out by means of such Semantic MediaWiki features as semantic links, semantic attributes, and inline queries (to embed dynamic content). Many annotations can be obtained from the ontology by navigating through it and extracting further facts, or by using a reasoner to derive implicit facts or some of the semantic links. Without overly expensive controlled experiments it is difficult to evaluate the cost savings if any. First experiences have been gained with the environmental information system of the state of Baden-Württemberg. The initial ontology we have used is based on an already existing and widely used taxonomy. The technical infrastructure as described above was developed in close communication with more than 10 representatives of business analysts and 5 representatives of developers, and was rolled out for a first testing period in April of 2007. First experiences seem to support our expectations for the narrow scope of environmental information systems.
5 Raising Efficiency Through Views 5.1 Personal Profiles as Views In Sect. 3 I argued that to turn semantics into actions one would need to impose a view on semantics to identify the contextual knowledge for the actions. In some of the work at FZI, and also in preparing for a large regional project, we developed a number of scenarios for which I give a few examples below. Common to all of them is that the situational information is highly personal (hence, the term “(personal) profiles”).
52
P.C. Lockemann
• For workplace learning, the context should cover the personal skills of the employee, his or her past learning activities, his current problem situation and knowledge defects, the available time and date for learning, his technical environment, his colleagues for potential help, etc. [11–13]. • For smart care (also: ambient assisted living), the context encompasses the health profile, medication regime, nourishment constraints, calendar with visits to physicians or by home services, nearby friends (for example, if the home care service has to locate the person when it is not at home) [14]. • For other social services, one may set up a platform where the profiles of young children with working parents, or of mobility-impaired seniors that ought to be entertained, could be matched to profiles of active seniors who look for opportunities to help others [15]. • For commuting, profiles of persons wishing to travel from home to workplace and vice versa at a given time range without using their own car could be matched against profiles of commuters who offer seats in their cars [15]. • For areas such as northeastern Germany where the declining population has lead to the thinning of government services, medical services, or shopping opportunities, the “consumer-to-provider” principle should be replaced by a “provider-toconsumer” principle. This requires a new kind of “smart” logistics that would be based on the personal profiles of the consumers [15]. Now suppose that each of these environments is supported by a set of IT services. To serve an individual person, a service must be adapted to an individual’s needs (“personalized services”). To do so the service platform must link the service specification, the personal profile, further background information and the current situation such as time or location. Depending on the kind of service, only part of the profile will have to be taken into account. Just consider home care where writing the shopping list and directing the home care service to the neighbor’s look at different parts of the profile, i.e., take different views on the profile. If there is need for reasoning, views may contribute to efficiency because only a predefined part of it must be processed. Taking cues from database technology, views may be virtual—the view is constructed from the profile at use time—or materialized—constructed at definition time and stored separately. Either form must be examined in the light of meeting the highest standards for protecting the privacy of individuals.
5.2 Coping with the Rare: Navigating Across Views The applications of Sect. 5.1 are comparatively static: The profiles and the semantics implicit in the services and explicit in the background knowledge are fairly stable, only time or location remain dynamic. In the scenario below the context is more fluid and, incidentally, also richer. In the face of global competition, companies must streamline their production processes to keep production in Germany. An important aspect is to invest as little
Effectiveness and Efficiency of Semantics
53
Fig. 6 Resilience management
capital as possible. An approach currently adopted by the automobile industry attempts to supply production plants with smaller batches of parts and to compensate for the smaller size by a higher frequency of delivery. To do so without raising transportation costs requires new concepts in transport logistics. These include combining small-size batches, possibly from different sources, into larger transport units, cooperation among transport companies, and a higher collection frequency at parts producers. The LogoTakt project studies a solution based on stable cyclic schedules along all stages of the supply chain [16]. An added value of the approach is that such schedules allow a shift away from highway to rail transportation. A weakness of the approach is that deviations from the plans and disruptions of resources along the way have a fairly immediate effect on regular schedules. LogoTakt pursues the objective of resilient schedules that remain reliable in the presence of such disturbances. It achieves resilience by assuming that the types of disturbances can be foreseen whereas what cannot be predicted is the type actually occurring and the time or place where it occurs in the chain. Resilience is based on the notion of buffers as spare resources in time, space or volume. Abstractly speaking, one could establish some sort of resource semantics that describe the resources together with all the factors affecting their use. For reasons of efficiency one would like to examine as little of the semantics as possible. Consequently, the views are organized in a hierarchy of increasing scope to be examined. Figure 6 illustrates the principle. Planning of the transport processes and—based on failure statistics—of the buffers is the responsibility of the planning platform. During normal operation the platform also collects all events signaled from the processes. Unless an event already refers directly to a disruption, e.g., by a driver’s message, it is compared to
54
P.C. Lockemann
the plan to check for a deviation. In either case, a suspected disturbance (1) is sent to the deviation detection where it is analyzed in more detail. If the deviation can be tolerated no further action is necessary. Otherwise the details (2) are passed on to the resilience manager. An important component is the workflow manager that maintains a history of earlier disturbances and the reactions to them. The resilience manager queries this system for similar situations (3), e.g., using case-based reasoning, and an adequate response (4). If none is forthcoming, the resilience manager will call on the disturbance resolver (5) to develop a solution. Basically the resolver attempts to find a buffer of least cost and/or least impact on the resolution of possible later disturbances (6). In doing so, it starts from an inspection of the most local solutions and if none can be found escalates along the hierarchy to solutions that take a wider context into account. For example, tour local solutions exist if an incomplete load is supplied or the load is provided late but the delay can be compensated for by changing the order of tour points. Transport local solutions inspect the entire chain. It may very well be that several tours serve the same freight train in the schedule so that a delayed supply of parts may be picked up by the next tour and still reach the train on time. This may also be true if a truck breaks down and a replacement truck runs the tour at a later time. A purchase-order local solution includes the consumer in the chain. For example, a supermarket-based production allows a slack of up to one day so that a delivery delayed by several hours may be acceptable. Fleet-internals are somewhat different in that they focus on the resources of a transport company rather than the supply chain. For example, they examine whether idling trucks or drivers are available, or the company has the means for intermediate storage. Finally, if all other buffers fail a network-wide solution considers for each stage in the chain other transport companies that may have spare resources. Finding a solution on this level entails more or less complicated negotiations, keeping in mind that the companies involved usually are fierce competitors. We also note that solutions on higher levels must usually be fed back to the lower levels and ultimately to the tour local level where the final solution for the tours must be determined. The solution found is returned to the disturbance resolver and the resilience manager who communicates it to the planning platform so that it can modify the current plan, and to the workflow manager to place it in its history base. Whereas in Sect. 5.1 a single view is employed during an action, in the present scenario the action may have to navigate across several views. The lower the view in the hierarchy the more often is it invoked. Consequently, view processing must perform better on the lower levels, and algorithmic solutions are essential (and possible) on these levels, whereas on the higher levels solutions that interpret semantics (e.g., reason on them, employ agent technology [17]) are necessary and become feasible. Hence, views seem predominantly a means of raising efficiency. As one of the reviewers seems to suggest, view hierarchies may also be a vehicle for improving on effectiveness. Depending on the characteristics of the view one may have a good chance to identify the technique most suitable for its level, and the division of work among the levels may also improve the chances for off-the-shelf solutions. Our present experience, however, is still limited to the lower levels. We
Effectiveness and Efficiency of Semantics
55
hope to proceed to the higher levels, perhaps in a different scenario such as emergency management, to test our hypothesis that view hierarchies do indeed contribute to efficiency while preserving effectiveness, and to examine whether effectiveness can be raised in an efficient manner.
6 Conclusions “Semantics” has always been many things to many people. To linguists semantics deals with the meaning of linguistic phenomena (words, sentences, paragraphs, documents), to logicians it is a well-defined interpretation in a model, to programming language people it is a set of mathematical objects to guide verification and implementation, to database experts it is purely the database structure from which to derive query execution efficiency without concern for content, for knowledge management scientists like Rudi Studer it is domain knowledge structured into ontologies and subject to deductive techniques in order to assist persons in interpreting documents, or to pass the interpretations on to more sophisticated machine processing. As a database person my own work has always emphasized structural aspects and the efficiency issues that go with them, and my view of the world has always been one of clearly identifiable entities and the relations among them. Database resilience has also been a central issue, but again with leaving the responsibility for semantics to transactions and focusing on efficient preservation of these semantics. But as my research group at FZI has become acquainted with parallel work going on in Rudi Studer’s FZI group, we have come around to see the need for emphasizing effectiveness as well and, hence, to integrate semantics in his sense into our work on information systems. The examples in this paper are thus a tribute to his influence (not the least because he reviewed some of our dissertations). Of course, one never sheds one’s own background, so we tend to look on semantics through the prism of database technology—witness the view concept or the tendency to use layered architectures where semantic solutions are always put “on top of” database solutions. It has always been a pleasure to collaborate with Rudi Studer. Acknowledgements The author wishes to express his gratitude to his former and current young colleagues and scientists Carsten Holtmann, Gabor Nagypal, Jens Nimis, Natalja Pulter, Andreas Schmidt, and Andreas Walter whose work forms the substance of this paper.
References 1. Herzog, O., Rollinger, C.-R. (eds.): Text Understanding in LILOG. Lect. Notes Comput. Sci., vol. 546. Springer, Berlin (1991) 2. Brauer, W., Lockemann, P.C., Schnelle, H.: Text understanding—the challenges to come. In: Herzog, O., Rollinger, C.-R. (eds.): Text Understanding in LILOG. Lect. Notes Comput. Sci., vol. 546, pp. 14–28. Springer, Berlin (1991)
56
P.C. Lockemann
3. Weikum, G.: DB and IR: both sides now. In: Proc. ACM SIGMOD Intntl. Conf., pp. 25–29 (2007) 4. Agrawal, R., et al.: The Claremont report on database research. Commun. ACM 52(6), 56–65 (2009) 5. Nagypal, G.: Possibly Imperfect Ontologies for Effective Information Retrieval. Universitätsverlag, Karlsruhe (2007) 6. Walter, A., Nagypal, G.: ImageNotion—methodology, tool support and evaluation. In: On the Move to Meaningful Systems 2007. Proc. Confed. Intntl. Conf. CoopIS/DOA/ODBASE/ GADA/IS. Lect. Notes Comput. Sci., vol. 4803, pp. 1007–1024. Springer, Berlin (2010) 7. Walter, A., Nagypal, G.: The combination of techniques for automatic semantic image annotation generation in the IMAGENOTION application. In: Proc. 5th European Semantic Web Conference (ESWC) (2008) 8. Walter, A., Nagypal, G., Nagi, K.: Evaluating semantic techniques for the exploration of image archives on the example of the ImageNotion system. Alex. Eng. J. 47(4), 327–338 (2008) 9. Paoli, H., Schmidt, A., Lockemann, P.C.: User-driven semantic Wiki-based business service description. In: Schaffert, S., Tochtermann, K., Pelegrini, T. (eds.) Networked Knowledge— Networked Media: Integrating Knowledge Management, New Media Technologies and Semantic Systems, pp. 269–284. Springer, Berlin (2009) 10. Braun, S., Schmidt, A., Zacharias, V.: SOBOLEO: Vom kollaborativen Tagging zur leichtgewichtigen Ontologie. In: Gross, T. (ed.) Mensch & Computer – 7. Fachübergreifende Konferenz – M&C 2007. Weimar, pp. 209–218. Oldenbourg Verlag, München (2007) 11. Schmidt, A.: Microlearning and the Knowledge Maturing Process: Towards Conceptual Foundations for Work-Integrated Microlearning Support Microlearning, Innsbruck (2007) 12. Braun, S., Schmidt, A., Hentschel, C.: Semantic desktop systems for context awareness— requirements and architectural implications. In: 4th European Semantic Web Conference (ESWC) (2007) 13. Maier, I., Schmidt, A.: Characterizing knowledge maturing: a conceptual process model for integrating e-learning and knowledge management. In: Conf. Professional Knowledge Management—Experiences and Visions, Potsdam (2007) 14. Kunze, C., Holtmann, C., Schmidt, A., Stork, W.: Kontextsensitive Technologien und Intelligente Sensorik für Ambient-Assisted-Living-Anwendungen. 1. Deutscher Kongress AmbientAssisted-Living (AAL ’08). VDE-Verlag, Berlin (2008) 15. Antrag im Spitzencluster-Wettbewerb des Bundesministeriums für Bildung und Forschung “Vertrauenswürdige Dienste für intelligente Infrastrukturen”. Cyberforum e.V. Karlsruhe (2009) 16. Pulter, N., Nimis, J., Lockemann, P.C.: Störungsmanagement in offenen, getakteten Logistiknetzen. Künstl. Intell. 24(2), 131–136 (2010) 17. Lockemann, P.C., Nimis, J.: Dependable multi-agent systems: layered reference architecture and representative mechanisms. In: Barley, M., et al. (eds.) Safety and Security in Multiagent Systems—Research Results from 2004–2006. Lect. Notes Artif. Intell., vol. 4324, pp. 27–48. Springer, Berlin (2009)
Knowledge Engineering Rediscovered: Towards Reasoning Patterns for the Semantic Web Frank van Harmelen, Annette ten Teije, and Holger Wache
Abstract The extensive work on Knowledge Engineering in the 1990s has resulted in a systematic analysis of task-types, and the corresponding problem solving methods that can be deployed for different types of tasks. That analysis was the basis for a sound and widely accepted methodology for building knowledge-based systems, and has made it possible to build libraries of reusable models, methods and code. In this paper, we make a first attempt at a similar analysis for Semantic Web applications. We will show that it is possible to identify a relatively small number of task-types, and that, somewhat surprisingly, a large set of Semantic Web applications can be described in this typology. Secondly, we show that it is possible to decompose these task-types into a small number of primitive (“atomic”) inference steps. We give semi-formal definitions for both the task-types and the primitive inference steps that we identify. We substantiate our claim that our task-types are sufficient to cover the vast majority of Semantic Web applications by showing that all entries of the Semantic Web Challenges of the last 3 years can be classified in these task-types.
1 Preface: Rudi Studer’s Journey from Knowledge Engineering to the Semantic Web (and Back Again) The last 20 years of Rudi Studer’s the intellectual journey illustrate the journey that an entire group of researchers has taken: starting with work on structured methods for building Knowledge Based Systems (which were isolated systems in a highly structured environment), they have migrated to working on the Semantic Web: developing knowledge intensive methods for the open and unstructured environment of the World-Wide Web. Section 3 and further are a slightly revised reprint under permission from K-CAP’09: Proc. of the 5th International Conference on Knowledge Capture. ©ACM (2009). doi http://doi.acm.org/ 10.1145/1597735.1597750. The revisions are based on the very detailed and insightful comments that we received from an anonymous reviewer during the preparation of this volume. F. van Harmelen () Dept. of Computer Science, Vrije Universiteit Amsterdam, Amsterdam, The Netherlands e-mail:
[email protected] D. Fensel (ed.), Foundations for the Web of Information and Services, DOI 10.1007/978-3-642-19797-0_4, © Springer-Verlag Berlin Heidelberg 2011
57
58
F. van Harmelen et al.
The early work on Knowledge Based Systems revolved around the discovery and definition of Problem Solving Methods, and the identification of Ontologies as a structuring principle. The first appearance of the Web was as a medium for discovering and exchanging Problem Solving Methods and Ontologies. Later, the roles reversed: no longer was the Web the medium for exchanging Ontologies, but instead Ontologies became a structuring principle for the Web itself, a cornerstone of what we now know as the Semantic Web. However, somewhere along this journey the Problem Solving methods got lost. At the 2009 KCAP conference, we wrote a paper about bringing the Problem Solving Methods back to the Semantic Web, thereby completing the full-circle that Rudi’s work has been making over a period of two decades. We therefore dedicate this work to the celebration of Rudi’s career on his 60th birthday. Before launching into our technical argument (namely that the Semantic Web is as in need of re-usable reasoning patterns as Knowledge Based Systems were 20 years ago), we will first trace the historical developments that led to this paper by highlighting key steps in Rudi’s work over the past two decades. Early Work on Problem Solving Methods: Rudi’s work in the early ’90s on the methodology MIKE and its associated formal specification language KARL focused on the description of “problem solving methods”: these were structured patterns of inference that could be re-used across multiple domains, and were concerned with reasoning tasks such as diagnosis, monitoring, classification, design, etc. The first publication of this work appeared in the legendary Banff workshop series: Angele, J., Fensel, D., Landes, D., Studer, R.: KARL: an executable language for the conceptual model. In: Proceedings of the 6th Knowledge Acquisition for Knowledge-Based Systems Workshop (KAW-91), Banff, Canada, October 6–11 (1991)
First Mention of Ontologies in Rudi’s Work: Although it was always apparent that the domain knowledge used by the reasoning patterns could be structured and re-used in similar ways, this only started to get serious attention at a later period, around the mid ’90s. The word “ontology” started to become a very popular term. Rudi’s first publication that we were able to find which uses the O-word was in the EKAW series: Pirlein, T., Studer, R.: KARO: an integrated environment for reusing ontologies. In: Proceedings of the European Knowledge Acquisition Workshop (EKAW-94), Hoegaarden, Belgium, September 26–29. Lecture Notes in Artificial Intelligence (LNAI), vol. 867, pp. 200–225. Springer, Berlin (1994)
First Appearance of the Web as an Exchange Medium: In this same period, it was becoming clear that the Web would change the face of almost every area of Computer Science, including Knowledge Engineering. The first move that the Knowledge Engineering community made was with regards to the Web as the exchange medium for their Knowledge Engineering objects, the ontologies and the problem solving methods. One of Rudi’s early publications that runs in this same vein is:
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
59
Benjamins, R., Plaza, E., Motta, E., Fensel, D., Studer, R., Wielinga, B., Schreiber, G., Zdrahal, Z., Decker, S.: IBROW3: an intelligent brokering service for knowledge-component reuse on the World-Wide Web. In: Proceedings of the 11th Workshop on Knowledge Acquisition, Modeling, and Management (KAW ’98), Banff, Canada, April (1998)
A key sentence from this paper is: “accessing libraries of reusable problemsolving methods on the Web”. Notice how nearly all of the authors of this paper published in 1998 (which is about “knowledge engineering on the Web”) have now all turned into highly active (and well-respected) Semantic Web researchers. First Appearance of the Semantic Web: But soon, the same researchers began to realise that the tables could be turned: rather than using the Web for the benefit of knowledge engineering methods, these knowledge engineering results could be used for the benefit of the Web. Even well before the term Semantic Web became common place, Rudi and his co-workers were already publishing work that can now be easily recognised as Semantic Web work avant la lettre: Decker, S., Erdmann, M., Fensel, D., Studer, R.: Ontobroker in a Nutshell. Lecture Notes in Computer Sciences. Springer (1998)
with as a key sentence: “we develop tools necessary to enable the use of ontologies for enhancing the web”. The term “Semantic Web” appeared first in a 2001 paper: Stojanovic, L., Staab, S., Studer, R.: Knowledge technologies for the semantic web. WebNet, pp. 1174–1183 (2001)
The Missing Link: Problem Solving Methods for the Semantic Web: But although ontologies are now widely used to enhance the Web, the other key insight from Knowledge Engineering (the reusable Problem Solving Methods), have not yet found their place in the collective consciousness of the Semantic Web community. Our KCAP 2009 paper, reprinted here, is meant to be a first step towards rectifying this omission. We argue that just as with ontologies (reusable domain patterns), the problem solving methods (as reusable reasoning patterns) can be of great benefit to both the technical engineering and the scientific understanding of the Semantic Web. But before we make the technical case for this argument, in the next section we will briefly recall the key model from Knowledge Engineering on which our case is built, a model to which Rudi contributed substantially with his early work.
2 Knowledge Engineering Background (For Those Who Don’t Know Their History) The most prominent structural model of reusable components for Knowledge Based Systems was the CommonKADS model, developed by a community of researchers in the late ’80s and early ’90s and lead by the University of Amsterdam. The best documentation of the CommonKADS models is [12], but we describe the core
60
F. van Harmelen et al.
Fig. 1 CommonKADS expertise model
model (the so-called “expertise model”) here, to make this paper self-contained, and to make this model accessible to the current-day Semantic Web community. The structure of the CommonKADS expertise model is depicted in Fig. 1. Problem Types: CommonKADS identifies a small number of problem types that account for many specific problem instances typically tackled by knowledge-based systems. These problem types are generic types of reasoning problems. Examples are diagnosis (reasoning from observations to causes), design (reasoning from functional requirements to a configuration of components), monitoring (interpreting a sequence of signals or events), classification (reasoning from a set of observed properties to an inferred class), etc., amounting to a dozen (at most a few dozen) of such problem types. Each of these problem types can be characterised functionally, without yet committing to any particular form of reasoning that must be deployed, much less to any particular system components or architecture. (In the paper that follows, we will instead use the term “task types” for the same notion.) Task Structures: These are hierarchical decompositions of problem types into procedures that will solve the problems of the relevant type. These procedural decompositions into subtasks come with a control structure over these procedural steps. The atomic procedural steps (the leaves of the decomposition) are called primitive tasks, which correspond 1–1 to primitive inferences. Inference Structures: These primitive inferences are linked together in datadependency graphs that are called inference structures. These graphs show which primitive inference steps pass on output to which other primitive inference steps. Such data passing between inference steps are called knowledge roles. The inference structures also show which parts of the domain knowledge are used by which
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
61
inference steps. The use of domain knowledge by inference steps is through static knowledge roles. Domain Layer: contains the static domain knowledge to be used by the inference steps. Its form should correspond to the schemata that are required by the static knowledge roles of the primitive inference steps in the inference layer. A Problem Solving Method can now be characterised as consisting of an appropriately chosen task-structure plus corresponding decomposition into an inference structure of primitive inferences, plus the domain schemata that are required to fill the static knowledge roles used by these inferences. This layered architecture (distinguishing a procedural task layer, a declarative inference layer and a static domain layer) allows for the reusability of components at each of the levels: the same inference layer can be executed under different control strategies at the task layer; an inference layer can be deployed on different domains (as long as the domain layer offers the minimally required schemata), the same domain layer can be reused for different inference tasks, etc.
3 Introduction Starting with the seminal work by Clancey [4], research in Knowledge Engineering has developed a theory of generic types of tasks, which can be implemented by a generic set of problem solving methods, decomposable into primitive inference steps. Examples of the task types that were identified are diagnosis, design, scheduling, etc. Via the problem solving methods (e.g. a pruning method for the classification task) these tasks could be decomposed into elementary inference steps such as generate-candidate, specify-attribute, obtain-feature, etc. This work has lead to well-founded methodologies for building knowledge-based systems out of reusable components. The CommonKADS methodology [12] is perhaps the best known of such methodologies, although certainly not the only one. Another example is the generic tasks approach by Chandrasekaran [3]. We will use the terminology of the CommonKADS approach, and will identify tasks and inferences in the context of the Semantic Web. This work in Knowledge Engineering originated from a shared frustration concerning the lack of reusable components for building knowledge-based systems. If “Knowledge Engineering” was really “engineering”, where were the reusable components, and why did every implementor have to start from scratch? The important insight was to describe the tasks that Knowledge Based Systems perform at a sufficiently abstract level, the “Knowledge Level”, introduced by Newell in his 1980 AAAI presidential address [9], later in [10]. Once the discussion moved from the implementation details on the “symbol level” to the more abstract “knowledge level”, it became possible to identify generic task-types, reusable problem solving methods and reusable elementary inference steps. Since then, libraries of reusable
62
F. van Harmelen et al.
components have been published both in books (e.g. [2]) and on websites (e.g. http://www.commonkads.uva.nl), and are now in routine use. As is well known from other branches of engineering, reusable components help to substantially increase the quality of design and construction whilst simultaneously lowering the costs by reusing tried-and-tested design patterns and component implementations. Menzies [8] illustrates the reuse benefits for reasoning patterns.
3.1 Applicable to Semantic Web Engineering? The above raises the question of whether or not similar lessons can be applied to Semantic Web engineering. Can we identify reusable patterns and components that could help designers and implementers of Semantic Web applications? It hardly needs arguing that work on the Semantic Web has put great emphasis on the reusability of knowledge, in the form of ontologies. It is fair to say that insights about reusable knowledge elements have been at the birthplace of the Semantic Web enterprise. The idea of reusable ontologies has also been generalised into work on reusable ontology patterns (e.g. [1, 7]). However, all of this work deals with reusable knowledge elements. There is little if any work on reusable reasoning patterns. This paper is a first attempt at finding reusable reasoning patterns for Semantic Web applications.
3.2 Structure of the Paper After discussing related work (Sect. 4) and some formal preliminaries (Sect. 5), the paper is structured in the following steps: 1. Identify typical task types and give semi-formal definitions (Sect. 6.1); 2. Validate the task types by showing that a large number of representative and realistic Semantic Web applications can be classified into a limited number of such task types (Sect. 6.2); 3. Define primitive inference steps by giving semi-formal definitions (Sect. 7.1); 4. Validate the primitive inference steps by showing that the task types can be decomposed into the given inference steps (Sect. 7.2). If the above steps were to succeed, this would be of great value to Semantic Web application builders, leading to the possibility of libraries of reusable design patterns and component implementations. It would also constitute an advance in our understanding of the landscape of Semantic Web applications, which has until now mostly grown bottom up, driven by available technical and commercial opportunities, with little or no theory-formation on different types of applications and their relationships.
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
63
4 Related Work As described above, most if not all work on reusability for the Semantic Web has focused on reusable knowledge, to the exclusion of reusable reasoning patterns. The only exception that we are aware of is the work by Oren [5, 11]. Although similar in approach (they also survey the past years of Semantic Web Challenge entries to detect recurring patterns in these applications), his focus is rather different. In Knowledge Engineering terms, his work focuses more on “symbol level” issues such as architectural components, programming language used and (de)centralisation of the architecture, whereas we are interested in a “knowledge level” analysis that is independent of implementation details. The one element in Oren’s analysis that comes closest to our goals is his “application type”, which has a large overlap with our notion of “task types”. However, Oren then links these application types to required architectural components (storage, user-interface, etc.), but does not link them to primitive reasoning steps, which is the goal that we are pursuing. Hildebrand et al. [6] analyses 33 semantic search applications which have a similar aim to ours (discovering re-usable components) but more limited than ours (considering only search applications), and not attempting any (semi-)formal definitions. From this brief analysis, we conclude that ours is the first attempt at a systematic analysis of Semantic Web reasoning patterns.
5 Formal Preliminaries We will use the terms terminology, ontology, class, concept and instance as follows: a terminology is a set of class-definitions (a.k.a. concepts) organised in a subsumption hierarchy; instances are members of such concepts. Ontologies consist of terminologies and sets of instances. More formally we will consider an ontology O as a set of triples s, p, o, where ∈ and ⊆ are special cases of p. In other words, we consider two specific predicates: ⊆ for the subsumption relation, and ∈ for the membership relation. We use c1 , ⊆, c2 to denote that a class c1 is subsumed by a class c2 . We use i, ∈, c to denote that an individual i is a member of a class c. A terminology T is a set of triples whose predicate is the subsumption ⊆ only, and an instance set I is a set of triples which predicate is the membership relation ∈ only. T resp. I can be extracted from ontology O with the function T (O) resp. I (O).1 An ontology is the union of its terminology, its instance set, and possibly triples s, p, o using other relations p: O ⊇ T ∪ I . We will overload the ∈ notation and also use it to denote that a triple 1 One might want to introduce additional projection functions such as C(O) to extract just the set of all concepts {c1 , c2 , . . .} and similarly for the set of all instances {i1 , i2 , . . .}. Such additional projection functions would make some of the formalisations that follow more elegant (and in some places even more correct).
64
F. van Harmelen et al.
is a member of a set (as in: s, p, o ∈ O). We do not assume that triple-sets are deductively closed. We will use to denote that a triple can be derived from a set (as in: O s, p, o), using some appropriate semantics (e.g. RDF Schema or OWL DL derivations). O ∗ contains all triples s, p, o which can be derived from O. Please note that O ∗ contains O and may be infinite. We will use lower case letters c, i for a single concept or instance, and uppercase letters C, I for concepts sets containing ci , ⊆, cj or instance sets containing i, ∈, ck . We will often use the terms “ontologies” and “knowledge” interchangeably.
6 Task Types In this section we will first (Sect. 6.1) identify a limited number of general task types and give semi-formal definitions for each of them. Notice that these tasks are identified for the Semantic Web application in the same way that the tasks of the CommonKADS framework (like diagnosis, etc.) are meant for knowledge based systems. The selection of the tasks represents the most prominent ones which can be found in current Semantic Web application; the selection is not intended to be complete. For each of these task types, we give the most common definition of that task, although we show in places that variations in these definitions are possible. Subsequently (Sect. 6.2) we will show how a representative set of Semantic Web applications can all be understood as instances of this small set of task types.
6.1 Defining Semantic Web Task Types We will characterise seven different task types. For each of them, we will give an informal description, the signature (types of their input and output parameters), and a semi-formal definition of the functionality (relation between input and output).
6.1.1 Search Perhaps the most prototypical Semantic Web application is search, motivated by the low precision of current search engines. Traditional search engines take as their inputs a query (usually in the form of a set of keywords) plus a data-set of instances (usually a very large set of web-pages), and return a subset of those instances. A Semantic Web search engine would take a query in the form of a concept description, this concept description would be matched against an ontology (i.e. a terminology used to organise an instance set), and members of the instanceset matching the query-concept would be returned. Hence, search is a mapping which maps a given concept c and ontology O to a set of instances I ⊆ I (O):
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
65
Search: c × O → I
input request: a concept c. input knowledge: an ontology O, hence consisting of a terminology T (O) (a set of ci , ⊆, cj ), and an instance set I (O) (set of i, ∈, ck ). answer: search(c, O) returns an instance set such that: search(c, O) = {i, ∈, c|∃cj : cj , ⊆, c ∈ T (O) ∧ i, ∈, cj ∈ I (O)}.
In other words: search(c, O) returns all instances i that are known to be members of subconcepts of c (and hence are members of c as well). Notice that this definition only returns instances of concepts cj that are known to be a subconcept of c (since we demanded cj , ⊆, c ∈ T (O)), and might hence result in an empty answer. An alternative definition would be to allow the use of deductive machinery to derive the subconcepts of c: search(c, O) = {i, ∈, c|∃cj : O cj , ⊆, c ∧ O i, ∈, cj }. Instead of O cj , ⊆, c (resp. O i, ∈, cj ) we can write cj , ⊆, c ∈ T (O ∗ ) (resp. i, ∈, cj ∈ I (O ∗ )). This same move (exchanging O with O ∗ ) could be applied to many of the other task types in this section.
6.1.2 Browse Browsing is very similar to searching (and often mentioned in the same breadth), but has as crucial difference in that its output can either be a set of instances (as in search), or a set of concepts, that can be used for repeating the same action (i.e. further browsing). Thus, browse is a mapping which maps a given concept c and ontology O to a set of instances I plus a set of concepts C: Browse: c × O → I × C input request: a concept c. input knowledge: an ontology O consisting of a terminology T (O) and an instance set I (O). answer: browse(c, O) returns a set of instances and a set of concepts such that: browse(c, O) = search(c, O){cj , ⊆, c|cj , ⊆, c ∈ T (O) ∧ ¬(cj , c, O)} ∪ {c, ⊆, cj |c, ⊆, cj ∈ T (O) ∧ ¬(c, cj , O)} with (cj , c, O) ↔ ∃ck : ck , ⊆, c ∈ T (O) ∧ cj , ⊆, ck ∈ T (O).
Besides instances that a user might be interested in (based on the given input concept c), this returns the immediate neighbourhood of c (immediate sub- and super-concepts of c known in T ), to be used for repeated browsing by the user. As with search, alternative definitions are possible by returning a wider neighbourhood
66
F. van Harmelen et al.
for c, consisting also of indirect sub- and super-concepts, or by deducing a neighbourhood of c instead of being limited to the explicitly known neighbourhood (using instead of ∈). Also, the above definition of search only exploits the subclass hierarchy, and ignores the possibility (often used in practical applications) to browse along other properties. Again, it would be straightforward to give alternative definitions that would cover this. This same move (considering other predicates besides ⊆) could be applied to many of the other task types in this section.
6.1.3 Data Integration The goal of data-integration is to take multiple instance sets, each organised in their own terminology, and to construct a single, merged instance set, organised in a single, merged terminology. Hence, data integration is a mapping which maps a set of ontologies to a (new) ontology. Integrate: {O1 , . . . , On } → O
input request: multiple ontologies Oi with their terminologies Ti = T (Oi ) and their instance sets Ii = I (Oi ). answer: a single ontology O with terminology T and instance set I : integrate({O1 , . . . , On }) = O such that I = Ii and T ⊇ Ti .
It is difficult to give a more specific I/O-condition to characterise data-integration. Typically (but not always), all input instances are part of the output (I = Ii ), and typically (but not always), the output terminology consists of all the input terminologies (T ⊇ Ti ), enriched with relationships between elements of the different Ti , such as ci , ⊆, cj , ci , sameAs, cj .
6.1.4 Personalisation and Recommending Personalisation consists of taking a (typically very large) data set plus a personal profile, and returning a (typically much smaller) data set based on this user profile. The profile which characterises the interests of the user can be in the form of a set of concepts, or a set of instances. For instance, typical recommender services at on-line shops use previously bought items, which are instances, while news-casting sites typically use general categories of interest, which are concepts, personalise:
Idata × Iprofile × O → Iselection
personalise:
Idata × Cprofile × O → Iselection .
or
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
67
Personalise: Idata × Cprofile × O → Iselection input request: an instance set Idata of triples i, ∈, cj and a profile characterised as either a set of instances Iprofile or a set of concepts Cprofile . input knowledge: an ontology O. answer: a reduced instance set Iselection with personalise(Idata , Cprofile , O) = {i, ∈, c |∃c : i ∈ Idata ∧ c ∈ Cprofile ∧ O c , ∼, c ∧ i, ∈, c ∈ I (O)}.
That is, personalisation returns instances that are members of concepts which are in some way related to the target concept(s) through some relevant relation ∼. Interestingly, if we take ∼ to be ⊆, this becomes essentially equivalent to our above definition of search. In practice, personalisation often yields a ranked list of results. The above definition does not cover this, but extensions of the above definition would be possible. This would involve changing the membership test c ∈ Cprofile to be a weighted function, and then exploiting this weight to yield a ranking of answers. This same move (obtaining ranking) could be applied to many of the other task types in this section. 6.1.5 Web-Service Selection Rather than only searching for static material such as text and images, the aim of Semantic Web services is to allow searching for active components, using semantic descriptions of web-services. We can then regard a concept c as the description of some functionality, and an instance i as a particular web-service. Membership i ∈ c is then interpreted as “service i implements specification c”, and ci ⊆ cj as “specification ci is a specialisation of specification cj ” (and consequently, every service i that implements specification ci also implements specification cj ). Just for mnemonic reasons, we will use f for functionality instead of c, and s for service instead of i, and similarly S for a set of services instead of I . At the level of the signature, the characterisation of this task is the same as that of general search: Service selection: f × O → S
input request: required functionality f . input knowledge: an ontology O containing a set of candidate services S(O) and a hierarchy of service specifications T (O). answer: members of the candidate set whose specification satisfies the required functionality: service_selection(f, O) = {s, ∈, f |∃fj : fj , ⊆, f ∈ T (O) ∧ s, ∈, fj ∈ S(O)}.
The difference in search is of course that the query describes functionality (rather than content), and the candidate set consists of services. In general, this will make the relations ∈ and ⊆ much harder to compute than in the case of search (where we deal instead with static data). Of course, the different variations that we gave for the definition of search (e.g. with or without deduction) can be applied here as well.
68
F. van Harmelen et al.
6.1.6 Web-Service Composition A goal even more ambitious than web-service selection is the task of composing a given number of candidate services into a single composite service with a specific functionality. The input of web-service composition is the same as for the selection of a single web-service above, but the output can now be an arbitrary control flow over a set of web-services. We will informally denote such a flow with F LOW without further specification. This results in a similar specification as search: Service composition: f × O → F LOW input request: required functionality f . input knowledge: an ontology O with set of candidate services S(O) and a hierarchy of service specifications T (O). answer: members of the candidate set whose compound specification F LOW satisfies the required functionality: compose(f, O) = F LOW such that T (O) F LOW , ∈, f , and s, ∈, fi ∈ S(O) for each service s occurring in F LOW .
I.e. the hierarchy of specifications in T (O) allows us to infer that the computed F LOW satisfies the required functionality, and F LOW must be composed of services taken from S(O).
6.1.7 Semantic Enrichment With this task type, objects such as images or documents are annotated with metadata. Such added meta-data can be used by task types like search or browse to increase the quality of their answers. It maps a single instance i to a set of triples about that instance: Semantic enrichment: i → I input request: an instance i to be enriched. answer: a set of triples I = {s, p, o|s = i} that all have i as their subject.
Notice that we have allowed triples with other relation-symbols besides ∈ or ⊆, allowing for other, domain specific, properties. The above definition requires that the answer consists only of triples that have the search term as the subject. This might well be too restrictive. Consider enriching a picture taken at a conference dinner; one may not only enrich such a picture with i, shows, Rudi but also with Rudi, affiliation, AIFB. This is just one example of the many variations that are possible for any of the exemplar task types that we have defined in this section.
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
69
6.2 Validating the Task Types The key questions at this point are: how reusable is the above set of task types? Can most Semantic Web applications be described in terms of these task types? Is this small set of seven task-types sufficient, or will we end up inventing new task types for every new application (hence defeating the goal of reusability)?2 In order to measure the completeness and reusability of our list of task types, we have analysed all entries to the Semantic Web Challenge events of the years 2005, 2006 and 2007 to see if they could be properly described with our task types. As is well known, the “Semantic Web Challenge”3 is an annual event that stimulates R&D by showing the state-of-the-art in Semantic Web applications every year. It gives researchers an opportunity to showcase their work and to compare it to others. Since the competition leaves the functionality of the entries very unconstrained and allows the submissions of a large variety of Semantic Web applications, we claim that the collected entries over a number of years together provide a representative sample of state of the art Semantic Web applications, and are hence a suitable data-set for verifying the completeness and reusability of our list of task types. It is noteworthy that in his independent analysis, Oren [5, 11] also turned to the entries in the Semantic Web Challenge as a valid dataset. Figure 4 shows the results of our analysis. It covers all entries to the 2005, 2006 and 2007 competitions with the exception of a small number of applications about which we could not obtain any information, and a single application for which we were not able to understand the functionality. The analysis in Fig. 4 leads us to the following main observations: – All but one of the applications could be classified in terms of our task-types. The single missing application (SMART, from 2007) can best be described as performing “question answering”. This would indeed be a valid (and reusable) expansion of our list of task-types, but we were unable to come up with a reasonably formal definition of this task-type. – Often, a single application belongs to multiple task types. See for instance the prize winning e-culture application “MultimediaN” that performs a combination of searching, browsing, and semantic enrichment. This phenomenon is well known from Knowledge Engineering, where a single system also often performs multiple tasks (e.g. first diagnosis, then planning a treatment). Notice that Search and Browse often occur together in an application. – It is noticeable that the combined 2005–2007 Challenges do not contain a single submission that can be described as web-service selection. This raises some doubts as to the necessity of this task type. At the same time, there were some (although few) entries that could be properly described as web-service composition. In summary, we interpret these findings as support for the reasonable completeness and reusability of the task-types that we defined in Sect. 6.1. 2 Please
note we do not intend to present a complete list of tasks but the most prominent ones.
3 http://challenge.semanticweb.org/.
70
F. van Harmelen et al.
7 Primitive Inferences In this section we will define a number of primitive inference steps, and we will show that each of the task types identified earlier can be decomposed into a limited number of primitive inference steps. The qualification “primitive” is perhaps in need of some explanation. Just as in the CommonKADS methodology, we interpret the term “primitive” to mean that from the application builder’s point of view, it is not interesting to further decompose this step, i.e. application builders would typically regard such a step as atomic. Of course this is not a hard criterion: sometimes it might be useful to further decompose such a step, e.g. for optimisation reasons. Also, what is considered a primitive, elementary, atomic component for an application builder might well be a highly non-elementary, non-atomic and very complex operation to implement. And indeed, many of the primitive inference steps that we define below have been subject to several years of research and development. Thus, “primitive” should not be read as “simple”. It merely refers to the fact that this step will typically be regarded as atomic by application builders.
7.1 Defining Primitive Inference Steps In this section we define a small number of primitive inference steps for Semantic Web applications. We give a semi-formal definition of these primitive inferences, including their signature. Realisation
determines which concepts a given instance is a member:
• Signature: i × O → {ck , . . .} • Definition: Find all ck such that O i ∈ ck Subsumption
determines whether one concept is a subset of another:
• Signature: c1 × c2 × O → bool • Definition: Determine whether O c1 c2 Mapping finds a correspondence relation between two concepts defined in the ontology O. We follow the common approach, where the correspondence relation can be either equivalence, subsumption or disjointness: • Signature: c1 × c2 × O → {=, , , ⊥} • Definition: find an r ∈ {=, , , ⊥} such that c1 r c2 Retrieval is the inverse of realisation: determining which instances belong the given concept: • Signature: c × O → {ik , . . .} • Definition: find all ik such that ik ∈ c
Knowledge Engineering Rediscovered: Towards Reasoning Patterns Task types
Primitive inference steps Realisation Subsumption & classification
Search Browse Data integration Personalisation Service selection Service composition Semantic enrichment
x x x
x x x x x x
71
Mapping
Retrieval x x
x x x
Fig. 2 Task types in terms of primitive inference steps
Classification hierarchy:
determines where a given class should be placed in a subsumption
• Signature: c × O → ({cl , . . .}, {ch , . . .}) • Definition: Find all highest subclasses cl and all lowest super-classes sh such that O cl c c h Each of these inference steps can be defined on the literal content of O, or in terms of the deductive closure O ∗ . This would of course have consequences for how the task types are decomposed in terms of these primitive inferences. Our choice of these five primitive inference steps is not the only choice possible. For instance, both classification and mapping can be reduced to repeated subsumption checks, and are hence not required strictly speaking as separate inferences. Similarly, it is well known that subsumption in turn can be reduced to satisfiability. However, we have chosen the above five as primitive inference steps because they seem to constitute a conceptually coherent (although not formally minimal) set. Our formalisation of the different inference steps is somewhat asymmetric, with for example subsumption defined as a boolean function c1 × c2 × O → bool while realisation is defined as a non-boolean function c × O → i, which could of course also have been defined (more symmetrically) as a boolean function c × O × i → bool. Our choice is simply a matter of convenience, for example Fig. 3 is easier to draw with realisation as a non-boolean function.
7.2 Decomposing the Task Types to Primitive Inferences The table in Fig. 2 shows how each of the task-types from Sect. 6.1 can be decomposed into the primitive inferences described in Sect. 7.1. (In the table, classification and subsumption have been merged into a single column since the former is the iterated version of the latter.) We lack the space to discuss all of these decompositions in detail, and will discuss only two examples:
72
F. van Harmelen et al.
Fig. 3 Inference structures for the task types Search and Personalisation
Search: The description of the search task-type in Sect. 6.1 shows that it is a combination of classification (to locate the query-concept in the ontology in order to find its direct sub- or super-concepts) followed by retrieval (to determine the instances of those concepts, which form the answers to the query). Personalisation: If the personal profile in the personalisation task-type consists of a set of instances (e.g. previously bought items), then personalisation is a composition of realisation (to obtain the concepts that describe these instances), classification (to find closely related concepts), and retrieval (to obtain instances of such related concepts, since these instances might be of interest to the user). In a similar way, all of the prototypical task-types we described in Sect. 6.1 can be implemented in terms of the small set of primitive inference steps described in this section, resulting in the decomposition shown in Fig. 2. Notice that the table in Fig. 2 only displays the minimally required reasoning tasks for each task-type. For example, it is possible to equip the search task with a mapping component in order to map the vocabulary of a user-query to the vocabulary of the ontology used during search. Similar additions could have been made for many other task-types. Notice too, that semantic enrichment can not be defined based on these reasoning tasks. Usually in reasoning the input facts are assumed to be given, while semantic enrichment deals with constructing these input facts. Hence, semantic enrichment cannot be seen in terms of inference steps, but it is the only task type in our list that suffers from not being decomposable into a combination of primitive inference steps. The CommonKADS method [12] uses the notion of an inference structure to graphically depict the decomposition of a task into primitive inference steps, by showing the data-dependencies between the primitive inference steps that together make up a task. In Fig. 3, we show the inference structures for the Search and Personalisation task-types using the decomposition into primitive inference steps given above. This is what we consider the reasoning patterns. Also, Fig. 3 shows the structural similarity between Search and Personalisation: it makes clear that Personalisation is essentially Search, but preceded by a realisation-step to map instances to the concepts to which they belong.
Knowledge Engineering Rediscovered: Towards Reasoning Patterns Application
CONFOTO (’05) DynamicView (’05) FungalWeb (’05) Oyster (’05) Personal Reader (’05) Service Execution (’05) COHSE (’06) Collimator (’06) Dartgrid (’06) Dbin (’06) EKOSS (’06) eMerges (’06) Falcon-S (’06) Foafing the Music (’06) Geo Services (’06) MultimediaN (’06) Paperpuppy (’06) Semantic Wiki (’06) ArnetMiner (’07) Cantabria (’07) CHIP (’07) DORIS (’07) EachWiki (’07) GroupMe (’07) iFanzy (’07) Int.ere.st (’07) JeromeDL(’07) MediaWatch (’07) mle (’07) Notitio.us (’07) Potluck (’07) Revyu (’07) RKB Explorer (’07) SemClip (’07) SMART (’07) swse (’07) wwwatch (’07)
Task types Search Browse Data integr.
Personalisation
Service select.
73
Service compos.
x x x x
Semantic enrichment x x
x x
x
x x
x
x
x
x x x x
x
x x x
x x x
x
x x
x x
x x x
x x x x x
x
x
x
x x x
x x x x
x x
x x x x
x x x x x x x x x
x x
Fig. 4 Classification of Semantic Web Challenge in our task-types
8 Concluding Remarks The main contribution of this paper has been to make a first attempt at providing a typology of Semantic Web applications. We have defined a small number of prototypical task-types, and somewhat surprisingly, almost all entries from three years of Semantic Web Challenge competitions can be classified into these task-types. We
74
F. van Harmelen et al.
have also shown how each of these prototypical task-types can be decomposed into a small number of primitive inference steps. This results in the following reusable components: the identified tasks, the inferences and the decomposition of task into inferences (the so-called reasoning patterns). Analogously to established practice in Knowledge Engineering, these results provide a first step towards a methodology for building Semantic Web applications out of reusable components. Indeed, we regard this work as taking the first steps towards this goal. We would expect the typology of task-types to grow beyond the current set of seven to cover a larger corpus of Semantic Web applications. Also, the details of our semi-formal definitions and our decompositions may well have to be adjusted over time. And indeed, in a publication [13] that has appeared since the original version of this paper was published, Wang and colleagues have both used and extended our concepts and formalisations. They have provided extended versions of our task types Personalisation and Recommending, and they have extended the set of primitive inferences in order to define these extended versions in terms of primitive inferences. Altogether, this has yielded an insightful high-level definition of a fully implemented semantic recommender system. This work is in full agreement with the general aim of our proposal, namely that a more structured, abstract and implementation independent analysis of the Semantic Web applications “at the knowledge level” will be necessary if we are to rise above and beyond the current ad hoc practices.
References 1. Blomqvist, E., Sandkuhl, K.: Patterns in ontology engineering: classification of ontology patterns. In: Chen, C.S. (ed.) ICEIS (3), pp. 413–416 (2005) 2. Breuker, J., van de Velde, W.: Common Kads Library for Expertise Modelling. IOS Press, Amsterdam (1994). ISBN 9051991649 3. Bylander, T., Chandrasekaran, B.: Generic tasks for knowledge-based reasoning: the “right” level of abstraction for knowledge acquisition. Int. J. Man-Mach. Stud. 26(2), 231–243 (1987) 4. Clancey, W.J.: Heuristic classification. Artif. Intell. 27(3), 289–350 (1985). doi:10.1016/ 0004-3702(85)90016-5 5. Heitmann, B., Oren, E.: A survey of semantic web applications. Technical report, DERI, Galway (2007) 6. Hildebrand, M., van Ossenbruggen, J.R., Hardman, L.: An analysis of search-based user interaction on the semantic web. Technical report INS-E0706, CWI, Amsterdam (2007) 7. Lefort, L., Taylor, K., Ratcliffe, D.: Towards scalable ontology engineering patterns. In: AOW ’06: 2nd Australasian Workshop on Advances in Ontologies, pp. 31–40 (2006) 8. Menzies, T.: Object-oriented patterns: lessons from expert systems. Softw. Pract. Exp. 27(12), 1457–1478 (1997). doi:10.1002/(SICI)1097-024X(199712)27:123.3.CO;2-0 9. Newell, A.: The knowledge level (presidential address). AI Mag. 2(2), 1–20, 33 (1980) 10. Newell, A.: Reflections on the knowledge level. Artif. Intell. 59(1–2), 31–38 (1993) 11. Oren, E.: Algorithms and components for application development on the semantic web. PhD thesis, Nat. Univ. of Ireland, Galway (2007)
Knowledge Engineering Rediscovered: Towards Reasoning Patterns
75
12. Schreiber, G., Akkermans, H., Anjewierden, A., de Hoog, R., Shadbolt, N., van de Velde, W., Wielinga, B.: Knowledge Engineering and Management: The Commonkads Methodology. MIT Press, Cambridge (2000). ISBN 0262193000 13. Wang, Y., Wang, S., Stash, N., Aroyo, L., Schreiber, G.: Enhancing content-based recommendation with the task model of classification. In: Proceedings of EKAW. LNCS. Springer, Berlin (2010)
Semantic Technology and Knowledge Management John Davies, Paul Warren, and York Sure
Abstract Prof. Rudi Studer has been technical director of a number of significant EU collaborative projects researching the application of semantic technology to Knowledge Management. In this chapter, drawing largely on work done in these projects, we provide an overview of the knowledge management problems and opportunities faced by large organisations; and indeed also shared by some smaller organisations. We show how semantic technologies can make a significant contribution. We look at the key application areas: searching and browsing for information; sharing knowledge; supporting processes, in particular informal processes; and extracting knowledge from unstructured information. In each application area we describe some solutions, either currently available or being researched. We do this to provide examples of what is possible rather than to provide a comprehensive list. The use of ontologies as a form of knowledge representation underlies everything we talk about in the chapter. Ontologies offer expressive power; they provide flexibility, with the ability to evolve dynamically unlike typical database schemata; and they make machine reasoning possible.
1 Scientific and Technical Overview 1.1 Introduction Prof. Rudi Studer has been technical director of a number of significant EU collaborations researching the application of semantic technology to Knowledge Management (KM), including the integrated projects SEKT—Semantic Knowledge Technologies, http://www.sekt-project.com, and ACTIVE—Knowledge Powered Enterprise, http://www.active-project.eu. He also participated in the seminal OnToKnowledge (OTK) project [8], which paved the way for numerous further activities on Semantic Web and Knowledge Management. This chapter is essentially a survey of J. Davies () Future Business Applications and Services, BT Innovate and Design, British Telecommunications Plc., Ipswich, UK e-mail:
[email protected] D. Fensel (ed.), Foundations for the Web of Information and Services, DOI 10.1007/978-3-642-19797-0_5, © Springer-Verlag Berlin Heidelberg 2011
77
78
J. Davies et al.
the key contributions of these projects, set in the wider context of semantic-based KM in general. It can also be seen as a survey of how semantic technologies can make a difference to managing knowledge in large organisations. The fact that the management of knowledge in organisations is a problem, as well as an opportunity, is of no doubt. The management scientist Peter Drucker has commented that “the most important contribution management needs to make in the 21st century is to . . . increase the productivity of knowledge work” [10]. He identified increased productivity of manual work as a major distinguishing feature of successful organisations in the 20th century and saw increased productivity of knowledge work as a similarly distinguishing feature of successful organisations in the 21st century. As a management scientist, Drucker’s concern was with management’s contribution to increasing knowledge worker productivity. Our related concern here is with technology’s contribution.
1.2 The Challenges for Organisational Knowledge Management For those concerned with the management of information and knowledge in an organisation, there are a number of challenges: 1. Enabling the user to find, or be proactively presented with, the right information to perform a particular task. The information might be taken from a wide range of sources, including databases, an intranet or the Internet; or it might be an amalgam of information from various sources. Related to this is the need to organise information in a way in which it can be efficiently retrieved. 2. Sharing knowledge across the organisation. Here also, the knowledge may be in a database, intranet or internet (explicit knowledge), or simply in an individual’s head (tacit knowledge). The person who needs the knowledge, and the owner or creator of the knowledge, although colleagues, may even be located on different continents. 3. Helping users to navigate the processes, often collaborative processes, of which their work is composed. Central to this is sharing metadata between applications, to support a particular goal. Also important is having an understanding of the user’s current context, and what he or she is trying to achieve. 4. The integration of structured information held in corporate databases with unstructured information, e.g. held on the corporate intranet. By merging information from all corporate sources we can provide a complete picture of what the organisation knows about a particular topic. The importance of these challenges has been highlighted by an Economist Intelligence Unit [13] report which surveyed 565 executives from various industries. The survey found that 74% of respondents said that “data gathering is a significant or very significant challenge” and 68% said the same about data-searching. In fact, 42% of the respondents could not find relevant information when needed. 58% rated the challenge of knowledge sharing and collaboration as 4 or 5 (on a scale of 1 to 5,
Semantic Technology and Knowledge Management
79
where 5 is extremely challenging). 52% similarly rated the challenge of data integration as 4 or 5. Further, bearing out the need for information integration, 54% said that “necessary information resides in silos”. Interestingly, users were more satisfied with the quality and quantity of information available than with the ease of access and ease of use of that information. In Sects. 1.3 to 1.6 we discuss these challenges in greater detail, and why systems which analyse information on the semantic level are important in solving these challenges. In Sect. 1.7 we take another look at ontologies, the knowledge representation framework which underlies our semantic approach. Then in Sect. 2 we describe some applications of semantic technologies to these challenges. In Sect. 3 we make some concluding remarks.
1.3 Finding Information—And Organising Information so that It Can be Found 1.3.1 Defects of the Conventional Search Engine The search engine has been one of the great success stories of the World Wide Web as it allowed ordinary users to search the enormous amounts of available websites based on simple principles, i.e. keyword based search. However, its use within organisations has been less successful and created a degree of frustration. An important reason for this is well known. The page rank algorithm, pioneered by Google, depends on the rich pattern of hyperlinks that connect documents to each other which exist on the Web but which are rarely to be found on the organisational intranet. However, even at its most successful, the conventional search engine suffers from an approach based on text-string matching and consequent failure to interpret the semantics of a query or the semantics inherent in the documents being queried. In particular: the failure to identify polysemy (when a word or phrase has more than one meaning); a similar failure to take account of synonymy (when two or more words or phrases have the same meaning) and other forms of semantic connection between terms; an inability to make use of context; and less than optimal interpretation of results. Consider for example, the following query: “telecom company” Europe “John Smith” director The user might require, for example, documents concerning a telecom company in Europe, a person called John Smith, and a board appointment. Note, however, that a document containing the following sentence would not be returned using conventional search techniques: “At its meeting on the 10th of May, the board of London-based O2 appointed John Smith as CFO”
80
J. Davies et al.
In order to be able to return this document, the search engine would need to be aware of the following semantic relations: O2 is a mobile operator, which is a kind of telecom company; London is located in the UK, which is a part of Europe; A CFO is a kind of director. Lack of Context Many search engines fail to take into consideration aspects of the user’s context to help disambiguate their queries. User context would include information such as a person’s role, department, experience, interests, project work, and so on. Presentation of Results The results returned from a conventional search engine are usually presented to the user as a simple ranked list. The sheer number of results returned from a basic keyword search means that results navigation can be difficult and time consuming. Generally, the user has to make a decision on whether to view the target page based upon information contained in a brief result fragment. A survey of user behaviour on BT’s intranet suggests that most users will not view beyond the 10th result in a list of retrieved documents; only 17% of searches resulted in a user viewing more than the first page of results. Essentially, we would like to move from a document-centric view to a more knowledge-centric one [34], for example, by presenting the user with a digest of information gleaned from the most relevant results found as has been done in the Squirrel semantic search engine described later in this chapter.
1.3.2 Semantic Indexing and Retrieval The previous section discussed the limitations of conventional textual search technology and indicated that these limitations were caused by a failure to interpret the semantics both in the query and in the textual corpus being interrogated. Techniques have been developed for the automatic creation of semantic annotations. As explained in [9], semantic indexing and retrieval can then be performed on top of the semantic annotations. Indexing can be done with respect to two semantic features: lexical concepts and named entities. In this way a number of the problems discussed above can be overcome. Lexical concepts are introduced to overcome polysemy. Thus a word with two different meanings will be associated with two different lexical concepts. Wordsense disambiguation techniques can be used to disassociate these meanings [32]. Similarly, knowing that two words or phrases are associated with the same lexical concept enables the system to cope with synonymy. Moreover, the use of lexical concepts also enables hyponym-matching (a hyponym is a word or phrase whose meaning is included within that of another word or phrase). Thus, referring to the example in Sect. 1.3.1, CFO is a hyponym of director. Hyponym-matching overcomes the problem that a search for director will not identify references to CFO which may be relevant.
Semantic Technology and Knowledge Management
81
Fig. 1 Relating the named entities in a sentence to an ontology
Named entities are items such as proper nouns (denoting, for example persons, organisations and locations), numbers and dates. One study found that named entities were a common query type, in particular people’s names, whilst ‘general informational queries are less prevalent’ [12]. Such named entities can be identified as instances of a pre-defined ontology. A typical ontology for such purposes would need to have information about people, geography, company structure etc. One such ontology is PROTON [19] which was developed by Ontotext Lab (http://www.ontotext.com) and used within the SEKT project as the basis for several semantic search and browse tools. In fact, PROTON also includes a world knowledgebase, i.e. a set of instances and relations which are used to pre-populate the ontology. This can then be extended through analysis of the textual corpus. Of course this approach, while highly accurate, can lead to error. Therefore, information in the knowledgebase is flagged to indicate whether it is pre-defined or whether it is learned from the document database. The PROTON ontology is itself extensible, any particular domain ontology can develop its domain ontology as an extension to PROTON. Figure 1 illustrates how sentences can be analysed and the named entities related to the classes of an ontology. Packard Bell and BT have been identified as instances of companies, whilst London and UK have been identified as instances of city and country respectively. Once identified, these instances then form part of a knowledge base. Note that ‘its’ has been identified as being equivalent to BT in this particular sentence. The identification of words such as pronouns with the words or phrases which they stand for is known as anaphora resolution. Software to achieve this textual analysis is described in Sect. 2.4.
82
J. Davies et al.
1.4 Sharing Knowledge Across the Organisation A knowledge worker often has no idea that a document of use to him has been created by another colleague. He or she may even be unaware of the existence of the colleague, and they may be located geographically far apart. The document might have been created some time ago, by a colleague who has moved on to other work or left the organisation. Consultancies, such as Ernst & Young [7, 14] frequently take this subject most seriously. Typically they have a combination of part-time knowledge management enthusiasts in their operating units and full-time knowledge management specialists in a central unit. They use a platform, such as Lotus Notes, for document storage; a typical such document might be a customer proposal, which could be partially reused for other customers. In some cases users may simply enter a document directly into the repository. In others, the document is vetted for quality by one of the knowledge management team. In both cases the user will be required to describe the document using metadata compliant with a predefined taxonomy. Depending on the experience of the user and the particular document, this can take a significant amount of time and inhibit information being entered into the repository. A similar problem applies in reverse. To retrieve information a user needs to understand the taxonomy, and of course the original metadata needs to be accurate. Information may be missed, or the complexity of the system may again deter its use. What is needed is to analyse the documents as they are entered into the system, so as to automatically create semantic metadata which can be used for document retrieval. Automatic metadata creation also provides a consistency which may not occur when metadata is manually created.
1.5 Helping with Processes Current productivity tools offer basic support for processes, but little proactive help. Within Microsoft Outlook, for example, calendar and contact facilities provide tools for the user. However, all the intelligence needs to be supplied by the user. When the user types ‘phone John Smith’ at a given time in his diary, there is no automatic link to the contact book entry for John Smith. In addition, what information the system does have is routinely lost. Imagine the user receives an email with attachments from John Smith as part of the customer X bid proposal process. He saves the attachments in a folder. Then the link between the attachments and John Smith, or customer X, are lost. If our user wants to find all information sent by John Smith or about customer X, then there is nothing associated with the saved files to help him. When he or she is working on the customer X proposal process, there are no metadata associated with those files to indicate their relevance to customer X. Moreover, current systems have no idea of the context in which the user is working or the process currently being followed. For example, if the user is a patent
Semantic Technology and Knowledge Management
83
lawyer with six different patent filings under consideration, the system has no idea which one is currently the focus of his attention. Nor does it know whether the user is creating a patent, reviewing a colleague’s proposed filing, or searching for prior art. Yet such information would enable the system to proactively help the user. What is missing is metadata, shared between applications and linked to the context of the user’s work and the processes he or she performs.
1.6 Integrating Structured and Unstructured Information 1.6.1 The Need to Analyse Text Conventional corporate information systems are built on relational database technology and typically contain only structured information. This is true whether the systems are for customer relationship management, product information, employee information, competitor information etc. In knowledge management, we would also like to capture and exploit the unstructured information which exists as text on the intranet, in memos on personal computers, in emails, slide presentations etc.; and also the semi-structured information which exists in applications such as spreadsheets where schemas (i.e. row and column headings) exist but are not properly defined. The claim has been made that over 80% of the data in an organisation is unstructured [25]. Certainly, it is commonly known that a great deal of valuable information in an organisation exists in this form. What is needed is to extract this information and transform it into structured form to enable merging with the structured data. The problem is that structured data has defined semantics in the form of schemas. These semantics are local to the particular application, rather than being expressed using shareable ontologies, but they are semantics nevertheless. The application knows, for example, that the price field in a relational database contains the price in an agreed currency. In unstructured data it could be argued that the semantics are still there. A human can detect when a brochure describes a product price. However, the semantics are no longer defined in a machine interpretable way. The price can be anywhere in the document and can be introduced by many different kinds of language. Interpreting these semantics is a task which until recently has been regarded as requiring human intelligence. If we could extract structured information from unstructured data, then there are many applications which would benefit. A complete picture could be built up, based on all the information available to the enterprise, of, for example, any particular customer, supplier, or competitor. Instead of searching separately through emails, memos, corporate intranet and databases, a sales advisor would have a complete picture of a customer, based on all those sources. Added to the opportunity cost of not being able to use all the information potentially available to the organisation, is risk associated with the regulatory environment. Organisations which do not disclose all relevant information to regulatory
84
J. Davies et al.
Fig. 2 Combining structured and unstructured information
authorities may be seriously penalised. Yet the organisation can only disclose information it knows it has. Information lost on corporate computers cannot be disclosed at the appropriate time—but will certainly be revealed if the organisation is subject to a detailed forensic analysis of hard drives prior to a legal hearing. As an example, Forrester [27] describe a $1.4 Billion judgement against Morgan Stanley, arising from the latter’s inability to produce requested information. All this points to a growing business need to understand the semantics of textual information, to extract such information from free text, convert into a structured form and merge with pre-existing structured information. The overall goal is to combine structured and unstructured information and make the combined result available to a range of applications. This is illustrated in Fig. 2 where information from a variety of unstructured sources is combined with information from databases to create information described in terms of an ontology. This can then be combined with domain-specific knowledge and business rules, and then operated on by semantic queries to input to client applications. The essential challenge is to extract structured information out of unstructured information. One way to do this is to create semantic metadata. HTML, the language which underlies the WWW and our corporate intranets, is based on the use of metadata. However, the metadata in HTML are used to describe the format of data, e.g. to indicate a heading or a bulleted list. The need here is to create semantic metadata, i.e. metadata which tell us something about the data.
Semantic Technology and Knowledge Management
85
Such metadata can exist at two levels. They can provide information about a document or a page, e.g. its author, creation or last amendment date, or topic; or they can provide information about entities in the document, e.g. the fact that a string represents a company, or a person or a product code. The metadata themselves should describe the document or entities within the document in terms of an ontology. At the document level we might have a property in the ontology, e.g. hasAuthor to describe authorship. Within the document we would use classes such as Person, Company or Country to identify specific entities.
1.6.2 Combining the Statistical and Linguistic Approaches The metadata could be created by the authors of the document. In general this will not happen. The authors of Word documents or emails will not pause to create metadata. We need to generate metadata automatically, or at least semi-automatically. There are two broad categories of technology which we can use for this: statistical or machine learning techniques; and information extraction techniques based on natural language processing. The former generally operate at the level of documents, by treating each document as a ‘bag of words’. They are, therefore, generally used to create metadata to describe documents. The latter are used to analyse the syntax of a text to create metadata for entities within the text, e.g. to identify entities as Persons, Companies, Countries etc. Nevertheless, this division should not be seen too starkly. For example, one of the goals of the SEKT project (http://www.sekt-project.com), a European collaborative research project in this area which ran from 2004 to 2006, was to identify the synergies which arise when these two different technologies are used closely together. The metadata can create a link between the textual information in the documents and concepts in the ontology. Metadata can also be used to create a link between the information in the document and instances of the concepts. These instances are stored in a knowledgebase. Thus the ontology bears the same relationship to the knowledgebase as a relational database schema bears to the information in the database. In some cases the ontology and the knowledgebase will be stored together, in other cases separately. This is essentially an implementation decision. Ontologies are particularly useful for representing knowledge from unstructured text because of their flexibility and ability to evolve. Once created, ontologies can be much more easily extended than is the case for relational database schema. A simple illustration of this is shown in Fig. 3. This is not to say that the ontology-based approach will replace the use of relational databases. With increased flexibility comes increased computational expense. The ideal is to combine the two approaches. Where the system identifies a text string as an instance of a concept in the ontology but which is not represented in the knowledgebase, then that instance can be added to the knowledgebase. For example, the text string ‘ABC Holdings’ may be identified as a company, but one not represented in the knowledgebase. The system can then add ‘ABC Holdings’ to the knowledgebase. Section 1.3 has already
86
J. Davies et al.
Fig. 3 Ontologies offer greater flexibility than database schema
discussed how entities in text can be associated with entities in the knowledgebase; this was illustrated in Fig. 1. Research is also in progress to use natural language processing techniques to learn concepts from text, and thereby extend the ontology. However, this is a significantly harder problem.
1.7 Another Look at Ontologies The constant theme running through this chapter is the use of ontologies. An early, but still relevant, overview and categorisation of the ways ontologies can be used for knowledge sharing is given in [1]. Here the use of ontologies is categorised in a number of ways. Ontologies can be used in conjunction with conventional (i.e. non-intelligent) software or alternatively in conjunction with software employing AI techniques. The reference lists a number of principles which remain true: knowledge engineering needs to be minimised, as it represents an overhead; KM support needs to be integrated into everyday work procedures; and KM applications need to process information in an integrated manner. It describes a range of applications which remain important: knowledge portals for communities of practice; lessons learned archives; expert finders and skill management systems; knowledge visualisation; search, retrieval and personalisation; and information gathering and integration. Another high-level view of ontologies, and specifically their use in achieving data connectivity, is given by Uschold and Gruninger [39]. They note that connec-
Semantic Technology and Knowledge Management
87
Relational database
Ontological knowledgebase
Information model
Schema Hard to evolve Implemented with instances in database Computationally separate from instances
Ontology Flexible Can be implemented separately from instances Computationally concepts and instances treated similarly
Information which can be retrieved
What you put in is what you get out
Information entered into knowledgebase plus inferences from that information
Fig. 4 Comparison of relational databases and ontological knowledge bases
tivity is required at three layers: physical, syntactic and semantic. Great strides have been made in achieving connectivity at the first two layers. The challenge is now the third, and ontologies have a key role here. Semantic heterogeneity is a fact of life to be overcome—“there will always be sufficiently large groups for which global agreements are infeasible”. They present a spectrum of kinds of ontologies, defined by degree of formality. At the informal end there are sets of terms, with little specification of the meaning, and also ad hoc hierarchies, such as in Yahoo. At the formal end there are, e.g. description logics. At the informal end some of these might not properly be called ontologies, e.g. by members of the knowledge representation community. The point is that they are used in similar ways as some formal ontologies. Uschold and Gruninger compare ontologies with database schema; making the point that the mixing of types (concepts) with instances is a feature of ontologies which does not occur in database schema. In their view this is largely because of the much greater scale and performance requirements for database systems. Note that this is a computational feature, i.e. computationally database schema and database instances are treated quite separately. This is less the case in the ontological approach; indeed it can in some cases be a matter of design style whether an entity is represented as a concept or an instance. However, when we turn to implementation, the converse can be true. A database schema is embedded in the database; an ontology can exist in a separate physical implementation. The authors of this chapter have prepared their own summary of the chief differences between the relational database and ontological knowledgebase approach. This is summarised in Fig. 4. Uschold and Gruninger identify four ways in which ontologies help achieve a common understanding. Three are relevant to the theme of our chapter: • Neutral authoring. Here an ontology exists for authoring purposes, and the results are then translated into a variety of target ontologies. Enterprise modelling is an example of this. • Common access to information. Instead of employing translators between each data source, a neutral interchange format is employed, thereby reducing the required number of translators from O(N 2 ) to O(N ).
88
J. Davies et al.
• Query-based search, i.e. a sophisticated indexing mechanism with the added benefit of permitting answers to be retrieved from multiple repositories. Note that both of the first of these use neutral ontologies. However, in the case of neutral authoring the ontology can contain only those features present in all of the target systems. In the case of providing common access to information, the neutral ontology must cover all of the concepts in each of the target systems. Uschold and Gruninger also identify the use of ontologies for specification in software engineering, which is beyond the scope of our interests in this chapter.
2 Example Applications Building on the discussions in Sect. 1, this section describes example applications of semantic technologies, in particular addressing each of the challenges described Sect. 1.2: searching and finding information; sharing information within organisations; helping users to navigate processes, including by taking account of the user’s context; and extraction of structured information from unstructured data. The majority of these applications were developed in projects such as On-To-Knowledge, SEKT, NEON (http://www.neon-project.org/) and ACTIVE (http://www.active-project.eu/) where Rudi Studer led the involvement of the University of Karlsruhe (now part of Karlsruhe Institute of Technology).
2.1 Semantic Search, Browse and Information Storage In this section, we discuss some approaches to dealing with the first challenge identified in Sect. 1.2, that of users being able to find, or be automatically presented with, the relevant information to their current task. We discuss the Squirrel semantic search tool, the SEKTAgent, semantic information agent and TagFS, a semantic filing system.
2.1.1 Squirrel—An Example of Semantic Search and Browse Squirrel [11] provides combined keyword based and semantic searching. The intention is to provide a balance between the speed and ease of use of simple free text search and the power of semantic search. In addition, the ontological approach provides the user with a rich browsing experience. For its full-text indexing, Squirrel uses Lucene. PROTON is used as the ontology and knowledgebase, whilst KIM [4] is used for massive semantic annotation. The KAON2 [26] ontology management and inference engine provides an API for the management of OWL-DL and an inference engine for answering conjunctive queries expressed using the SPARQL syntax and provides the semantic backbone for the application. KAON2 also supports the Description Logic-safe subset of
Semantic Technology and Knowledge Management
89
Fig. 5 Meta-results page
the Semantic Web Rule Language (SWRL). This allows knowledge to be presented against concepts that goes beyond that provided by the structure of the ontology. For example, one of the attributes displayed in the document presentation is ‘Organisation’. This is not an attribute of a document in the PROTON ontology; however, affiliation is an attribute of the Author concept and has the range ‘Organisation’. As a result, a rule was introduced into the ontology to infer that the organisation responsible for a document is the affiliation of its lead author. Users are permitted to enter terms into a text box to commence their search. This initially simple approach was chosen since users are likely to be comfortable with it due to experience with traditional search engines. Squirrel then calls the Lucene index and KAON2 to identify relevant textual resources or ontological entities, respectively. Figure 5 shows an extract from the meta-result page returned. This is intended to allow users to quickly focus their search as required and to disambiguate their query if appropriate. The page presents the different types of result that have been found and how many of each type for the query ‘home health care’. Figure 6 shows a document view. The user has selected a document from the result set, and is shown a view of the document itself. This shows the meta-data and text associated with the document and also a link to the source page if appropriate— as is the case with web-pages. Semantically annotated text (e.g. recognised entities) is highlighted. ‘Mousing-over’ recognised entities provides the user with further information about the entity extracted from the ontology. Clicking on the entity itself takes the user to the entity view. Figure 7 shows an entity view for ‘Sun Microsystems’. It includes a summary generated by OntoSum [3, 4]. OntoSum is a Natural Language Generation (NLG) tool which takes structured data in a knowledge base (ontology and associated instances) as input and produces natural language text, tailored to the presentational context and the target reader. NLG can be used to provide automated documentation of ontologies and knowledge bases and to present structured information in a user-friendly way. Users can choose to view results as a consolidated summary (digest) of the most relevant parts of documents rather than a discrete list of results. The view allows users to read or scan the material without having to navigate to multiple results. Figure 8 shows a screenshot of a summary for a query for ‘Hurricane Katrina’. For
90
J. Davies et al.
Fig. 6 Document view
Fig. 7 Entity view
each subdocument in the summary the user is able to view the title and source of the parent document, the topics into which the subdocument text has been classified or navigate to the full text of the document. To gain an idea of how users perceive the advantages of semantic search over simply text-based search, Squirrel has been subjected to a three-stage user-centred evaluation process with users of a large Digital Library. 20 subjects were used, and the perceived information quality (PIQ) of search results obtained. Using a 7 point scale the average (PIQ) using the existing library system was 3.99 compared with an average of 4.47 using Squirrel—a 12% increase. The evaluation also showed
Semantic Technology and Knowledge Management
91
Fig. 8 Consolidated results
Fig. 9 A semantic query in SEKTagent
that users rate the application positively and believe that it has attractive properties. Further details can be found in [38].
2.1.2 SEKTagent—A Different View on Semantic Search Another approach to enabling semantic queries is exemplified by SEKTagent [4]. Figure 9 illustrates the basic approach by showing the following semantic query: ‘ANY (Person) hasPosition analyst withinOrganization ANY (Organization) locatedIn US’ The query is looking for someone who is an analyst working in any U.S. organisation. This is quite different from a text query. Everything is stated at a conceptual
92
J. Davies et al.
Fig. 10 Extract from one of the results of a semantic query—showing entities in the knowledgebase highlighted
level. The most concrete entity in the query is ‘US’. However, even this is not treated as a text string. The query may find a document referring to an analyst working in some city or state of the U.S., but not containing any reference itself to the U.S. The system makes use of the geographical knowledge in the knowledgebase to determine that this is a relevant document. Figure 10 shows an extract from one of the retrieved documents. Entities in the knowledgebase are highlighted. In this case, we have three such entities: Gartner; analyst; Kimberley Harris-Ferrante. The first of these is a company, the second a position in an organisation; and the third is a person. In fact, Kimberley HarrisFerrante is the analyst, working in a U.S. organisation, who satisfies this query. Moving the mouse over any of these entities displays more information about them. In the case of Gartner, for example, it provides the key facts about the company. Rather than just displaying raw information, natural language generation technology is applied to the relevant information in the knowledgebase to create text which can be easily read. The example illustrates another important feature which differentiates the ontology-based approach from that of relational databases. In a database, the only information which can be retrieved is that which is explicitly input into the database. An ontology-based system can make use of a reasoner to perform inferencing over the ontology and knowledgebase. In our example, the request was for someone performing a specific role in an organisation in the U.S. The information in the knowledgebase could well be that the organisation is located in some part of the U.S., e.g. a city or state. However, the knowledgebase associated with PROTON also has geographical information including states and major cities in the U.S. Armed with this information, it is able to make the necessary inferences.
2.1.3 Semantic Filing—TagFS and SemFS Section 1.3 discussed the difficulty which many people have in finding information which they themselves have stored, often on their own computers. One reason for this is that there is often more than one location where a file can logically be stored; yet users are in general restricted to storing information in a single location. A partial solution to this is the use of tags. However, this loses the advantage of being able to travel through the tree structure of a hierarchical set of folders. TagFS [2] merges the two approaches to obtain the advantages of both by using the tags to create a folder structure which is dynamic rather than fixed. In TagFS, the organisation of the resource is divorced from its location. The file is simply tagged.
Semantic Technology and Knowledge Management
93
To take the example from the reference, in a conventional filing system, a user saving music files would first establish a directory structure, e.g. year/artist/album. This would be quite distinct from a structure artist/album/year. In TagFS these three attributes, and any other which are appropriate are merely used to motivate tags. To find a file, it does not matter in which order you traverse the ‘directory’; the “directory path correspondingly denotes a conjunctive tag query which results in a set of files that fulfil all tag predicates”. TagFS is implemented using the SemFS architecture. SemFS provides mapping from traditional file system interfaces to annotation of information objects using RDF. Rather than interpreting directory structures as static storage hierarchies, as in a conventional file system, they represent dynamic views on information objects. In fact TagFS makes relatively simple use of SemFS, in that the latter offers an arbitrary number of different views, whilst TagFS simply employes one called ‘hasTag’. The use of RDF enables integration with other semantic desktop applications, as described in Sect. 2.3.
2.2 Semantic Information Sharing Section 1.2 identified the second challenge for organisational knowledge management as the importance, particularly acute in large organisations of being able to share information amongst colleagues. Here we look at some approaches to doing this.
2.2.1 Using Ontologies An obvious basis for describing, and hence sharing, information is to use an ontology. A simpler approach—but one which is less expressive—is to instead use a taxonomy. From the user’s viewpoint the ontological approach is more time-consuming than the taxonomic one. In general, to describe information in terms of an ontology is richer but more complex than describing information in terms of a taxonomy. The kind of semantic annotation techniques described in Sect. 1.6.2 can be used to automate, or at least partially automate, this process. The user wishing to retrieve information is then able to use the semantic search and browse techniques described in Sect. 2.1. Warren et al. [42] describe an implementation of this approach in a digital library. Here annotation is at two levels. Firstly, sets of topics are used to describe documents. Topics can have sub and super-topics, to create a lattice structure. As a design decision, for reasons of computational tractability, topics are implemented as instances, not concepts. As a starting point, schemas used by proprietary information providers (e.g. Inspec: http://www.theiet.org/publishing/inspec/) provided the topics. Machine learning was used to refine these topics and to automatically associate documents with topics. Secondly, using natural language techniques, named entities
94
J. Davies et al.
within documents are identified and associated with concepts. These concepts are drawn from, e.g., geography and business and include country, city, company, CEO, etc. The association of instances to concepts is illustrated by colour-coding, using the KIM system described in [3]. The creation and management of ontologies is required for many applications of semantic technology and is a significant research topic in itself. An overview of available methodologies is given in [37] which also describes a methodology,