BibTeX
CSL-JSON
MLA
Harvard
Using Description Logics for RDF Constraint Checking and Closed-World
Recognition
release_od3pvanarravzdqf5v65xxcloe
by
Peter F. Patel-Schneider
Released
as a article
.
2015
Abstract
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.
In text/plain
format
Archived Files and Locations
application/pdf 265.2 kB
file_3cteexxlu5aphe35qfw2zcsopq
|
arxiv.org (repository) web.archive.org (webarchive) |
Read Archived PDF
Preserved and Accessible
arXiv
1411.4156v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links