Using Description Logics for RDF Constraint Checking and Closed-World Recognition
نویسنده
چکیده
RDF and Description Logics work in an open-world setting where absence of information is not information about absence. Nevertheless, Description Logic axioms can be interpreted in a closed-world setting and in this setting they can be used for both constraint checking and closed-world recognition against information sources. When the information sources are expressed in well-behaved RDF or RDFS (i.e., RDF graphs interpreted in the RDF or RDFS semantics) this constraint checking and closed-world recognition is simple to describe. Further this constraint checking can be implemented as SPARQL querying and thus effectively per-
منابع مشابه
Integrity Constraints for Linked Data
Linked Data makes one central addition to the Semantic Web principles: all entity URIs should be dereferenceable to provide an authoritative RDF representation. URIs in a linked dataset can be partitioned into the exported URIs for which the dataset is authoritative versus the imported URIs the dataset is linking against. This partitioning has an impact on integrity constraints, as a Closed Wor...
متن کاملIntegrating Description Logics and Relational Databases
In this paper, we compare description logics with relational databases with respect to their treatment of schema constraints, the languages used to express these constraints, and the approaches to query answering and constraint checking. Our analysis reveals a significant overlap between the two formalisms. Inspired by the integrity constraints of relational databases, we define a notion of int...
متن کاملSemantics of Constraints in RDFS
We study constraints for RDF-Schema (RDFS) graphs. The syntax and semantics is defined for constraints in graphs that can contain RDFS properties and blank nodes. The proposal for constraint satisfaction closely resembles the possible world approach found in various contexts of incomplete databases and knowledge bases. Positive decidability results for checking satisfaction of RDFS constraints ...
متن کاملTractable Reasoning with Bayesian Description Logics
The DL-Lite family of tractable description logics lies between the semantic web languages RDFS and OWL Lite. In this paper, we present a probabilistic generalization of the DL-Lite description logics, which is based on Bayesian networks. As an important feature, the new probabilistic description logics allow for flexibly combining terminological and assertional pieces of probabilistic knowledg...
متن کاملRule-based Chaining with Ontological Constraint Checking: a Hybrid Reasoning System for Semantic Web
An integrated system for knowledge representation, consisting of a structural component and a relational component, is presented, and its application to Semantic Web is outlined. Grounded upon Description Logics (DL), the structural component enables representation of ontologies along with Resource Description Framework (RDF) annotations of Web contents, and various kinds of ontology-based reas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015