Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/21031
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHELLINGS, Jelle-
dc.contributor.authorGYSSENS, Marc-
dc.contributor.authorParedaens, Jan-
dc.contributor.authorWu, Yuqing-
dc.date.accessioned2016-04-25T07:54:03Z-
dc.date.available2016-04-25T07:54:03Z-
dc.date.issued2016-
dc.identifier.citationAnnals of mathematics and artificial intelligence, 76 (3-4), p. 251-279-
dc.identifier.issn1012-2443-
dc.identifier.urihttp://hdl.handle.net/1942/21031-
dc.description.abstractAkhtar et al. introduced equality-generating constraints and functional constraints as a first step towards dependency-like integrity constraints for RDF data [3]. Here, we focus on functional constraints. Since the usefulness of functional constraints is not limited to the RDF data model, we study the functional constraints in the more general setting of relations with arbitrary arity. We further introduce constant constraints and study the functional and constant constraints combined. Our main results are sound and complete axiomatizations for the functional and constant constraints, both separately and combined. These axiomatizations are derived using the chase algorithm for equality-generating constraints. For derivations of constant constraints, we show how every chase step can be simulated by a bounded number of applications of inference rules. For derivations of functional constraints, we show that the chase algorithm can be normalized to a more specialized symmetry-preserving chase algorithm performing so-called symmetry-preserving steps. We then show how each symmetry-preserving step can be simulated by a bounded number of applications of inference rules. The axiomatization for functional constraints is in particular applicable to the RDF data model, solving a major open problem of Akhtar et al.-
dc.description.sponsorshipYuqing Wu carried out part of her work during a sabbatical visit to Hasselt University with a Senior Visiting Postdoctoral Fellowship of the Research Foundation Flanders (FWO).-
dc.language.isoen-
dc.rights© Springer International Publishing Switzerland 2015-
dc.subject.otherfunctional constraints; constant constraints; chase algorithm; axiomatization-
dc.titleImplication and axiomatization of functional and constant constraints-
dc.typeJournal Contribution-
dc.identifier.epage279-
dc.identifier.issue3-4-
dc.identifier.spage251-
dc.identifier.volume76-
local.format.pages1-29-
local.bibliographicCitation.jcatA1-
dc.description.notesHellings, J (reprint author), Hasselt Univ, Fac Sci, Martelarenlaan 42, B-3500 Hasselt, Belgium. jelle.hellings@uhasselt.be; marc.gyssens@uhasselt.be; jan.paredaens@uantwerpen.be; melanie.wu@pomona.edu-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.identifier.doi10.1007/s10472-015-9473-7-
dc.identifier.isi000374449500002-
item.validationecoom 2017-
item.contributorHELLINGS, Jelle-
item.contributorGYSSENS, Marc-
item.contributorParedaens, Jan-
item.contributorWu, Yuqing-
item.accessRightsOpen Access-
item.fullcitationHELLINGS, Jelle; GYSSENS, Marc; Paredaens, Jan & Wu, Yuqing (2016) Implication and axiomatization of functional and constant constraints. In: Annals of mathematics and artificial intelligence, 76 (3-4), p. 251-279.-
item.fulltextWith Fulltext-
crisitem.journal.issn1012-2443-
crisitem.journal.eissn1573-7470-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
amai2015_paper.pdfPeer-reviewed author version424.4 kBAdobe PDFView/Open
art%3A10.1007%2Fs10472-015-9473-7.pdf
  Restricted Access
Published version547.52 kBAdobe PDFView/Open    Request a copy
Show simple item record

SCOPUSTM   
Citations

3
checked on Sep 7, 2020

WEB OF SCIENCETM
Citations

6
checked on May 2, 2024

Page view(s)

68
checked on Sep 7, 2022

Download(s)

182
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.