Journal of Web Semantics最新文献_第6页

SemanticHadith: An ontology-driven knowledge graph for the hadith corpus semantic chadith:一个本体驱动的圣训语料库知识图

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-06-01 DOI: 10.1016/j.websem.2023.100797

Amna Binte Kamran, Bushra Abro, A. Basharat

引用次数: 0

Solving the SPARQL query containment problem with SpeCS 使用spec解决SPARQL查询包含问题

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2022.100770

Mirko Spasić , Milena Vujošević Janičić

{"title":"Solving the SPARQL query containment problem with SpeCS","authors":"Mirko Spasić , Milena Vujošević Janičić","doi":"10.1016/j.websem.2022.100770","DOIUrl":"https://doi.org/10.1016/j.websem.2022.100770","url":null,"abstract":"<div>The query containment problem is a fundamental computer science problem which was originally defined for relational queries. With the growing popularity of the sparql query language, it became relevant and important in this new context: reliable and efficient sparql query containment solvers may have various applications within static analysis of queries, especially in the area of query optimizations and refactoring. In this paper, we present a new approach for solving the query containment problem in sparql. The approach is based on reducing the query containment problem to the satisfiability problem in first order logic. It covers a wide range of the sparql language constructs, including union of conjunctive queries, blank nodes, projections, subqueries, clauses from, filter, optional, graph, etc. It also covers containment under rdf schema entailment regime, and it can deal with the subsumption relation. We describe an implementation of the approach, an open source solver SpeCS and its thorough experimental evaluation on two relevant benchmarks, Query Containment Benchmark and SQCFramework. As a side result, SpeCS identified incorrect test cases within both benchmarks, which were manually checked, confirmed and fixed, resulting in better and more reliable benchmarks. The evaluation also shows that SpeCS is highly efficient and that compared to the state-of-the-art solvers, it gives more precise results in a shorter amount of time. In addition, SpeCS has the highest coverage of the supported language constructs.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100770"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

IndeGx: A model and a framework for indexing RDF knowledge graphs with SPARQL-based test suits indexx:使用基于sparql的测试套件为RDF知识图建立索引的模型和框架

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2023.100775

Pierre Maillot, Olivier Corby, Catherine Faron, Fabien Gandon, Franck Michel

{"title":"IndeGx: A model and a framework for indexing RDF knowledge graphs with SPARQL-based test suits","authors":"Pierre Maillot, Olivier Corby, Catherine Faron, Fabien Gandon, Franck Michel","doi":"10.1016/j.websem.2023.100775","DOIUrl":"https://doi.org/10.1016/j.websem.2023.100775","url":null,"abstract":"<div>In recent years, a large number of RDF datasets have been built and published on the Web in fields as diverse as linguistics or life sciences, as well as general datasets such as DBpedia or Wikidata. The joint exploitation of these datasets requires specific knowledge about their content, access points, and commonalities. However, not all datasets contain a self-description, and not all access points can handle the complex queries used to generate such a description.In this article, we provide a standard-based approach to generate the description of a dataset. The generated descriptions as well as the process of their computation are expressed using standard vocabularies and languages. We implemented our approach into a framework, called IndeGx, where each indexing feature and its computation is collaboratively and declaratively defined in a GitHub repository. We have experimented IndeGx on a set of 339 RDF datasets with endpoints listed in public catalogs, over 8 months. The results show that we can collect, as much as possible, important characteristics of the datasets depending on their availability and capacities. The resulting index captures the commonalities, variety and disparity in the offered content and services and it provides an important support to any application designed to query RDF datasets.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100775"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903582","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

Stream reasoning with DatalogMTL 使用DatalogMTL进行流推理

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2023.100776

Przemysław A. Wałęga, Mark Kaminski, Dingmin Wang, Bernardo Cuenca Grau

{"title":"Stream reasoning with DatalogMTL","authors":"Przemysław A. Wałęga, Mark Kaminski, Dingmin Wang, Bernardo Cuenca Grau","doi":"10.1016/j.websem.2023.100776","DOIUrl":"https://doi.org/10.1016/j.websem.2023.100776","url":null,"abstract":"<div>We study stream reasoning in <math><mtext>DatalogMTL</mtext></math>—an extension of Datalog with metric temporal operators. We propose a sound and complete stream reasoning algorithm that is applicable to forward-propagating <math><mtext>DatalogMTL</mtext></math> programs, in which propagation of derived information towards past time points is precluded. Memory consumption in our generic algorithm depends both on the properties of the rule set and the input data stream; in particular, it depends on the distances between timestamps occurring in data. This may be undesirable in certain practical scenarios since these distances can be very small, in which case the algorithm may require large amounts of memory. To address this issue, we propose a second algorithm, where the size of the required memory becomes independent on the timestamps in the data at the expense of disallowing punctual intervals in the rule set. We have implemented our approach as an extension of the <math><mtext>DatalogMTL</mtext></math> reasoner MeTeoR and tested it experimentally. The obtained results support the feasibility of our approach in practice.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100776"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49876692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Decentralized semantic provision of personal health streams 个人健康流的去中心化语义提供

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2023.100774

Jean-Paul Calbimonte , Orfeas Aidonopoulos , Fabien Dubosson , Benjamin Pocklington , Ilia Kebets , Pierre-Mikael Legris , Michael Schumacher

{"title":"Decentralized semantic provision of personal health streams","authors":"Jean-Paul Calbimonte , Orfeas Aidonopoulos , Fabien Dubosson , Benjamin Pocklington , Ilia Kebets , Pierre-Mikael Legris , Michael Schumacher","doi":"10.1016/j.websem.2023.100774","DOIUrl":"https://doi.org/10.1016/j.websem.2023.100774","url":null,"abstract":"<div>Personalized healthcare is nowadays driven by the increasing volumes of patient data, observed and produced continuously thanks to medical devices, mobile sensors, patient-reported outcomes, among other data sources. This data is made available as streams, due to their dynamic nature, which represents an important challenge for processing, querying and interpreting the incoming information. In addition, the sensitive nature of healthcare data poses significant restrictions regarding privacy, which has led to the emergence of decentralized personal data management systems. Data semantics play a key role in order to enable both decentralization and integration of personal health data, as they introduce the capability to represent knowledge and information using ontologies and semantic vocabularies. In this paper we describe the SemPryv system, which provides the means to manage personal health data streams enriched with semantic information. SemPryv is designed as a decentralized system, so that users have the possibility of hosting their personal data at different sites, while keeping control of access rights. The semantization of data in SemPryv is implemented through different strategies, ranging from rule-based annotation to machine learning-based suggestions, fed from third-party specialized healthcare metadata providers. The system has been made available as Open Source, and is integrated as part of the Pryv.io platform used and commercialized in the healthcare and personal data management industry.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100774"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903584","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2023.100773

Antonio De Nicola , Anna Formica , Michele Missikoff , Elaheh Pourabbas , Francesco Taglino

{"title":"A parametric similarity method: Comparative experiments based on semantically annotated large datasets","authors":"Antonio De Nicola , Anna Formica , Michele Missikoff , Elaheh Pourabbas , Francesco Taglino","doi":"10.1016/j.websem.2023.100773","DOIUrl":"https://doi.org/10.1016/j.websem.2023.100773","url":null,"abstract":"<div>We present the parametric method SemSimp aimed at measuring semantic similarity of digital resources. SemSimp is based on the notion of information content, and it leverages a reference ontology and taxonomic reasoning, encompassing different approaches for weighting the concepts of the ontology. In particular, weights can be computed by considering either the available digital resources or the structure of the reference ontology of a given domain. SemSimp is assessed against six representative semantic similarity methods for comparing sets of concepts proposed in the literature, by carrying out an experimentation that includes both a statistical analysis and an expert judgment evaluation. To the purpose of achieving a reliable assessment, we used a real-world large dataset based on the Digital Library of the Association for Computing Machinery (ACM), and a reference ontology derived from the ACM Computing Classification System (ACM-CCS). For each method, we considered two indicators. The first concerns the degree of confidence to identify the similarity among the papers belonging to some special issues selected from the ACM Transactions on Information Systems journal, the second the Pearson correlation with human judgment. The results reveal that one of the configurations of SemSimp outperforms the other assessed methods. An additional experiment performed in the domain of physics shows that, in general, SemSimp provides better results than the other similarity methods.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100773"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903583","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2

Answering Count Questions with Structured Answers from Text 回答计数问题与结构化的答案从文本

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2022.100769

Shrestha Ghosh , Simon Razniewski , Gerhard Weikum

引用次数: 4

Building a Knowledge Graph for the History of Vienna with Semantic MediaWiki 利用语义媒体维基构建维也纳历史知识图谱

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2022.100771

Bernhard Krabina

引用次数: 5

From tabular data to knowledge graphs: A survey of semantic table interpretation tasks and methods 从表格数据到知识图谱:语义表解释任务和方法综述

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2022.100761

Jixiong Liu , Yoan Chabot , Raphaël Troncy , Viet-Phi Huynh , Thomas Labbé , Pierre Monnin

{"title":"From tabular data to knowledge graphs: A survey of semantic table interpretation tasks and methods","authors":"Jixiong Liu , Yoan Chabot , Raphaël Troncy , Viet-Phi Huynh , Thomas Labbé , Pierre Monnin","doi":"10.1016/j.websem.2022.100761","DOIUrl":"https://doi.org/10.1016/j.websem.2022.100761","url":null,"abstract":"<div>Tabular data often refers to data that is organized in a table with rows and columns. We observe that this data format is widely used on the Web and within enterprise data repositories. Tables potentially contain rich semantic information that still needs to be interpreted. The process of extracting meaningful information out of tabular data with respect to a semantic artefact, such as an ontology or a knowledge graph, is often referred to as Semantic Table Interpretation (STI) or Semantic Table Annotation. In this survey paper, we aim to provide a comprehensive and up-to-date state-of-the-art review of the different tasks and methods that have been proposed so far to perform STI. First, we propose a new categorization that reflects the heterogeneity of table types that one can encounter, revealing different challenges that need to be addressed. Next, we define five major sub-tasks that STI deals with even if the literature has mostly focused on three sub-tasks so far. We review and group the many approaches that have been proposed into three macro families and we discuss their performance and limitations with respect to the various datasets and benchmarks proposed by the community. Finally, we detail what are the remaining scientific barriers to be able to truly automatically interpret any type of tables that can be found in the wild Web.</div>","PeriodicalId":49951,"journal":{"name":"Journal of Web Semantics","volume":"76 ","pages":"Article 100761"},"PeriodicalIF":2.5,"publicationDate":"2023-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49903590","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 14

Explainable argumentation as a service 可解释的论证服务

IF 2.5 3区计算机科学

Journal of Web Semantics Pub Date : 2023-04-01 DOI: 10.1016/j.websem.2023.100772

Nikolaos I. Spanoudakis , Georgios Gligoris , Adamos Koumi , Antonis C. Kakas

引用次数: 1