The role of constraints in linked data

Authors:
Marco Antonio Casanova;Karin Koogan Beitman;Antonio Luz Furtado;Vania M. P. Vidal;José A. F. Macedo;Raphael Valle A. Gomes;Percy E. Rivera Salas
Affiliations:
Department of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil;Department of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil;Department of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil;Department of Computing, Federal University of Ceará, Fortaleza, CE, Brazil;Department of Computing, Federal University of Ceará, Fortaleza, CE, Brazil;Department of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil;Department of Informatics, PUC-Rio, Rio de Janeiro, RJ, Brazil
Venue:
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems - Volume Part II
Year:
2011

Citing 6
Cited 1

Basic description logics

The description logic handbook
Interoperability by design using the StdTrip tool: an a priori approach

Proceedings of the 6th International Conference on Semantic Systems
Editorial: Revising the constraints of lightweight mediated schemas

Data & Knowledge Engineering
A method for filtering large conceptual schemas

ER'10 Proceedings of the 29th international conference on Conceptual modeling
When owl: sameAs isn't the same: an analysis of identity in linked data

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I
Ontology alignment for linked open data

ISWC'10 Proceedings of the 9th international semantic web conference on The semantic web - Volume Part I

Dealing with inconsistencies in linked data mashups

Proceedings of the 16th International Database Engineering & Applications Sysmposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper argues that a Linked Data source should publish an application ontology that includes a set of constraints that capture the semantics of the classes and properties used to model the data. Furthermore, if the Linked Data source publishes a mapping between its vocabulary and the vocabulary of a domain ontology, then it has to specify the application ontology constraints so that they are consistent with those of the domain ontology. The main contributions of the paper are methods for constructing the constraints of the application ontology of a Linked Data source, defined as fragments of domain ontologies. The methods assume that the ontologies are written in an expressive family of attributive languages and depend on a procedure to test logical implication, which explores the structure of sets of constraints.