Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A P2P framework for modular disjunctive knowledge bases with negation and constraints and its applications to the semantic web

A P2P framework for modular disjunctive knowledge bases with negation and constraints and its... The paper presents present a P2P framework based on asynchronous messaging for collaborative reasoning over modular disjunctive knowledge bases with weak negation, strong negation, and constraints. In particular, the paper presents algorithms running upon receival from a knowledge base of a corresponding Ask_pred, Tell_pred, Ask_KB, or Tell_KB message, which are needed for query answering. In particular, these messages collect in the knowledge base that received the query which is the corresponding part of the modular knowledge base that is needed for query answering. This process is done in polynomial time with respect to the size of the modular knowledge base. The paper presents several applications of the proposed theory, including restricted modular ERDF ontologies, SPARQL 1.1 seen as a rule language, the maximal weak model semantics, the minimal weak model semantics, multi-context reasoning, the contextually closed semantics, and taxonomy-based sources connected by articulations. Several complexity results are provided. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png International Journal of Web Engineering and Technology Inderscience Publishers

A P2P framework for modular disjunctive knowledge bases with negation and constraints and its applications to the semantic web

Loading next page...
 
/lp/inderscience-publishers/a-p2p-framework-for-modular-disjunctive-knowledge-bases-with-negation-e1wp4KuFqm

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Inderscience Publishers
Copyright
Copyright © Inderscience Enterprises Ltd
ISSN
1476-1289
eISSN
1741-9212
DOI
10.1504/ijwet.2021.122787
Publisher site
See Article on Publisher Site

Abstract

The paper presents present a P2P framework based on asynchronous messaging for collaborative reasoning over modular disjunctive knowledge bases with weak negation, strong negation, and constraints. In particular, the paper presents algorithms running upon receival from a knowledge base of a corresponding Ask_pred, Tell_pred, Ask_KB, or Tell_KB message, which are needed for query answering. In particular, these messages collect in the knowledge base that received the query which is the corresponding part of the modular knowledge base that is needed for query answering. This process is done in polynomial time with respect to the size of the modular knowledge base. The paper presents several applications of the proposed theory, including restricted modular ERDF ontologies, SPARQL 1.1 seen as a rule language, the maximal weak model semantics, the minimal weak model semantics, multi-context reasoning, the contextually closed semantics, and taxonomy-based sources connected by articulations. Several complexity results are provided.

Journal

International Journal of Web Engineering and TechnologyInderscience Publishers

Published: Jan 1, 2021

There are no references for this article.