Show simple item record

dc.contributor.authorGrau, Bernardo Cuenca
dc.contributor.authorHorrocks, Ian
dc.contributor.authorKroetzsch, Markus
dc.contributor.authorKupke, Clemens
dc.contributor.authorMagka, Despoina
dc.contributor.authorMotik, Boris
dc.contributor.authorWang, Zhe
dc.date.accessioned2019-03-22T04:36:41Z
dc.date.available2019-03-22T04:36:41Z
dc.date.issued2013
dc.identifier.issn1076-9757
dc.identifier.doi10.1613/jair.3949
dc.identifier.urihttp://hdl.handle.net/10072/173437
dc.description.abstractAnswering conjunctive queries (CQs) over a set of facts extended with existential rules is a prominent problem in knowledge representation and databases. This problem can be solved using the chase algorithm, which extends the given set of facts with fresh facts in order to satisfy the rules. If the chase terminates, then CQs can be evaluated directly in the resulting set of facts. The chase, however, does not terminate necessarily, and checking whether the chase terminates on a given set of rules and facts is undecidable. Numerous acyclicity notions were proposed as sufficient conditions for chase termination. In this paper, we present two new acyclicity notions called model-faithful acyclicity (MFA) and model-summarising acyclicity (MSA). Furthermore, we investigate the landscape of the known acyclicity notions and establish a complete taxonomy of all notions known to us. Finally, we show that MFA and MSA generalise most of these notions.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherAAAI Press
dc.relation.ispartofpagefrom741
dc.relation.ispartofpageto808
dc.relation.ispartofjournalJournal of Artificial Intelligence Research
dc.relation.ispartofvolume47
dc.subject.fieldofresearchApplied mathematics
dc.subject.fieldofresearchApplied mathematics not elsewhere classified
dc.subject.fieldofresearchCognitive and computational psychology
dc.subject.fieldofresearchcode4901
dc.subject.fieldofresearchcode490199
dc.subject.fieldofresearchcode5204
dc.titleAcyclicity Notions for Existential Rules and Their Application to Query Answering in Ontologies
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
dc.description.versionVersion of Record (VoR)
gro.rights.copyright© 2013 A I Access Foundation, Inc. The attached file is reproduced here in accordance with the copyright policy of the publisher. Please refer to the journal's website for access to the definitive, published version.
gro.hasfulltextFull Text
gro.griffith.authorWang, Zhe


Files in this item

This item appears in the following Collection(s)

  • Journal articles
    Contains articles published by Griffith authors in scholarly journals.

Show simple item record