《Web语义学期刊》是一门跨学科的期刊,它基于对各个学科领域的研究和应用,为知识密集型和智能服务Web的发展做出了贡献。这些领域包括:知识技术、本体、代理、数据库和语义网格。显然,诸如信息检索、语言技术、人机交互和知识发现等学科也具有重要意义。涵盖了语义Web开发的所有方面。还鼓励发布大规模实验及其分析,以清楚地说明将语义引入现有Web界面,内容和服务中的方案和方法。该期刊强调发表论文,这些论文结合了不同学科领域的理论、方法和实验,以提供创新的语义方法和应用。《Web语义学期刊》涵盖了各种重要的应用领域,包括:电子商务、电子社区、知识管理、电子学习、数字图书馆和电子科学。官网地址:http://dblp.uni-trier.de/db/journals/ws/

最新论文

Weakly-Sticky(WS) Datalog+/- is an expressive member of the family of Datalog+/- program classes that is defined on the basis of the conditions of stickiness and weak-acyclicity. Conjunctive query answering (QA) over the WS programs has been investigated, and its tractability in data complexity has been established. However, the design and implementation of practical QA algorithms and their optimizations have been open. In order to fill this gap, we first study Sticky and WS programs from the point of view of the behavior of the chase procedure. We extend the stickiness property of the chase to that of generalized stickiness of the chase (GSCh) modulo an oracle that selects (and provides) the predicate positions where finitely values appear during the chase. Stickiness modulo a selection function S that provides only a subset of those positions defines sch(S), a semantic subclass of GSCh. Program classes with selection functions include Sticky and WS, and another syntactic class that we introduce and characterize, namely JWS, of jointly-weakly-sticky programs, which contains WS. The selection functions for these last three classes are computable, and no external, possibly non-computable oracle is needed. We propose a bottom-up QA algorithm for programs in the class sch(S), for a general selection function S. As a particular case, we obtain a polynomial-time QA algorithm for JWS and weakly-sticky programs. Unlike WS, JWS turns out to be closed under magic-sets query optimization. As a consequence, both the generic polynomial-time QA algorithm and its magic-set optimization can be particularized and applied to WS.

0
0
下载
预览
Top