DeepAI AI Chat
Log In Sign Up

Using Description Logics for RDF Constraint Checking and Closed-World Recognition

by   Peter F. Patel-Schneider, et al.

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 performed.


page 1

page 2

page 3

page 4


Extending SROIQ with Constraint Networks and Grounded Circumscription

Developments in semantic web technologies have promoted ontological enco...

Polynomial Rewritings from Expressive Description Logics with Closed Predicates to Variants of Datalog

In many scenarios, complete and incomplete information coexist. For this...

Half-checking propagators

Propagators are central to the success of constraint programming, that i...

GC-SROIQ(C) : Expressive Constraint Modelling and Grounded Circumscription for SROIQ

Developments in semantic web technologies have promoted ontological enco...

On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics

We present syntactic characterisations for the union closed fragments of...

Aleatoric Description Logic for Probailistic Reasoning (Long Version)

Description logics are a powerful tool for describing ontological knowle...

Extending Unification in EL to Disunification: The Case of Dismatching and Local Disunification

Unification in Description Logics has been introduced as a means to dete...