{ "items" : [ { "label" : "Asuncion Gomez-Perez", "email" : "asun@fi.upm.es", "type" : "Person", "affiliation" : "UPM, Spain" }, { "label" : "Stefan Schlobach", "email" : "schlobac@few.vu.nl", "type" : "Person", "affiliation" : "Vrije Universiteit Amsterdam, The Netherlands" }, { "label" : "Yang Wang", "email" : "wwwy@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Yuting Zhao", "email" : "yuting.zhao@griffith.edu.au", "type" : "Person", "affiliation" : "IIIS, The Griffith University" }, { "label" : "Erietta Liarou", "email" : "Erietta.Liarou@cwi.nl", "type" : "Person", "affiliation" : "CWI" }, { "label" : "Bijan Parsia", "email" : "bparsia@cs.man.ac.uk", "type" : "Person" }, { "label" : "Siegfried Handschuh", "email" : "Siegfried.Handschuh@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Dipsy Kappor", "email" : "dipsy@isi.edu", "type" : "Person", "affiliation" : "USC/ISI" }, { "label" : "David Huynh", "email" : "dfhuynh@mit.edu", "type" : "Person", "affiliation" : "MIT CSAIL" }, { "label" : "Yuzhong Qu", "email" : "yzqu@seu.edu.cn", "type" : "Person", "affiliation" : "Southeast University" }, { "label" : "Christian Morbidoni", "email" : "christian@deit.univpm.it", "type" : "Person", "affiliation" : "Semedia Italy" }, { "label" : "Abraham Bernstein", "email" : "bernstein@ifi.unizh.ch", "type" : "Person", "affiliation" : "University of Zurich" }, { "label" : "Anthony Hunter", "email" : "a.hunter@cs.ucl.ac.uk", "type" : "Person", "affiliation" : "University College London" }, { "label" : "Luciano Serafini", "email" : "luciano.serafini@itc.it", "type" : "Person", "affiliation" : "University of Trento, Italy" }, { "label" : "Linyun Fu", "email" : "fulinyun@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "J\u00F6rg Hoffmann", "email" : "joerg.hoffmann@deri.org", "type" : "Person", "affiliation" : "DERI, Universit\u00E4t Innsbruck" }, { "label" : "Fabian Abel", "email" : "abel@l3s.de", "type" : "Person" }, { "label" : "Andrei Tamilin", "email" : "tamilin@itc.it", "type" : "Person", "affiliation" : "Fondazione Bruno Kessler, IRS Trento, Italy" }, { "label" : "Markus Stocker", "email" : "stocker@ifi.uzh.ch", "type" : "Person", "affiliation" : "University of Zurich" }, { "label" : "Stratos Idreos", "email" : "S.Idreos@cwi.nl", "type" : "Person", "affiliation" : "CWI" }, { "label" : "Fernando Bobillo", "email" : "fbobillo@decsai.ugr.es", "type" : "Person", "affiliation" : "University of Granada" }, { "label" : "Matthias Wagner", "email" : "wagner@docomolab-euro.com", "type" : "Person" }, { "label" : "Arne Koesling", "email" : "koesling@l3s.de", "type" : "Person", "affiliation" : "L3S Research Center" }, { "label" : "Boris Motik", "email" : "bmotik@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Eugenio Di Sciascio", "email" : "disciascio@acm.org", "type" : "Person", "affiliation" : "Politecnico di Bari" }, { "label" : "Patrick Lambrix", "email" : "patla@ida.liu.se", "type" : "Person", "affiliation" : "Link\u00F6pings Universitet" }, { "label" : "Hyun Namgoong", "email" : "ngh@snu.ac.kr", "type" : "Person", "affiliation" : "Seoul National University, Korea" }, { "label" : "Haofen Wang", "email" : "whfcarter@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Evren Sirin", "email" : "evren@clarkparsia.com", "type" : "Person", "affiliation" : "Clark & Parsia" }, { "label" : "Christine Golbreich", "email" : "Christine.Golbreich@uvsq.fr", "type" : "Person", "affiliation" : "University of Versailles Saint-Quentin" }, { "label" : "Pascal Hitzler", "email" : "phi@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Mianwei Zhou", "email" : "kopopt@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Apex Lab" }, { "label" : "Lei Zhang", "email" : "lzhangl@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Sean Falconer", "email" : "falconer.sean@gmail.com", "type" : "Person", "affiliation" : "University of Victoria" }, { "label" : "Yong Yu", "email" : "yyu@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Apex Lab" }, { "label" : "Fausto Giunchiglia", "email" : "fausto@dit.unitn.it", "type" : "Person", "affiliation" : "University of Trento, Italy" }, { "label" : "Stephan Bloehdorn", "email" : "sbl@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Esther Kaufmann", "email" : "kaufmann@ifi.unizh.ch", "type" : "Person", "affiliation" : "University of Zurich" }, { "label" : "Gang Wang", "email" : "gavinwang@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Mathieu D\'Aquin", "email" : "m.daquin@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "Chutiporn Anutariya", "email" : "chutiporn@shinawatra.ac.th", "type" : "Person", "affiliation" : "Shinawatra University" }, { "label" : "Antoine Isaac", "email" : "aisaac@few.vu.nl", "type" : "Person", "affiliation" : "Vrije Universiteit Amsterdam, The Netherlands" }, { "label" : "Mingmin Chi", "email" : "mmchi@fudan.edu.cn", "type" : "Person", "affiliation" : "University of Fudan" }, { "label" : "Vassilis Christophides", "email" : "christop@ics.forth.gr", "type" : "Person", "affiliation" : "FORTH-ICS" }, { "label" : "Rob Shearer", "email" : "rshearer@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Brian Davis", "email" : "brian.davis@deri.org", "type" : "Person" }, { "label" : "Miao Xiong", "email" : "xiongmiao@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Apex Lab" }, { "label" : "Christian Halaschek-Wiener", "email" : "halasche@cs.umd.edu", "type" : "Person", "affiliation" : "University of Maryland" }, { "label" : "York Sure", "email" : "sure@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Shenghua Bao", "email" : "shhbao@apex.sjtu.edu.cn", "type" : "Person" }, { "label" : "Rudi Studer", "email" : "studer@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Nicola Henze", "email" : "henze@l3s.de", "type" : "Person", "affiliation" : "Leibniz University Hannover" }, { "label" : "Jos De Bruijn", "email" : "debruijn@inf.unibz.it", "type" : "Person", "affiliation" : "Free University of Bolzano" }, { "label" : "Tommaso Di Noia", "email" : "t.dinoia@poliba.it", "type" : "Person" }, { "label" : "Yannis Tzitzikas", "email" : "tzitzik@ics.forth.gr", "type" : "Person", "affiliation" : "FORTH-ICS" }, { "label" : "Jie Zhang", "email" : "zhangjie@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Hamish Cunningham", "email" : "hamish@dcs.shef.ac.uk", "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Michael Noll", "email" : "michael.g.noll@gmail.com", "type" : "Person", "affiliation" : "Hasso Plattner Institut HPI" }, { "label" : "Ilya Zaihrayeu", "email" : "ilya@dit.unitn.it", "type" : "Person", "affiliation" : "University of Trento, Italy" }, { "label" : "Giovanni Tummarello", "email" : "g.tummarello@gmail.com", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Qi Zhou", "email" : "jackson@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Apex Lab" }, { "label" : "Marta Sabou", "email" : "r.m.sabou@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "\u00D3scar Mu\u00F1oz-Garc\u00EDa", "email" : "omunoz@fi.upm.es", "type" : "Person", "affiliation" : "Facultad de Inform\u00E1tica, Universidad Polit\u00E9cnica de Madrid" }, { "label" : "Kalina Bontcheva", "email" : [ "K.Bontcheva@dcs.shef.ac.uk", "kalina@dcs.shef.ac.uk" ], "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Adam Funk", "email" : "a.funk@dcs.shef.ac.uk", "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Yue Pan", "email" : "panyue@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Gerhard Friedrich", "email" : "gerhard@ifit.uni-klu.ac.at", "type" : "Person", "affiliation" : "Universit\u00E4t Klagenfurt" }, { "label" : "Tudor Groza", "email" : "tudor.groza@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Juan G\u00F3mez-Romero", "email" : "jgomez@decsai.ugr.es", "type" : "Person", "affiliation" : "University of Granada" }, { "label" : "Hong-Gee Kim", "email" : "hgkim@snu.ac.kr", "type" : "Person", "affiliation" : "Seoul National University, Korea" }, { "label" : "Michael Stollberg", "email" : "michael.stollberg@deri.org", "type" : "Person", "affiliation" : "DERI, Universit\u00E4t Innsbruck" }, { "label" : "Reto Bachmann-Gm\u00FCr", "email" : "reto@gmuer.ch", "type" : "Person", "affiliation" : "HP Bristol" }, { "label" : "Aaron Kershenbaum", "email" : "aaronk@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Juri De Coi", "email" : "decoi@l3s.de", "type" : "Person", "affiliation" : "L3S Research Center" }, { "label" : "David Karger", "email" : "karger@mit.edu", "type" : "Person", "affiliation" : "MIT CSAIL" }, { "label" : "Dmitry Tishkovsky", "email" : "dmitry@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Achille Fokoue", "email" : "achille@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Xian Wu", "email" : "wuxian@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "TAKASHI YAMAUCHI", "email" : "tya@psyc.tamu.edu", "type" : "Person", "affiliation" : "Texas A&M University" }, { "label" : "Aditya Kalyanpur", "email" : "adityakal@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Jeff Pan", "email" : "jpan@csd.abdn.ac.uk", "type" : "Person", "affiliation" : "University of Aberdeen" }, { "label" : "Jan Korst", "email" : "jan.korst@philips.com", "type" : "Person", "affiliation" : "Philips Research" }, { "label" : "Vilas Wuwongse", "email" : "vilasw@ait.ac.th", "type" : "Person", "affiliation" : "Asian Institute of Technology" }, { "label" : "William Murdock", "email" : "murdockj@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "James Fan", "email" : "fanj@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Daniel Krause", "email" : "krause@l3s.de", "type" : "Person", "affiliation" : "L3S Research Center" }, { "label" : "Massimo Paolucci", "email" : "paolucci@docomolab-euro.com", "type" : "Person" }, { "label" : "Holger Lewen", "email" : "hle@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Christopher Welty", "email" : "welty@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Li Ma", "email" : "malli@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Olga Kozeruk", "email" : "olga.kozeruk@gmail.com", "type" : "Person" }, { "label" : "Bernardo Cuenca Grau", "email" : "bcg@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Xuanjing Huang", "email" : "xjhuang@fudan.edu.cn", "type" : "Person", "affiliation" : "University of Fudan" }, { "label" : "Eyal Oren", "email" : "eyal.oren@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Renate Schmidt", "email" : "renate.schmidt@manchester.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "QiaoLing Liu", "email" : "lql@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Stefan Decker", "email" : "Stefan.Decker@DERI.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Rachanee Ungrangsi", "email" : "rachanee@shinawatra.ac.th", "type" : "Person", "affiliation" : "Shinawatra University" }, { "label" : "Dietmar Jannach", "email" : "dietmar@ifit.uni-klu.ac.at", "type" : "Person" }, { "label" : "Aidan Hogan", "email" : "aidan.hogan@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Martin Hepp", "email" : "martin.hepp@deri.org", "type" : "Person", "affiliation" : "DERI, Universit\u00E4t Innsbruck" }, { "label" : "Sofia Angeletou", "email" : "s.angeletou@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "Yevgeny Kazakov", "email" : "ykazakov@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Haiping Zhu", "email" : "zhu@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Wei Pan", "email" : "panwei@fudan.edu.cn", "type" : "Person", "affiliation" : "University of Fudan" }, { "label" : "Taowei Wang", "email" : "tw7@cs.umd.edu", "type" : "Person", "affiliation" : "University of Maryland" }, { "label" : "Philipp Cimiano", "email" : "cimiano@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Tuukka Ruotsalo", "email" : "tuukka.ruotsalo@tkk.fi", "type" : "Person", "affiliation" : "Helsinki University of Technology TKK, Finland" }, { "label" : "Margaret-Anne Storey", "email" : "mstorey@uvic.ca", "type" : "Person", "affiliation" : "University of Victoria" }, { "label" : "Enrico Motta", "email" : "e.motta@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "Andreas Harth", "email" : "andreas.harth@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Lourens Van der Meij", "email" : "lourens@few.vu.nl", "type" : "Person", "affiliation" : "Vrije Universiteit Amsterdam, The Netherlands" }, { "label" : "Daniel Olmedilla", "email" : "olmedilla@l3s.de", "type" : "Person", "affiliation" : "L3S Research Center" }, { "label" : "Gijs Geleijnse", "email" : "gijs.geleijnse@philips.com", "type" : "Person", "affiliation" : "Philips Research" }, { "label" : "Lynda Hardman", "email" : "Lynda.Hardman@cwi.nl", "type" : "Person", "affiliation" : "CWI" }, { "label" : "Qi Ju", "email" : "qi@jlu.edu.cn", "type" : "Person", "affiliation" : "Jilin University" }, { "label" : "Thanh Tran", "email" : "dtr@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Miguel Delgado", "email" : "mdelgado@ugr.es", "type" : "Person", "affiliation" : "University of Granada" }, { "label" : "Azzurra Ragone", "email" : "a.ragone@poliba.it", "type" : "Person", "affiliation" : "Politecnico di Bari" }, { "label" : "Jose Luis Ambite", "email" : "ambite@isi.edu", "type" : "Person", "affiliation" : "University of Southern California" }, { "label" : "Manolis Koubarakis", "email" : "koubarak@di.uoa.gr", "type" : "Person", "affiliation" : "National and Kapodistrian University of Athens" }, { "label" : "Miroslav Vacura", "email" : "vacuram@vse.cz", "type" : "Person", "affiliation" : "University of Economics, Prague" }, { "label" : "Richard Arndt", "email" : "rarndt@uni-koblenz.de", "type" : "Person", "affiliation" : "University of Koblenz-Landau" }, { "label" : "Francesco Donini", "email" : "donini@unitus.it", "type" : "Person", "affiliation" : "Universit\u00E0 della Tuscia" }, { "label" : "Orri Erling", "email" : "oerling@yahoo.com", "type" : "Person", "affiliation" : "OpenLink Software" }, { "label" : "Diana Trif", "email" : "diana.trif@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Jorge Gracia", "email" : "jogracia@unizar.es", "type" : "Person", "affiliation" : "University of Zaragoza" }, { "label" : "Huajie Zhang", "email" : "zhjay@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Shanghai Jiao Tong University, China" }, { "label" : "Lei Sun", "email" : "leisun@fudan.edu.cn", "type" : "Person", "affiliation" : "University of Fudan" }, { "label" : "Kostyantyn Shchekotykhin", "email" : "kostya@ifit.uni-klu.ac.at", "type" : "Person", "affiliation" : "Universit\u00E4t Klagenfurt" }, { "label" : "He Tan", "email" : "hetan@ida.liu.se", "type" : "Person", "affiliation" : "Link\u00F6pings Universitet" }, { "label" : "Julian Dolby", "email" : "dolby@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "Shenghui Wang", "email" : "swang@few.vu.nl", "type" : "Person", "affiliation" : "Vrije Universiteit Amsterdam, The Netherlands" }, { "label" : "Peter Haase", "email" : "pha@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Steffen Staab", "email" : "staab@uni-koblenz.de", "type" : "Person", "affiliation" : "University of Koblenz-Landau" }, { "label" : "Valentin Tablan", "email" : "v.tablan@dcs.shef.ac.uk", "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Renaud Delbru", "email" : "renaud.delbru@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Robert Miller", "email" : "rcm@mit.edu", "type" : "Person", "affiliation" : "MIT CSAIL" }, { "label" : "Raphael Troncy", "email" : "raphael.troncy@cwi.nl", "type" : "Person", "affiliation" : "CWI" }, { "label" : "Matthew Horridge", "email" : "matthew.horridge@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Christoph Kiefer", "email" : "kiefer@ifi.uzh.ch", "type" : "Person", "affiliation" : "University of Zurich" }, { "label" : "Sebastian Rudolph", "email" : "sru@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "David Robertson", "email" : "dr@inf.ed.ac.uk", "type" : "Person", "affiliation" : "University of Edinburgh" }, { "label" : "Wei Hu", "email" : "whu@seu.edu.cn", "type" : "Person", "affiliation" : "Southeast University" }, { "label" : "Dimitris Zeginis", "email" : "zeginis@ics.forth.gr", "type" : "Person", "affiliation" : "FORTH-ICS" }, { "label" : "Chong Wang", "email" : "wangchong@apex.sjtu.edu.cn", "type" : "Person", "affiliation" : "Apex Lab" }, { "label" : "Juergen Umbrich", "email" : "juergen.umbrich@stud.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Rodney Topor", "email" : "r.topor@griffith.edu.au", "type" : "Person", "affiliation" : "IIIS, The Griffith University" }, { "label" : "Stijn Heymans", "email" : "stijn.heymans@deri.org", "type" : "Person", "affiliation" : "DERI, Universit\u00E4t Innsbruck" }, { "label" : "Paolo Besana", "email" : "p.besana@sms.ed.ac.uk", "type" : "Person", "affiliation" : "University of Edinburgh" }, { "label" : "Ian Horrocks", "email" : "horrocks@cs.man.ac.uk", "type" : "Person", "affiliation" : "University of Manchester, UK" }, { "label" : "Guilin Qi", "email" : "guilin_qi@yahoo.co.uk", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Markus Kr\u00F6tzsch", "email" : "mak@aifb.uni-karlsruhe.de", "type" : "Person", "affiliation" : "University of Karlsruhe, Germany" }, { "label" : "Kewen Wang", "email" : "k.wang@griffith.edu.au", "type" : "Person", "affiliation" : "IIIS, The Griffith University" }, { "label" : "Christoph Meinel", "email" : "meinel@hpi.uni-potsdam.de", "type" : "Person", "affiliation" : "Hasso Plattner Institut HPI" }, { "track" : "Research track", "paper-id" : "153", "author" : [ "Lei Zhang", "QiaoLing Liu", "Jie Zhang", "Haofen Wang", "Yue Pan", "Yong Yu" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Management of the Semantic Web data" ], "abstract" : "As an extension to the current Web, Semantic Web will not only contain structured data with machine understandable semantics but also textual information. While structured queries can be used to find information more precisely on the Semantic Web, keyword searches are still needed to help exploit textual information. It thus becomes very important that we can combine precise structured queries with imprecise keyword searches to have a hybrid query capability. In addition, due to the huge volume of information on the Semantic Web, the hybrid query must be processed in a very scalable way. In this paper, we define such a hybrid query capability that combines unary tree shaped structured queries with keyword searches. We show how existing information retrieval (IR) index structures and functions can be reused to index semantic web data and its textual information, and how the hybrid query is evaluated on the index structure using IR engines in an efficient and scalable manner. We implemented this IR approach in an engine called Semplore. Comprehensive experiments on its performance show that it is a promising approach. It leads us to believe that it may be possible to evolve current web search engines to query and search the Semantic Web. Finally, we breifly describe how Semplore is used for searching Wikipedia and an IBM customer\'s product information.", "label" : "Semplore: An IR Approach to Scalable Hybrid Query of Semantic Web Data", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "17", "author" : [ "Gijs Geleijnse", "Jan Korst" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Ontology creation, search, extraction and evolution" ], "abstract" : "We present a simple method to extract information from search engine snippets. Although the techniques presented are domain independent, this work focuses on extracting biographical information of historical persons from multiple unstructured sources on the Web. We first similarly find a list of persons and their periods of life by querying the periods and scanning the retrieved snippets for person names. Subsequently, we find biographical information for the persons extracted. In order to get insight in the mutual relations among the persons identified, we create a social network using co-occurrences on the Web. Although we use uncontrolled and unstructured Web sources, the information extracted is reliable. Moreover we show that Web Information Extraction can be used to create both informative and enjoyable applications.", "label" : "Creating a Dead Poets Society: Extracting a Social Network of Historical Persons from the Web", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "234", "author" : [ "Antoine Isaac", "Lourens Van der Meij", "Stefan Schlobach", "Shenghui Wang" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Evaluation of Semantic Web technologies", "Ontology matching and integration", "Semantic web technology for collaboration and cooperatio", "Management of the Semantic Web data" ], "abstract" : "Instance based ontology mapping is a promising family of solutions to a class of ontology alignment problems. Instance based ontology mapping crucially depends on measuring the similarity between sets of annotated instances. In this paper we study how the choice of co occurrence measures affects the performance of instance based mapping. To this end, we have implemented a number of different statistical co occurrence measures. We have prepared an extensive test case using vocabularies of thousands of terms, millions of instances, and hundreds of thousands of co annotated items, and we have obtained a human Gold Standard judgement for part of the mapping space. We then study how the different co occurrence measures and a number of algorithmic variations perform on our benchmark dataset, as compared against the Gold Standard. Our systematic study shows excellent results of instance based matching in general, where the more simple measures often outperform more sophisticated statistical co occurrence measures.", "label" : "An empirical study of instance based ontology matching", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "103", "author" : [ "David Huynh", "Robert Miller", "David Karger" ], "type" : "Paper", "subject" : [ "User interaction", "Evaluation of Semantic Web technologies", "Information integration", "Ontology matching and integration", "Personal information management" ], "abstract" : "As there is more and more reusable structured data on the Web, casual users will want to take into their own hands the task of mashing up data rather than wait for mash up sites to be built that address exactly their individually unique needs. In this paper, we present Potluck, a Web user interface that lets casual users\u2014those without programming skills and data modeling expertise\u2014mash up data themselves. Potluck is novel in its use of drag and drop for merging fields, its integration and extension of the faceted browsing paradigm for focusing on subsets of data to align, and its application of simultaneous editing for cleaning up data syntactically. Potluck also lets the user construct rich visualizations of data in place as the user aligns and cleans up the data. This iterative process of integrating the data while constructing useful visualizations is desirable when the user is unfamiliar with the data at the beginning\u2014a common case\u2014and wishes to get immediate value out of the data without having to spend the overhead of completely and perfectly integrating the data first. A user study on Potluck indicated that it was usable and learnable, and elicited excitement from programmers who, even with their programming skills, previously had great difficulties performing data integration.", "label" : "Potluck: Data Mash Up for Non programmers", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "24", "author" : [ "Rachanee Ungrangsi", "Chutiporn Anutariya", "Vilas Wuwongse" ], "type" : "Paper", "subject" : [ "Ontology matching and integration", "Ontology creation, search, extraction and evolution", "Management of the Semantic Web data" ], "abstract" : "Automatic knowledge reuse for Semantic Web applications imposes several challenges on ontology search. Existing ontology retrieval systems merely return a lengthy list of relevant single ontologies, which may not completely cover the specified user requirements. Therefore, there arises an increasing demand for a tool or algorithm with a mechanism to check concept adequacy of existing ontologies with respect to a user query, and then recommend a single or combination of ontologies which can entirely fulfill the requirements. Thus, this paper develops an algorithm, namely combiSQORE to determine whether the available collection of ontologies is able to completely satisfy a submitted query and return a single or combinative ontology that guarantees query coverage. In addition, it ranks the returned answers based on their conceptual closeness and query coverage. The experimental results show that the proposed algorithm is simple, efficient and effective.", "label" : "combiSQORE: An Ontology Combination Algorithm", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "298", "author" : [ "Juan G\u00F3mez-Romero", "Fernando Bobillo", "Miguel Delgado" ], "type" : "Paper", "subject" : "Ontology engineering", "abstract" : "Design patterns are widely used software engineering abstractions which define guidelines for modeling common application scenarios. Ontology design patterns are the extension of software patterns for knowledge acquisition in the Semantic Web. In this work we present a design pattern for representing relevance depending on context in OWL ontologies, i.e. to assert which knowledge from the domain ought to be considered in a given scenario. Besides the formal semantics and the features of the pattern, we describe a reasoning procedure to extract relevant knowledge in the resulting ontology and a plug in for Prot\u00E9g\u00E9 which assists pattern use.", "label" : "An Ontology Design Pattern for Representing Relevance in OWL", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "226", "author" : [ "Azzurra Ragone", "Eugenio Di Sciascio", "Tommaso Di Noia", "Francesco Donini" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Formal languages and reasoning", "Semantic Web for e Business technology and applications" ], "abstract" : "We present a semantic based approach to multi issue bilateral negotiation for e commerce. We use Description Logics to model advertisements, and relations among issues as axioms in a TBox. We then introduce a logic based alternating offers protocol, able to handle conflicting information, that merges non standard reasoning services in Description Logics with utility thoery to find the most suitable agreements. We illustrate and motivate the theoretical framework, the logical language, and the negotiation protocol.", "label" : "Alternating offers protocol for multi issue bilateral negotiation in semantic enabled marketplaces", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "315", "author" : [ "Linyun Fu", "Haofen Wang", "Haiping Zhu", "Huajie Zhang", "Yang Wang", "Yong Yu" ], "type" : "Paper", "subject" : [ "None of the above", "Semantic web technology for collaboration and cooperatio" ], "abstract" : "Wikipedia, a killer application in Web 2.0, has embraced the power of collaborative editing to harness collective intelligence. It can also serve as an ideal Semantic Web data source due to its abundance, influence, high quality and well-structuring. However, the heavy burden of up-building and maintaining such an enormous and ever-growing online encyclopedic knowledge base still rests on a very small group of people. Many casual users may still feel difficulties in writing high quality Wikipedia articles. In this paper, we use RDF graphs to model the key elements in Wikipedia authoring, and propose an integrated solution to make Wikipedia authoring easier based on RDF graph matching, expecting making more Wikipedians. Our solution facilitates semantics reuse and provides users with: 1) a link suggestion module that suggests and auto-completes internal links between Wikipedia articles for the user; 2) a category suggestion module that helps the user place her articles in correct categories. A prototype system is implemented and experimental results show significant improvements over existing solutions to link and category suggestion tasks. The proposed enhancements can be applied to attract more contributors and relieve the burden of professional editors, thus enhancing the current Wikipedia to make it an even better Semantic Web data source.", "label" : "Making More Wikipedians: Facilitating Semantics Reuse for Wikipedia Authoring", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "256", "author" : [ "Giovanni Tummarello", "Eyal Oren", "Renaud Delbru" ], "type" : "Paper", "subject" : [ "Information integration", "Semantics in peer to peer systems and grids", "Database technologies for the Semantic Web", "Management of the Semantic Web data" ], "abstract" : "Abstract. Developers of SemanticWeb applications face a challenge with respect to the decentralised publication model: where to find statements about encountered resources. The \u201Clinked data\u201D approach, which mandates that resource URIs should be de referenced and yield metadata about the resource, helps but is only a partial solution and not followed widely. We present a lookup index over resources crawled on the Semantic Web. Our index allows applications to automatically retrieve sources with information about a certain resource. In contrast to more feature rich Semantic Web search engines, our index is purposely limited in scope and functionality to achieve highly scalability and maintainability.", "label" : "Sindice.com: Weaving the Open Linked Data", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "224", "author" : [ "Dmitry Tishkovsky", "Renate Schmidt" ], "type" : "Paper", "subject" : [ "None of the above", "Formal languages and reasoning" ], "abstract" : "This paper presents a tableau approach for deciding description logics outside the scope of OWL DL and current state of the art tableau based description logic systems. In particular, we define a sound and complete tableau calculus for the description logic ALBO and show that it provides a basis for decision procedures for this logic and numerous other description logics with full role negation. ALBO is the extension of ALC with the Boolean role operators, inverse of roles, domain and range restriction operators and it includes full support for objects (nominals). ALBO is a very expressive description logic which is NExpTime complete and subsumes Boolean modal logic and the two variable fragment of first order logic. An important novelty is the use of a versatile, unrestricted blocking rule as a replacement for standard loop checking mechanisms implemented in description logic systems. An implementation of our approach exists in the MetTeL system.", "label" : "Using Tableau to Decide Expressive Description Logics with Role Negation", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "45", "author" : [ "Dimitris Zeginis", "Yannis Tzitzikas", "Vassilis Christophides" ], "type" : "Paper", "subject" : [ "Ontology creation, search, extraction and evolution", "Management of the Semantic Web data" ], "abstract" : "The ability to compute the differences that exist between two RDF models is an important step to cope with the evolving nature of the Semantic Web (SW). In particular, RDF Deltas can be employed to reduce the amount of data that need to be exchanged and managed over the network and hence build advanced SW synchronization and versioning services. By considering Deltas as sets of change operations, in this paper we study various RDF comparison functions in conjunction with the semantics of the underlying change operations and formally analyze their possible combinations in terms of correctness, minimality, semantic identity and redundancy properties.", "label" : "On the Foundations of Computing Deltas between RDF models", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "93", "author" : [ "Sean Falconer", "Margaret-Anne Storey" ], "type" : "Paper", "subject" : [ "User interaction", "Ontology matching and integration", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "Ontology mapping is the key to data interoperability in the semantic web. This problem has received a lot of research attention, however, the research emphasis has been mostly devoted to automating the mapping process, even though the creation of mappings often involve the user. As industry interest in semantic web technologies grows and the number of widely adopted semantic web applications increases, we must begin to support the user. In this paper, we combine data gathered from background literature, theories of cognitive support and decision making, and an observational case study to propose a theoretical framework for cognitive support in ontology mapping tools. We also describe a tool called CogZ that is based on this framework.", "label" : "A cognitive support framework for ontology mapping", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "55", "author" : [ "Esther Kaufmann", "Abraham Bernstein" ], "type" : "Paper", "subject" : [ "User interaction", "Evaluation of Semantic Web technologies", "Natural language technologies and information extraction" ], "abstract" : "Natural language interfaces offer end users a familiar and convenient option for querying ontology based knowledge bases. Several studies have shown that they can achieve high retrieval performance as well as domain independence. This paper focuses on usability and investigates if NLIs are useful from an end user\'s point of view. To that end, we introduce four interfaces each allowing a different query language and present a usability study benchmarking these interfaces. The results of the study reveal a clear preference for full sentences as query language and confirm that NLIs are useful for querying Semantic Web data.", "label" : "How Useful are Natural Language Interfaces to the Semantic Web for Casual End users?", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "297", "author" : [ "Fabian Abel", "Juri De Coi", "Nicola Henze", "Arne Koesling", "Daniel Krause", "Daniel Olmedilla" ], "type" : "Paper", "subject" : [ "Information integration", "Representing and reasoning about trust, privacy, and security", "Personal information management", "Database technologies for the Semantic Web", "Management of the Semantic Web data" ], "abstract" : "Semantic Web databases allow efficient storage and access to RDF statements. Applications are able to use expressive query languages in order to retrieve relevant metadata in order to perform different tasks. However, access to metadata may not be public to just any application or service. Instead, powerful and flexible mechanisms for protecting sets of RDF statements are required for many Semantic Web applications. Unfortunately, current RDF stores do not provide fine grained protection. This paper fills this gap and presents a mechanism by which complex and expressive policies can be specified in order to protect access to metadata in multi service environments.", "label" : "Enabling Advanced and Context Dependent Access Control in RDF Stores", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "286", "author" : [ "Thanh Tran", "Philipp Cimiano", "Sebastian Rudolph", "Rudi Studer" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "User interaction", "Natural language technologies and information extraction", "Agents and Services for the Semantic Web" ], "abstract" : "Current information retrieval (IR) approaches do not formally capture the explicit meaning of a keyword query but provide a comfortable way for the user to specify information needs on the basis of keywords. Ontology based approaches allow for sophisticated semantic search but impose a query syntax more difficult to handle. In this paper, we present an approach for translating keyword queries to DL conjunctive queries using background knowledge available in ontologies. We present an implementation which shows that this interpretation of keywords can then be used for both exploration of asserted knowledge and for a semantics based declarative query answering process. We also present an evaluation of our system and a discussion of the limitations of the approach with respect to our underlying assumptions which directly points to issues for future work.", "label" : "Ontology based Interpretation of Keywords for Semantic Search", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "240", "author" : [ "Bernardo Cuenca Grau", "Yevgeny Kazakov", "Christian Halaschek-Wiener" ], "type" : "Paper", "subject" : [ "Formal languages and reasoning", "Ontology engineering", "Agents and Services for the Semantic Web", "Ontology creation, search, extraction and evolution" ], "abstract" : "The development of ontologies involves continuous but relatively small modifications. Existing ontology reasoners, however, do not take advantage of the similarities between different versions of an ontology. In this paper, we propose a technique for incremental reasoning that is, reasoning that reuses information obtained from previous versions of an ontology based on the notion of a module. Our technique does not depend on a particular reasoning calculus and thus can be used in combination with any reasoner. We have applied our results to incremental classification of OWL DL ontologies and found significant improvement over regular classification time on a set of real world ontologies.", "label" : "History Matters: Incremental Ontology Reasoning Using Modules", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "263", "author" : [ "Taowei Wang", "Bijan Parsia" ], "type" : "Paper", "subject" : [ "User interaction", "Formal languages and reasoning", "Ontology engineering" ], "abstract" : "``[Reasoner] performance can be scary, so much so, that we cannot deploy the technology in our products.\'\' Michael Shepard (http://lists.w3.org/Archives/Public/public owl dev/2007JanMar/0047.html). What are typical OWL users to do when their favorite reasoner never seems to return? In this paper, we present our first steps considering this problem. We describe the challenges and our approach, and present a prototype tool to help users identify reasoner performance bottlenecks with respect to their ontologies. We then describe 4 case studies on synthetic and real world ontologies. While the anecdotal evidence suggests that the service can be useful for both ontology developers and reasoner implementors, much more is desired.", "label" : "Ontology Performance Profiling and Model Examination: First Steps", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "16", "author" : [ "Richard Arndt", "Raphael Troncy", "Steffen Staab", "Lynda Hardman", "Miroslav Vacura" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "Semantic descriptions of non-textual media available on the web can be used to facilitate retrieval and presentation of media assets and documents containing them. While technologies for multimedia semantic descriptions already exist, there is as yet no formal description of a high quality multimedia ontology that is compatible with existing (semantic) web technologies. We explain the complexity of the problem using an annotation scenario. We then derive a number of requirements for specifying a formal multimedia ontology before we present the developed ontology, COMM, and evaluate it with respect to our requirements. We provide an API for generating multimedia annotations that conform to COMM.", "label" : "COMM: Designing a Well Founded Multimedia Ontology for the Web", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "169", "author" : [ "Tuukka Ruotsalo", "Eero Hyvnen" ], "type" : "Paper", "subject" : [ "Information integration", "Ontology matching and integration", "Ontology engineering" ], "abstract" : "This paper presents a method for making metadata conforming to heterogeneous schemas semantically interoperable. The idea is to make the knowledge embedded in the schema structures interoperable and explicit by transforming the schemas into a shared, event based representation of knowledge about the real world. This enables and simpli\uFB01es accurate reasoning services such as cross domain semantic search, browsing, and recommending. A case study of transforming three different schemas and datasets is presented. An implemented knowledge based recommender system utilizing the results in the semantic portal CULTURESAMPO was found useful in a preliminary user study.", "label" : "An Event based Approach for Semantic Metadata Interoperability", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "170", "author" : "TAKASHI YAMAUCHI", "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "User interaction", "Evaluation of Semantic Web technologies", "Ontology creation, search, extraction and evolution" ], "abstract" : "For the development of Semantic Web technology, researchers and developers in the Semantic Web community need to focus on the areas in which human reasoning is particularly difficult. Two studies in this paper demonstrate that people are predisposed to use class-inclusion labels for inductive judgments. This tendency appears to stem from a general characteristic of human reasoning – using heuristics to solve problems. The inference engines and interface designs that incorporate human reasoning need to integrate this general char-acteristic underlying human induction.", "label" : "The Semantic Web and Human Inference: A Lesson from Cognitive Science", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "107", "author" : [ "Guilin Qi", "Anthony Hunter" ], "type" : "Paper", "subject" : [ "None of the above", "Ontology engineering" ], "abstract" : "Ontologies play a core role for the success of the Semantic Web as they provide a shared vocabulary for different resources and applications. Developing an error free ontology is a difficult task. A common kind of error for an ontology is logical contradiction or incoherence. In this paper, we propose some approaches to measuring incoherence in DL based ontologies. These measures give an ontology engineer important information for maintaining and evaluating ontologies. We implement the proposed approaches using the KAON2 reasoner and provide some preliminary but encouraging empirical results.", "label" : "Measuring Incoherence in Description Logic based Ontologies", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "39", "author" : [ "Kostyantyn Shchekotykhin", "Dietmar Jannach", "Gerhard Friedrich", "Olga Kozeruk" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Ontology creation, search, extraction and evolution", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "The process of instantiating an ontology with high quality and up to date instance information manually is both time consuming and prone to error. Automatic ontology instantiation from Web sources is one of the possible solutions to this problem and aims at the computer supported population of an ontology through the exploitation of (redundant) information available on the Web. In this paper we present AllRight, a comprehensive ontology instantiating system. In particular, the techniques implemented in AllRight are designed for application scenarios, in which the desired instance information is given in the form of tables and for which existing Information Extraction approaches based on statistical or natural language processing methods are not directly applicable. Within AllRight, we have therefore developed new techniques for dealing with tabular instance data and combined these techniques with existing methods. The system supports all necessary steps for ontology instantiation, i.e. web crawling, name extraction, document clustering as well as fact extraction and validation. AllRight has been successfully evaluated in the popular domains of digital cameras and notebooks leading to a about eighty percent accuracy of the extracted facts given only a very limited amount of seed knowledge.", "label" : "ALLRIGHT: Automatic Ontology Instantiation from Tabular Web Documents", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "37", "author" : [ "Erietta Liarou", "Stratos Idreos", "Manolis Koubarakis" ], "type" : "Paper", "subject" : [ "Semantics in peer to peer systems and grids", "Management of the Semantic Web data" ], "abstract" : "We study the continuous evaluation of conjunctive triple pattern queries over RDF data stored in distributed hash tables. In a continuous query scenario network nodes subscribe with long standing queries and receive answers whenever RDF triples satisfying their queries are published. We present two novel query processing algorithms for this scenario and analyze their properties formally. Our performance goal is to have algorithms that scale to large amounts of RDF data, distribute the storage and query processing load evenly and incur as little network traffic as possible. We discuss the various performance tradeoffs that occur through a detailed experimental evaluation of the proposed algorithms.", "label" : "Continuous RDF Query Processing over DHTs", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "47", "author" : [ "Wei Hu", "Yuzhong Qu" ], "type" : "Paper", "subject" : [ "Information integration", "Ontology matching and integration" ], "abstract" : "Ontologies proliferate with the growth of the Semantic Web. However, most of data on the Web are still stored in relational databases. Therefore, it is important to establish interoperability between relational databases and ontologies for creating a Web of data. An effective way to achieve interoperability is finding mappings between relational database schemas and ontologies. In this paper, we propose a new approach to discovering simple mappings between a relational database schema and an ontology. It exploits simple mappings based on virtual documents, and eliminates incorrect mappings via validating mapping consistency. Additionally, it also constructs a special type of semantic mappings, called contextual mappings, which is useful for practical applications. Experimental results demonstrate that our approach performs well on several data sets from real world domains.", "label" : "Discovering Simple Mappings Between Relational Database Schemas and Ontologies", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "212", "author" : [ "Markus Kr\u00F6tzsch", "Sebastian Rudolph", "Pascal Hitzler" ], "type" : "Paper", "subject" : "Formal languages and reasoning", "abstract" : "Despite the success of the Web Ontology Language OWL, the development of expressive means for querying OWL knowledge bases is still an open issue. In this paper, we investigate how a very natural and desirable form of queries \u2013 namely conjunctive ones \u2013 can be used in conjunction with OWL such that one of the major design criteria of the latter \u2013 namely decidability \u2013 can be retained. More precisely, we show that querying the tractable fragment EL++ of OWL 1.1 is decidable. We also provide a complexity analysis and show that querying unrestricted EL++ is undecidable.", "label" : "Conjunctive Queries for a Tractable Fragment of OWL 1.1", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "176", "author" : [ "Michael Noll", "Christoph Meinel" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Social networks and processes on the Semantic Web", "Evaluation of Semantic Web technologies", "Personal information management", "Semantic web technology for collaboration and cooperatio", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "In this paper, we present a new approach to web search personalization based on user collaboration and sharing of information about web documents. The proposed personalization technique separates data collection and user profiling from the information system whose contents and indexed documents are being searched for, i.e. the search engines, and uses social bookmarking and tagging to re rank web search results. It is independent of the search engine being used, so users are free to choose the one they prefer, even if their favorite search engine does not natively support personalization. We show how to design and implement such a system in practice and investigate its feasibility and usefulness with large sets of real word data and a user study.", "label" : "Web search personalization via social bookmarking and tagging", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "171", "author" : [ "Andrei Tamilin", "Luciano Serafini" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Information integration", "Formal languages and reasoning", "Ontology engineering" ], "abstract" : "In this paper we address the problem of migrating instances between heterogeneous overlapping ontologies. The instance migration problem arises when one wants to reclassify a set of instances of a source ontology into a semantically related target ontology. Our approach exploits mappings between ontologies, which are used to reconcile both conceptual and individual level heterogeneity, and further used to draw the migration process. We ground the approach on a distributed description logic (DDL), in which ontologies are formally encoded as DL knowledge bases and mappings as bridge rules and individual correspondences. From the theoretical side, we study the task of reasoning with instance data in DDL composed of SHIQ ontologies and define a correct and complete distributed tableaux inference procedure. From the practical side, we upgrade the DRAGO DDL reasoner for dealing with instances and further show how it can be used to drive the migration of instances between heterogeneous ontologies.", "label" : "Instance Migration in Heterogeneous Ontology Environments", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "201", "author" : [ "Gang Wang", "Yong Yu", "Haiping Zhu" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "Extracting semantic relations is of great importance for the creation of the Semantic Web content. It is of great benefit to semi-automatically extract relations from the free text of Wikipedia using the structured content readily available in it. Pattern matching methods that employ information redundancy cannot work well since there is not much redundancy information in Wikipedia, compared to the Web. Multi-class classification methods are not reasonable since no classification of relation types is available in Wikipedia. In this paper, we propose PORE (Positive-Only Relation Extraction), for relation extraction from Wikipedia text. The core algorithm B-POL extends a state-of-the-art positive-only learning algorithm using bootstrapping, strong negative identification, and transductive inference to work with fewer positive training examples. We conducted experiments on several relations with different amount of training data. The experimental results show that B-POL can work effectively given only a small amount of positive training examples and it significantly outperforms the original positive learning approaches and a multi-class SVM. Furthermore, although PORE is applied in the context of Wikipedia, the core algorithm B-POL is a general approach for Ontology Population and can be adapted to other domains.", "label" : "PORE: Positive Only Relation Extraction from Wikipedia Text", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "205", "author" : [ "Adam Funk", "Valentin Tablan", "Kalina Bontcheva", "Hamish Cunningham", "Brian Davis", "Siegfried Handschuh" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Ontology creation, search, extraction and evolution" ], "abstract" : "This paper presents a controlled language for ontology editing and a software implementation, based partly on standard NLP tools, for processing that language and manipulating an ontology. The input sentences are analysed deterministically and compositionally with respect to a given ontology, which the software consults in order to interpret the input\u2019s semantics; this allows the user to learn fewer syntactic structures since some of them can be used to refer to either classes or instances, for example. A repeated measures, task based evaluation has been carried out in comparison with a well known ontology editor; our software received favourable results for basic tasks. The paper also discusses work in progress and future plans for developing this language and tool.", "label" : "CLOnE: Controlled Language for Ontology Editing", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "250", "author" : [ "Tudor Groza", "Knud M\u00F6ller", "Siegfried Handschuh", "Diana Trif", "Stefan Decker" ], "type" : "Paper", "subject" : [ "None of the above", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "In this paper we present a solution for ``weaving the claim web\'\', i.e. the creation of knowledge networks via so called claims stated in scientific publications created with the SALT (Semantically Annotated LaTeX) framework. To attain this objective, we provide support for claim identification, evolved the appropriate ontologies and defined a claim citation and reference mechanism. We also describe a prototypical claim search engine, which allows to reference to existing claims and hence, weave the web. Finally, we performed a small scale evaluation of the authoring framework with a quite promising outcome.", "label" : "SALT: Weaving the claim web", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "296", "author" : [ "Ilya Zaihrayeu", "Lei Sun", "Fausto Giunchiglia", "Wei Pan", "Qi Ju", "Mingmin Chi", "Xuanjing Huang" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "Hierarchical classifications are used pervasively by humans as a means to organize their data and knowledge about the world. One of their main advantages is that natural language labels, used to describe their contents, are easily understood by human users. However, at the same time, this is also one of their main disadvantages as these same labels are ambiguous and very hard to be reasoned about by software agents. This fact creates an insuperable hindrance for classifications to being embedded in the Semantic Web infrastructure. This paper presents an approach to converting classifications into lightweight ontologies, and it makes the following contributions: (i) it identifies the main NLP problems related to the conversion process and shows how they are different from the classical problems of NLP; (ii) it proposes heuristic solutions to these problems, which are especially effective in this domain; and (iii) it evaluates the proposed solutions by testing them on DMoz data.", "label" : "From Web Directories to Ontologies: Natural Language Processing Challenges", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "150", "author" : [ "He Tan", "Patrick Lambrix" ], "type" : "Paper", "subject" : [ "Ontology matching and integration", "Ontology engineering" ], "abstract" : "In different areas ontologies have been developed and many of these ontologies contain overlapping information. Often we would therefore want to be able to use multiple ontologies. To obtain good results, we need to find the relationships between terms in the different ontologies, i.e. we need to align them. Currently, there already exist a number of different alignment strategies. However, it is usually difficult for a user that needs to align two ontologies to decide which of the different available strategies are the most suitable. In this paper we propose a method that provides recommendations on alignment strategies for a given alignment problem. The method is based on the evaluation of the different available alignment strategies on several small selected pieces from the ontologies, and uses the evaluation results to provide recommendations. In the paper we give the basic steps of the method, and then illustrate and discuss the method in the setting of an alignment problem with two well known biomedical ontologies. We also experiment with different implementations of the steps in the method.", "label" : "A method for recommending ontology alignment strategies", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "20", "author" : [ "Michael Stollberg", "Martin Hepp", "J\u00F6rg Hoffmann" ], "type" : "Paper", "subject" : [ "Formal languages and reasoning", "Agents and Services for the Semantic Web", "Semantic Web for e Business technology and applications" ], "abstract" : "The discovery of suitable Web services for a given task is one of the central operations in Service oriented Architectures (SOA), and research on Semantic Web services (SWS) aims at automating this step. For the large amount of available Web services that can be expected in real world settings, the computational costs of automated discovery based on semantic matchmaking become important. To make a discovery engine a reliable software component, we must thus aim at minimizing both the mean and the variance of the duration of the discovery task. For this, we present an extension for discovery engines in SWS environments that exploits structural knowledge and previous discovery results for reducing the search space of consequent discovery operations. Our prototype implementation shows significant improvements when applied to the Stanford SWS Challenge scenario and dataset.", "label" : "A Caching Mechanism for Semantic Web Service Discovery", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "65", "author" : [ "Paolo Besana", "David Robertson" ], "type" : "Paper", "subject" : [ "Ontology matching and integration", "Semantics in peer to peer systems and grids" ], "abstract" : "In open and distributed environments ontology mapping provides interoperability between interacting actors. However, conventional mapping systems focus on acquiring static information, and on mapping whole ontologies, which is infeasible in open systems. This paper shows that the interactions themselves between the actors can be used to predict mappings, simplifying dynamic ontology mapping. The intuitive idea is that similar interactions follow similar conventions and patterns, which can be analysed. The computed model can be used to suggest the possible mappings for the exchanged messages in new interactions. The suggestions can be evaluate by any standard ontology matcher: if they are accurate, the matchers avoid evaluating mappings unrelated to the interaction. The minimal requirement in order to use this system is that it is possible to describe and identify the interaction sequences: the OpenKnowledge project has produced an implementation that demonstrates this is possible in a fully peer to peer environment.", "label" : "How Service Choreography Statistics Reduce the Ontology Mapping Problem", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "237", "author" : [ "Aditya Kalyanpur", "Bijan Parsia", "Matthew Horridge", "Evren Sirin" ], "type" : "Paper", "subject" : [ "User interaction", "Agents and Services for the Semantic Web" ], "abstract" : "Finding the justifications of an entailment (that is, all the minimal set of axioms sufficient to produce an entailment) has emerged as a key inference service for the Web Ontology Language (OWL). Justifications are essential for debugging unsatisfiable classes and contradictions. The availability of justifications as explanations of entailments improves the understandability of large and complex ontologies. In this paper, we present several algorithms for computing all the justifications of an entailment in an OWL DL Ontology and show, by an empirical evaluation, that even a reasoner independent approach works well on real ontologies.", "label" : "Finding all Justifications of OWL DL Entailments", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "203", "author" : [ "Marta Sabou", "Jorge Gracia", "Sofia Angeletou", "Mathieu D\'Aquin", "Enrico Motta" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Evaluation of Semantic Web technologies" ], "abstract" : "The increased availability of online knowledge has led to the design of several algorithms that solve a variety of tasks by harvesting the Semantic Web, i.e., by dynamically selecting and exploring a multitude of online ontologies. Our hypothesis is that the performance of such novel algorithms implicitly provides an insight into the quality of the used ontologies and thus opens the way to a task based evaluation of the Semantic Web. We have investigated this hypothesis by studying the lessons learnt about online ontologies when used to solve three tasks: ontology matching, folksonomy enrichment, and word sense disambiguation. Our analysis leads to a suit of conclusions about the status of the Semantic Web, which highlight a number of strengths and weaknesses of the semantic information available online and complement the findings of other analysis of the Semantic Web landscape.", "label" : "Evaluating the Semantic Web:A Task based Approach", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "264", "author" : [ "Christian Morbidoni", "Giovanni Tummarello", "Orri Erling", "Reto Bachmann-Gm\u00FCr" ], "type" : "Paper", "subject" : [ "Information integration", "Management of the Semantic Web data" ], "abstract" : "In this paper we describe RDFSync, a methodology for efficient synchronization and merging of RDF models. RDFSync is based on decomposing a model into Minimum Self Contained graphs (MSGs). After illustrating theory and deriving properties of MSGs, we show how a RDF model can be represented by a list of hashes of such information fragments. The synchronization procedure here described is based on the evaluation and remote comparison of these ordered lists. Experimental results show that the algorithm provides very significant savings on network traffic compared to the file oriented synchronization of serialized RDF graphs. Finally, we provide the design and report the implementation of a protocol for executing the RDFSync algorithm over HTTP.", "label" : "RDFSync: efficient remote synchronization of RDF models", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "173", "author" : [ "Thanh Tran", "Peter Haase", "Holger Lewen", "\u00D3scar Mu\u00F1oz-Garc\u00EDa", "Asuncion Gomez-Perez", "Rudi Studer" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Ontology engineering", "Management of the Semantic Web data" ], "abstract" : "Ontology-based applications play an increasingly important role in the public and corporate Semantic Web. While today there exist a range of tools and technologies to support specific ontology engineering and management activities, architectural design guidelines for building ontology-based applications are missing. In this paper, we present an architecture for ontology-based application—covering the complete ontology-lifecycle—that is intended to support software engineers in designing and developing ontology-based applications. We illustrate the use of the architecture in a concrete case study using the NeOn toolkit as one implementation of the architecture.", "label" : "Lifecycle Support in Architectures for Ontology Based Information Systems", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "214", "author" : [ "Julian Dolby", "James Fan", "Achille Fokoue", "Aditya Kalyanpur", "Aaron Kershenbaum", "Li Ma", "William Murdock", "Kavitha Srinivas", "Christopher Welty" ], "type" : "Paper", "subject" : "Applications of the Semantic Web technologies", "abstract" : "The approach of using ontology reasoning to cleanse the output of information extraction tools was first articulated in SemantiClean. A limiting factor in applying this approach has been that ontology reasoning to find inconsistencies does not scale to the size of data produced by information extraction tools. In this paper, we describe techniques to scale inconsistency detection, and illustrate the use of our techniques to produce a consistent subset of a knowledge base with several thousand inconsistencies.", "label" : "Scalable Cleanup of Information Extraction Data Using Ontologies", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "186", "author" : [ "Jos De Bruijn", "Stijn Heymans" ], "type" : "Paper", "subject" : [ "Formal languages and reasoning", "Database technologies for the Semantic Web" ], "abstract" : "An important open question in the semantic Web is the precise relationship between the RDF(S) semantics and the semantics of standard knowledge representation formalisms such as logic programming and description logics. In this paper we address this issue by considering embeddings of RDF and RDFS in logic. Using these embeddings, combined with existing results about various fragments of logic, we establish several novel complexity results. The embeddings we consider show how techniques from deductive databases and description logics can be used for reasoning with RDF(S). Finally, we consider querying RDF graphs and establish the data complexity of conjunctive querying for the various RDF entailment regimes.", "label" : "Logical Foundations of (e)RDF(S): Complexity and Reasoning", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "274", "author" : [ "David Martin", "Massimo Paolucci", "Matthias Wagner" ], "type" : "Paper", "subject" : [ "None of the above", "Agents and Services for the Semantic Web" ], "abstract" : "Recently, the World Wide Web Consortium (W3C) produced a standard set of \u201CSemantic Annotations for WSDL and XML Schema\u201D (SAWSDL). SAWSDL provides a standard means by which WSDL documents can be related to semantic descriptions, such as those provided by OWL S (OWL for Services) and other Semantic Web services frameworks. We argue that the value of SAWSDL cannot be realized until its use is specified, and its benefits explained, in connection with a particular framework. This paper is an important first step toward meeting that need, with respect to OWL S. We explain what OWL S constructs are appropriate for use with the various SAWSDL annotations, and provide a rationale and guidelines for their use. In addition, we discuss some weaknesses of SAWSDL, and identify some ways in which OWL S could evolve so as to integrate more smoothly with SAWSDL.", "label" : "Bringing Semantic Annotations to Web Services: OWL S from the SAWSDL Perspective", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "19", "author" : [ "Christoph Kiefer", "Abraham Bernstein", "Markus Stocker" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Information integration", "Ontology matching and integration", "Ontology creation, search, extraction and evolution", "Management of the Semantic Web data" ], "abstract" : "This research explores three SPARQL-based techniques to solve Semantic Web tasks that often require similarity measures, such as semantic data integration, ontology mapping, and Semantic Web service matchmaking. Our aim is to see how far it is possible to integrate customized similarity functions (CSF) into SPARQL to achieve good results for these tasks. Our first approach exploits virtual triples calling property functions to establish virtual relations among resources under comparison; the second approach uses extension functions to filter out resources that do not meet the requested similarity criteria; finally, our third technique applies new solution modifiers to post-process a SPARQL solution sequence. The semantics of the three approaches are formally elaborated and discussed. We close the paper with a demonstration of the usefulness of our iSPARQL framework in the context of a data integration and an ontology mapping experiment.", "label" : "The Fundamentals of iSPARQL - A Virtual Triple Approach For Similarity Based Semantic Web Tasks", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "73", "author" : [ "Stephan Bloehdorn", "York Sure" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Management of the Semantic Web data" ], "abstract" : "The amount of ontologies and meta data available on the Web is constantly growing. The successful application of machine learning techniques for learning of ontologies from textual data, i.e. mining for the Semantic Web, contributes to this trend. However, no principal approaches exist so far for mining from the Semantic Web. We investigate how machine learning algorithms can be made amenable for directly taking advantage of the rich knowledge expressed in ontologies and associated instance data. Kernel methods have been successfully employed in various learning tasks and provide a clean framework for interfacing between non-vectorial data and machine learning algorithms. In this spirit, we express the problem of mining instances in ontologies as the problem of defining valid corresponding kernels. We present a principled framework for designing such kernels by means of decomposing the kernel computation into specialized kernels for selected characteristics of an ontology which can be flexibly assembled and tuned. Initial experiments on real world Semantic Web data enjoy promising results and show the usefulness of our approach.", "label" : "Kernel Methods for Mining Instance Data in Ontologies", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "202", "author" : [ "Christine Golbreich", "Matthew Horridge", "Ian Horrocks", "Boris Motik", "Rob Shearer" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Semantic Web for Life Sciences" ], "abstract" : "OBO is an ontology language that has often been used for modeling ontologies in the life sciences. Its definition is relatively informal, so, in this paper, we provide a clear specification for OBO syntax and semantics via a mapping to OWL. This mapping also allows us to apply existing Semantic Web tools and techniques to OBO. We show that Semantic Web reasoners can be used to efficiently reason with OBO ontologies. Furthermore, we show that grounding the OBO language in formal semantics is useful for the ontology development process: using an OWL reasoner, we detected a likely modeling error in one OBO ontology.", "label" : "OBO and OWL: Leveraging Semantic Web Technologies for the Life Sciences", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "255", "author" : [ "Hyun Namgoong", "Hong-Gee Kim" ], "type" : "Paper", "subject" : [ "Natural language technologies and information extraction", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "In recent years, CNL (Controlled Natural Language) has received much attention with regard to ontology-based knowledge acquisition systems. CNLs, as subsets of natural languages, can be useful for both humans and computers by eliminating ambiguity of natural languages. Our previous work, OntoPath [10], proposed to edit natural language-like narratives that are structured in RDF (Resource Description Framework) triples, using a domain-specific ontology as their language constituents. However, our previous work and other systems employing CFG for grammar definition have difficulties in enlarging the expression capacity. A newly developed editor, which we propose in this paper, permits grammar definitions through CFG-LD (Context-Free Grammar with Lexical Dependency) that includes sequential and semantic structures of the grammars. With CFG describing the sequential structure of grammar, lexical dependencies between sentence elements can be designated in the definition system. Through the defined grammars, the implemented editor guides users’ narratives in more familiar expressions with a domain-specific ontology and translates the content into RDF triples.", "label" : "Ontology based Controlled Natural Language Editor Using CFG with Lexical Dependency", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "269", "author" : [ "Jose Luis Ambite", "Dipsy Kappor" ], "type" : "Paper", "subject" : [ "Information integration", "Agents and Services for the Semantic Web" ], "abstract" : "Many scientific problems can be represented as computational workflows of operations that access remote data, integrate heterogeneous data, and analyze and derive new data. Even when the data access and processing operations are implemented as web or grid services, workflows are often constructed {\\em manually} in languages such as BPEL. Adding semantic descriptions of the services enables automatic or mixed initiative composition. In most previous work, these descriptions consists of semantic types for inputs and outputs of services or a type for the service as a whole. While this is certainly useful, we argue that is not enough to model and construct complex data workflows. We present a planning approach to {\\em automatically} constructing data processing workflows where the inputs and outputs of services are {\\em relational} descriptions in an expressive logic. Our workflow planner uses relational subsumption to connect the output of a service with the input of another. This modeling style has the advantage that adaptor services, so called {\\em shims}, can be {\\em automatically} inserted into the workflow where necessary.", "label" : "Automatically Composing Data Workflows with Relational Descriptions and Shim Services", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "134", "author" : [ "Yuting Zhao", "Kewen Wang", "Rodney Topor", "Jeff Pan", "Fausto Giunchiglia" ], "type" : "Paper", "subject" : [ "Ontology matching and integration", "Agents and Services for the Semantic Web" ], "abstract" : "
Several proposals have been put forward to support distributed agent cooperation in the Semantic Web, by allowing concepts and roles in one ontology be reused in another ontology. In general, these proposals reduce the autonomy of each ontology by defining the semantics of the ontology to depend on the semantics of the other ontologies.
We propose a new framework for managing autonomy in a set of cooperating ontologies (or ontology space). In this framework, each language entity (concept/role/individual) in an ontology may have its meaning assigned either locally with respect to the semantics of its own ontology, to preserve the autonomy of the ontology, or globally with respect to the semantics of any neighbouring ontology in which it is defined, thus enabling semantic cooperation between multiple ontologies.
In this way, each ontology has a \"subjective semantics\" based on local interpretation and a \"foreign semantics\" based on semantic binding to neighbouring ontologies. We study the properties of these two semantics and describe the conditions under which entailment and satisfiability are preserved. We also introduce two reasoning mechanisms under this framework: \"cautious reasoning\" and \"brave reasoning\". Cautious reasoning is done with respect to a local ontology and its neighbours (those ontologies in which its entities are defined); brave reasoning is done with respect to the transitive closure of this relationship. This framework is independent of ontology languages. As a case study, for Description Logic ALCN we present two tableau-based algorithms for performing each form of reasonings and prove their correctness.
", "label" : "Semantic Cooperation and Knowledge Reuse by Using Autonomous Ontologies", "student-paper" : "No" }, { "track" : "Research track", "paper-id" : "248", "author" : [ "Andreas Harth", "Juergen Umbrich", "Aidan Hogan", "Stefan Decker" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Information integration", "Agents and Services for the Semantic Web", "Semantics in peer to peer systems and grids", "Database technologies for the Semantic Web", "Management of the Semantic Web data" ], "abstract" : "We present the architecture of an end to end semantic search engine that uses a graph data model to enable interactive query answering over structured and interlinked data collected from many disparate sources on the Web. In particular, we study distributed indexing methods for graph structured data and parallel query evaluation methods on a cluster of computers. We evaluate the system on a dataset with 430 million statements collected from the Web, and provide scale up experiments on 7 billion synthetically generated statements.", "label" : "YARS2: A Federated Repository for Querying Graph Structured Data from the Web", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "272", "author" : [ "Mianwei Zhou", "Shenghua Bao", "Xian Wu", "Yong Yu" ], "type" : "Paper", "subject" : [ "Social networks and processes on the Semantic Web", "Ontology creation, search, extraction and evolution", "Management of the Semantic Web data", "Semantic Web content creation, annotation, and extraction" ], "abstract" : "This paper deals with the problem of exploring hierarchical semantics from social annotations. Recently, social annotation services have become more and more popular in Semantic Web. It allows users to arbitrarily annotate web resources, thus, largely lowers the barrier to cooperation. Furthermore, through providing abundant meta-data resources, social annotation might become a key to the development of Semantic Web. However, on the other hand, social annotation has its own apparent limitations, for instance, 1) ambiguity and synonym phenomena and 2) lack of hierarchical information. In this paper, we propose an unsupervised model to automatically derive hierarchical semantics from social annotations. Using a social bookmark service Del.icio.us as example, we demonstrate that the derived hierarchical semantics has the ability to compensate those shortcomings. We further apply our model on another data set from Flickr to testify our model's applicability on different environments. The experimental results demonstrate our model's effciency.", "label" : "An Unsupervised Model for Exploring Hierarchical Semantics from Social Annotations", "student-paper" : "Yes" }, { "track" : "Research track", "paper-id" : "87", "author" : [ "Qi Zhou", "Chong Wang", "Miao Xiong", "Haofen Wang", "Yong Yu" ], "type" : "Paper", "subject" : [ "Applications of the Semantic Web technologies", "Ontology creation, search, extraction and evolution" ], "abstract" : "Semantic search promises to provide more accurate result than present-day keyword search. However, progress with semantic search has been delayed due to the complexity of its query languages. In this paper, we explore a novel approach of adapting keywords to querying the semantic web: the approach automatically translates keyword queries into formal logic queries so that end users can use familiar keywords to perform semantic search. A prototype system named ‘SPARK’ has been implemented in light of this approach. Given a keyword query, SPARK outputs a ranked list of SPARQL queries as the translation result. The translation in SPARK consists of three major steps: term mapping, query graph construction and query ranking. Specifically, a probabilistic query ranking model is proposed to select the most likely SPARQL query. In the experiment, SPARK achieved an encouraging translation result.", "label" : "SPARK: Adapting Keyword Query to Semantic Search", "student-paper" : "Yes" }, { "label" : "Grit Denker", "email" : "Grit.Denker@sri.com", "type" : "Person", "affiliation" : "SRI International" }, { "label" : "Valentina Ceausu", "email" : "ceausu@math-info.univ-paris5.fr", "type" : "Person", "affiliation" : "Paris V University" }, { "label" : "Alfio Gliozzo", "email" : "gliozzo@gmail.com", "type" : "Person", "affiliation" : "CNR-ISTC" }, { "label" : "John Darlington", "email" : "jd@ecs.soton.ac.uk", "type" : "Person" }, { "label" : "Dave Kolas", "email" : "dkolas@bbn.com", "type" : "Person", "affiliation" : "BBN Technologies" }, { "label" : "Xiongzhi Zhou", "email" : "zhouxiongzhi@taikanglife.com", "type" : "Person", "affiliation" : "Taikang Life Insurance Company" }, { "label" : "Yang Yang", "email" : "yangyy@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Chintan Patel", "email" : "chintan.patel@dbmi.columbia.edu", "type" : "Person", "affiliation" : "Columbia University Medical Center" }, { "label" : "Tom Heath", "email" : "t.heath@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "David Martin", "email" : "martin@ai.sri.com", "type" : "Person", "affiliation" : "SRI International" }, { "label" : "James Ressler", "email" : "james.ressler@ngc.com", "type" : "Person", "affiliation" : "Northrop Grumman" }, { "label" : "Edward Benson", "email" : "ebenson@bbn.com", "type" : "Person", "affiliation" : "BBN Technologies" }, { "label" : "Carol Tullo", "email" : "carol.tullo@opsi.x.gsi.gov.uk", "type" : "Person" }, { "label" : "Chris Bizer", "email" : "chris@bizer.de", "type" : "Person", "affiliation" : "Freie Universit\u00E4t Berlin" }, { "label" : "Osma Suominen", "email" : "osma.suominen@tkk.fi", "type" : "Person", "affiliation" : "Helsinki University of Technology TKK, Finland" }, { "label" : "Reginald Ford", "email" : "reginald.ford@sri.com", "type" : "Person", "affiliation" : "SRI International" }, { "label" : "Chuck Morris", "email" : "chuck.morris@ngc.com", "type" : "Person", "affiliation" : "Northrop Grumman" }, { "label" : "Jens Lehmann", "email" : "lehmann@informatik.uni-leipzig.de", "type" : "Person", "affiliation" : "Universit\u00E4t Leipzig" }, { "label" : "Guotong Xie", "email" : "xieguot@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Kavitha Srinivas", "email" : "ksrinivs@us.ibm.com", "type" : "Person" }, { "label" : "Troy Self", "email" : "tself@bbn.com", "type" : "Person", "affiliation" : "BBN Technologies" }, { "label" : "John Domingue", "email" : "J.B.Domingue@open.ac.uk", "type" : "Person", "affiliation" : "KMi, The Open University, UK" }, { "label" : "Richard Cyganiak", "email" : "richard@cyganiak.de", "type" : "Person", "affiliation" : "Freie Universit\u00E4t Berlin" }, { "label" : "Mark Johnson", "email" : "mark.johnson@sri.com", "type" : "Person", "affiliation" : "SRI International" }, { "label" : "James Cimino", "email" : "ciminoj@dbmi.columbia.edu", "type" : "Person", "affiliation" : "Columbia University Medical Center" }, { "label" : "Aldo Gangemi", "email" : "aldo.gangemi@istc.cnr.it", "type" : "Person", "affiliation" : "CNR-ISTC" }, { "label" : "David Dupplaw", "email" : "dpd@ecs.soton.ac.uk", "type" : "Person" }, { "label" : "Knud M\u00F6ller", "email" : "knud.moeller@deri.org", "type" : "Person", "affiliation" : "DERI, NUI Galway" }, { "label" : "Kim Viljanen", "email" : "kim.viljanen@tkk.fi", "type" : "Person", "affiliation" : "Helsinki University of Technology TKK, Finland" }, { "label" : "Nigel Shadbolt", "email" : "nrs@ecs.soton.ac.uk", "type" : "Person", "affiliation" : "University of Southampton" }, { "label" : "Sylvie Despr\u00E8s", "email" : "sd@math-info.univ-paris5.fr", "type" : "Person", "affiliation" : "Paris V University" }, { "label" : "Diana Maynard", "email" : "diana@dcs.shef.ac.uk", "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Shengping Liu", "email" : "liusp@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "Valentina Presutti", "email" : "valentina.presutti@istc.cnr.it", "type" : "Person", "affiliation" : "CNR-ISTC" }, { "label" : "Horacio Saggion", "email" : "saggion@dcs.shef.ac.uk", "type" : "Person", "affiliation" : "University of Sheffield, UK" }, { "label" : "Eero Hyvnen", "email" : "eero.hyvonen@tkk.fi", "type" : "Person", "affiliation" : "Helsinki University of Technology TKK, Finland" }, { "label" : "Zhaoming Qiu", "email" : "qiuzhaom@cn.ibm.com", "type" : "Person", "affiliation" : "IBM China Research Laboratory" }, { "label" : "S\u00F6ren Auer", "email" : "auer@seas.upenn.edu", "type" : "Person", "affiliation" : "University of Pennsylvania" }, { "label" : "Georgi Kobilarov", "email" : "gkob@gmx.de", "type" : "Person", "affiliation" : "Freie Universit\u00E4t Berlin" }, { "label" : "Edith Schonberg", "email" : "ediths@us.ibm.com", "type" : "Person", "affiliation" : "IBM Watson Research Center" }, { "label" : "John Sheridan", "email" : "john.sheridan@opsi.x.gsi.gov.uk", "type" : "Person" }, { "label" : "Mike Dean", "email" : "mdean@bbn.com", "type" : "Person", "affiliation" : "BBN Technologies" }, { "label" : "Daniel Elenius", "email" : "elenius@csl.sri.com", "type" : "Person", "affiliation" : "SRI International" }, { "label" : "Kieron O\'Hara", "email" : "kmo@ecs.soton.ac.uk", "type" : "Person" }, { "label" : "Harith Alani", "email" : "ha@ecs.soton.ac.uk", "type" : "Person", "affiliation" : "University of Southampton" }, { "label" : "Zachary Ives", "email" : "zives@cis.upenn.edu", "type" : "Person", "affiliation" : "University of Pennsylvania" }, { "label" : "Eric Dorner", "email" : "eric.dorner@ngc.com", "type" : "Person", "affiliation" : "Northrop Grumman" }, { "track" : "Semantic Web in Use track", "paper-id" : "253", "author" : [ "Aldo Gangemi", "Alfio Gliozzo", "Valentina Presutti" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Framework", "Ontology", "Industry: Public Sector" ], "abstract" : "This paper introduces a framework to add a semantic web layer to legacy organizational information, and describes its application to the use case provided by the Italian National Research Council (CNR) intraweb. \nBuilding on a traditional web-based view of information from different legacy databases, we have performed a semantic porting of data into a knowledge base, dependent on an OWL domain ontology. We have enriched the knowledge base by means of text mining techniques, in order to discover on-topic relations. Several reasoning techniques have been applied, in order to infer relevant implicit relationships. \nFinally, the ontology and the knowledge base have been deployed on a semantic wiki by means of the WikiFactory tool, which allows users to browse the ontology and the knowledge base, to introduce new relations, to revise wrong assertions in a collaborative way, and to perform semantic queries. \nIn our experiments, we have been able to easily implement several functionalities, such as expert finding, by simply formulating ad-hoc queries from either an ontology editor or the semantic wiki interface. The result is an intelligent and collaborative front end, which allow users to add information, fill gaps, or revise existing information on a semantic basis, while keeping the knowledge base automatically updated.", "label" : "A Collaborative Semantic Web Layer to Enhance Legacy Systems" }, { "track" : "Semantic Web in Use track", "paper-id" : "232", "author" : [ "Daniel Elenius", "Mark Johnson", "Reginald Ford", "Grit Denker", "David Martin" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Problem Statement", "Ontology" ], "abstract" : "We describe a novel approach by which software can assess the ability of a confederation of heterogeneous systems to interoperate to achieve a given purpose. The approach uses ontologies and knowledge bases (KBs) to capture the salient characteristics of systems, on the one hand, and of tasks for which these systems will be employed, \non the other. Rules are used to represent the conditions under which \nthe capabilities provided by systems can ful\uFB01ll the capabilities needed to \nsupport the roles and interactions that make up each task. An Analyzer \ncomponent employs these KBs and rules to determine if a given con- \nfederation will be adequate, to generate suitable confederations from a collection of available systems, to pre-diagnose potential interoperability problems that might arise, and to suggest system con\uFB01guration options that will help to make interoperability possible. We have demonstrated the feasibility of this approach using a prototype Analyzer and KBs. \n \nNote: Approval of this paper by the Government client is pending. If \napproval is not forthcoming, it must be withdrawn.", "label" : "Purpose-Aware Reasoning about Interoperability of Heterogeneous Training Systems" }, { "track" : "Semantic Web in Use track", "paper-id" : "222", "author" : [ "S\u00F6ren Auer", "Chris Bizer", "Jens Lehmann", "Georgi Kobilarov", "Richard Cyganiak", "Zachary Ives" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Framework", "Ontology" ], "abstract" : "DBpedia is a community effort to extract structured information from Wikipedia and to make this information available on the Web. DBpedia allows you to ask sophisticated queries against datasets derived from Wikipedia and to link other datasets on the Web to Wikipedia data. We describe the extraction of the DBpedia datasets, and how the resulting information can be made available on the Web for humans and machines. We describe some emerging applications from the DBpedia community and show how website operators can reduce costs by facilitating royalty-free DBpedia content within their sites. Finally, we present the current status of interlinking DBpedia with other open datasets on the Web and outline how DBpedia could serve as a nucleus for an emerging Web of open data sources.", "label" : "DBpedia: A Nucleus for a Web of Open Data" }, { "track" : "Semantic Web in Use track", "paper-id" : "195", "author" : [ "Kavitha Srinivas", "Chintan Patel", "James Cimino", "Li Ma", "Julian Dolby", "Achille Fokoue", "Aditya Kalyanpur", "Aaron Kershenbaum", "Edith Schonberg" ], "type" : "Paper", "subject" : [ "Ontology", "Industry: Pharmaceuticals / Health" ], "abstract" : "This paper describes a large case study that explores the applicability of ontology reasoning to problems in the medical domain. We investigate whether it is possible to use such reasoning to automate common clinical tasks that are currently labor intensive and error prone, and focus our case study on improving cohort selection for clinical trials. An obstacle to automating such clinical tasks is the need to bridge the semantic gulf between raw patient data, such as laboratory tests or specific medications, and the way a clinician interprets this data. Our key insight is that matching patients to clinical trials can be formulated as a problem of semantic retrieval. We describe the technical challenges to building a realistic case study, which include problems related to scalability, the integration of large ontologies, and dealing with noisy, inconsistent data. Our solution is based on the SNOMED CT ontology, and scales to one year of patient records (approx. 240,000 patients).", "label" : "Matching Patient Records to Clinical Trials Using Ontologies" }, { "track" : "Semantic Web in Use track", "paper-id" : "188", "author" : [ "Harith Alani", "David Dupplaw", "John Sheridan", "Kieron O\'Hara", "John Darlington", "Nigel Shadbolt", "Carol Tullo" ], "type" : "Paper", "subject" : [ "None of the above", "Industry: Public Sector" ], "abstract" : "Governments often hold very rich data and whilst much of this information is published and available for re-use by others, it is often trapped by poor data structures, locked up in legacy data formats or in fragmented databases. One of the great benefits that Semantic Web (SW) technology offers is facilitating the large scale integration and sharing of distributed data sources. At the heart of information policy in the UK, the Office of Public Sector Information (OPSI) is the part of the UK government charged with enabling the greater re-use of public sector information. This paper described the actions, findings, and lessons learnt from a pilot study, involving several parts of government and the public \nsector. The aim was to show to government how they can adopt SW \ntechnology for the dissemination, sharing and use of its data.", "label" : "Unlocking the Potential of Public Sector Information with Semantic Web Technology" }, { "track" : "Semantic Web in Use track", "paper-id" : "165", "author" : [ "Dave Kolas", "Troy Self" ], "type" : "Paper", "subject" : [ "Framework", "Industry: Other" ], "abstract" : "As an increasing number of applications on the web contain some elements of spatial data, there is a need to efficiently integrate Semantic Web technologies and spatial data processing. This paper describes a prototype system for storing spatial data and Semantic Web data together in a SPatially-AUgmented Knowledgebase (SPAUK) without sacrificing query efficiency. The goals are motivated through use several use cases. The prototype\u2019s design and architec-ture are described, and resulting performance improvements are discussed.", "label" : "Spatially Augmented Knowledgebase" }, { "track" : "Semantic Web in Use track", "paper-id" : "89", "author" : [ "James Ressler", "Mike Dean", "Edward Benson", "Eric Dorner", "Chuck Morris" ], "type" : "Paper", "subject" : [ "Application", "Ontology" ], "abstract" : "An ontology provides a precise specification of the vocabulary used by a community of interest (COI). Multiple communities of interest may describe the same concept using the same or different terms. When such communities interact, ontology alignment and translation is required. This is typically a time consuming process. This paper describes Snoggle, an open source tool designed to ease development of ontology translation rules, and discusses its application to geospatial ontologies.", "label" : "Application of Ontology Translation" }, { "track" : "Semantic Web in Use track", "paper-id" : "81", "author" : [ "Valentina Ceausu", "Sylvie Despr\u00E8s" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Framework", "Ontology", "Industry: Transport / Logistics" ], "abstract" : "This paper presents a semantic case-based reasoning framework for text categorization. Text categorization is the task of classifying text documents under predened categories. \n Accidentology is our application eld and the goal of our framework \nis to classify documents describing real road accidents under predened \nroad accident prototpypes, which also are described by text documents. \nAccidents are described by accident reports while accident prototypes \nare described by accident scenarios. Thus, text categorization is done by \nassigning each accident report to an accident scenario, which highlights \nparticular mechanisms leading to accident. \n We propose a textual case based reasoning approach (TCBR), which \nallows us to integrate both textual and domain knowledge aspects in \norder to carry out this categorization. CBR solves a new problem (target case) by identifying its similarity to one or several previously solved problems (source cases) stored in a case base and by adapting their known solutions. Cases of our framework are created from text. Most of TCBR applications create cases from text by using Information Retrieval techniques, which leads to knowledge-poor descriptions of cases. \nWe show that using semantic resources (two ontology of accidentology) \nmakes possible to overcome this diculty, and allows us to enrich cases by using formal knowledge. \n In this paper, we argue that semantic resources are likely to improve the quality of cases created from text, and, therefore, such resources can support the reasoning cycle. We illustrate this claim with our framework developed to classify documents in the accidentology domain.", "label" : "A semantic case-based reasoning framework for text categorization" }, { "track" : "Semantic Web in Use track", "paper-id" : "228", "author" : [ "Knud M\u00F6ller", "Tom Heath", "Siegfried Handschuh", "John Domingue" ], "type" : "Paper", "subject" : [ "Application", "Ontology" ], "abstract" : "Semantic Web conferences such as ESWC and ISWC offer prime opportunities to test and showcase semantic technologies. Conference metadata about people, papers and talks is diverse in nature and neither too small to be uninteresting or too big to be unmanageable. Many metadata-related challenges that may arise in the Semantic Web at large are also present here. Metadata must be generated from sources which are often unstructured and hard to process, and may originate from many different players, therefore suitable workflows must be established. Moreover, the generated metadata must use appropriate formats and vocabularies, and be served in a way that is consistent with the principles of linked data. This paper reports on the metadata efforts from ESWC and ISWC, identifies specific issues and barriers encountered during the projects, and discusses how these were approached. Recommendations are made as to how these may be addressed in the future, and we discuss how these solutions may generalize to metadata production for the Semantic Web at large.", "label" : "Recipes for Semantic Web Dog Food - The ESWC and ISWC Metadata Projects" }, { "track" : "Semantic Web in Use track", "paper-id" : "158", "author" : [ "Guotong Xie", "Yang Yang", "Shengping Liu", "Zhaoming Qiu", "Yue Pan", "Xiongzhi Zhou" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Ontology", "Industry: Banking / Finance" ], "abstract" : "Data warehouse is now widely used in business analysis and decision making processes. To adapt the rapidly changing business environment, we develop a tool to make data warehouses more business-friendly by using Semantic Web technologies. The main idea is to make business semantics explicit by uniformly representing the business metadata (i.e. conceptual enterprise data model and multidimensional model) with an extended OWL language. Then a mapping from the business metadata to the schema of the data warehouse is built. When an analysis request is raised, a customized data mart with data populated from the data warehouse can be automatically generated with the help of this built-in knowledge. This tool, called Enterprise Information Asset Workbench (EIAW), is deployed at the Taikang Life Insurance Company, one of the top five insurance companies of China. User feedback shows that OWL provides an excellent basis for the representation of business semantics in data warehouse, but many necessary extensions are also needed in the real application. The user also deemed this tool very helpful because of its flexibility and speeding up data mart deployment in face of business changes.", "label" : "EIAW: Towards a Business-friendly Data Warehouse Using Semantic Web Technologies" }, { "track" : "Semantic Web in Use track", "paper-id" : "217", "author" : [ "Horacio Saggion", "Kalina Bontcheva", "Adam Funk", "Diana Maynard" ], "type" : "Paper", "subject" : [ "Application", "Tool", "Ontology", "Industry: Banking / Finance" ], "abstract" : "Business Intelligence (BI) requires the acquisition and aggregation of \nkey pieces of knowledge from multiple sources in order to provide \nvaluable information to customers or feed statistical BI models and tools. \n The massive amount of information available \nto business analysts makes information extraction and other natural \nlanguage processing tools key enablers \nfor the acquisition and use of that semantic information. \nWe describe the application of \nontology-based extraction and merging in the context of a \npractical e-business application for the EU \nMUSING Project where the goal is to gather international company intelligence and country/region information. \nThe results of our experiments so far are very promising and we are now in the process of bulding a complete end-to-end solution.", "label" : "Ontology-based Information Extraction for Business Applications" }, { "track" : "Semantic Web in Use track", "paper-id" : "35", "author" : [ "Eero Hyvnen", "Kim Viljanen", "Osma Suominen" ], "type" : "Paper", "subject" : [ "Application", "Framework", "Ontology", "Industry: Public Sector" ], "abstract" : "This paper shows how semantic web techniques can be applied to solving problems of distributed content creation, discovery, linking, aggregation, and reuse in health information portals, both from end-user\u2019s and content publishers\u2019s viewpoints. As a case study, the national semantic health portal HEALTHFINLAND is presented. It provides citizens with intelligent searching and browsing services to reliable and up-to-date health information created by various health organizations in Finland. The system is based on a shared semantic metadata schema, ontologies, and mash-up ontology services. The content includes metadata of thousands of web documents such as web pages, articles, reports, campaign information, news, services, and other information related to health.", "label" : "HealthFinland - Finnish Health Information on the SemanticWeb" } ], "types" : { "Person" : { pluralLabel: "People" }, "Paper" : { pluralLabel: "Papers" } }, "properties" : { "author" : { "valueType" : "item" } } }