Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Issue title: Question answering over Linked Data
Guest editors: Christina Unger, Axel-Cyrille Ngonga Ngomo, Philipp Cimiano, Sören Auer and George Paliouras
Article type: Research Article
Authors: Cabrio, Elenaa; * | Villata, Serenaa | Palmero Aprosio, Alessiob
Affiliations: [a] Université Côte d’Azur, CNRS, Inria, I3S, France. E-mails: elena.cabrio@unice.fr, villata@i3s.unice.fr | [b] Fondazione Bruno Kessler, Via Sommarive, 18, 38123 Povo (TN), Italy. E-mail: aprosio@fbk.eu
Correspondence: [*] Corresponding author. E-mail: elena.cabrio@unice.fr.
Note: [1] This paper is an extended version of the paper “Argumentation-based Inconsistencies Detection for Question-Answering over DBpedia” published at the Workshop NL& DBpedia-2013 and of the extended abstracts titled “Reconciling Information in DBpedia through a Question Answering System” and “Hunting for Inconsistencies in Multilingual DBpedia with QAKiS” published at the Posters & Demonstrations Tracks of ISWC-2013 and of ISWC-2014, respectively. The improvements of the present paper with respect to the previous versions are detailed in the Related Work section.
Abstract: In the latest years, more and more structured data is published on the Web and the need to support typical Web users to access this body of information has become of crucial importance. Question Answering systems over Linked Data try to address this need by allowing users to query Linked Data using natural language. These systems may query at the same time different heterogenous interlinked datasets, that may provide different results for the same query. The obtained results can be related by a wide range of heterogenous relations, e.g., one can be the specification of the other, an acronym of the other, etc. In other cases, such results can contain an inconsistent set of information about the same topic. A well known example of such heterogenous interlinked datasets are language-specific DBpedia chapters, where the same information may be reported in different languages. Given the growing importance of multilingualism in the Semantic Web community, and in Question Answering over Linked Data in particular, we choose to apply information reconciliation to this scenario. In this paper, we address the issue of reconciling information obtained by querying the SPARQL endpoints of language-specific DBpedia chapters. Starting from a categorization of the possible relations among the resulting instances, we provide a framework to: (i) classify such relations, (ii) reconcile information using argumentation theory, (iii) rank the alternative results depending on the confidence of the source in case of inconsistencies, and (iv) explain the reasons underlying the proposed ranking. We release the resource obtained applying our framework to a set of language-specific DBpedia chapters, and we integrate such framework in the Question Answering system QAKiS, that exploits such chapters as RDF datasets to be queried using a natural language interface.
Keywords: Question Answering over Linked Data, information reconciliation, language-specific DBpedia chapters, answers justification, argumentation theory
DOI: 10.3233/SW-160245
Journal: Semantic Web, vol. 8, no. 4, pp. 601-617, 2017
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
sales@iospress.com
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
info@iospress.nl
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office info@iospress.nl
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
china@iospress.cn
For editorial issues, like the status of your submitted paper or proposals, write to editorial@iospress.nl
如果您在出版方面需要帮助或有任何建, 件至: editorial@iospress.nl