Show simple item record

dc.contributor.authorWang, Zhe
dc.contributor.authorWang, Kewen
dc.contributor.authorTopor, Rodney
dc.contributor.authorPan, Jeff Z
dc.date.accessioned2017-05-03T14:50:31Z
dc.date.available2017-05-03T14:50:31Z
dc.date.issued2010
dc.date.modified2011-03-22T07:04:45Z
dc.identifier.issn1012-2443
dc.identifier.doi10.1007/s10472-010-9187-9
dc.identifier.urihttp://hdl.handle.net/10072/37492
dc.description.abstractTo support the reuse and combination of ontologies in Semantic Web applications, it is often necessary to obtain smaller ontologies from existing larger ontologies. In particular, applications may require the omission of certain terms, e. g., concept names and role names, from an ontology. However, the task of omitting terms from an ontology is challenging because the omission of some terms may affect the relationships between the remaining terms in complex ways.We present the first solution to the problem of omitting concepts and roles from knowledge bases of description logics (DLs) by adapting the technique of forgetting, previously used in other domains. Specifically, we first introduce a model-theoretic definition of forgetting for knowledge bases (both TBoxes and ABoxes) in DL-LiteNbool, which is a non-trivial adaption of the standard definition for classical logic, and show that our model-based forgetting satisfies all major criteria of a rational forgetting operator, which in turn verifies the suitability of our model-based forgetting. We then introduce algorithms that implement forgetting operations in DL-Lite knowledge bases. We prove that the algorithms are correct with respect to the semantic definition of forgetting.We establish a general framework for defining and comparing different definitions of forgetting by introducing a parameterized family of forgetting operators called query-based forgetting operators. In this framework we identify three specific query-based forgetting operators and show that they form a hierarchy. In particular, we show that the model-based forgetting coincides with one of these query-based forgetting operators.
dc.description.peerreviewedYes
dc.description.publicationstatusYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.publisher.placeNetherlands
dc.relation.ispartofstudentpublicationN
dc.relation.ispartofpagefrom117
dc.relation.ispartofpageto151
dc.relation.ispartofissue1-2
dc.relation.ispartofjournalAnnals of Mathematics and Artificial Intelligence
dc.relation.ispartofvolume58
dc.rights.retentionY
dc.subject.fieldofresearchApplied mathematics
dc.subject.fieldofresearchArtificial intelligence not elsewhere classified
dc.subject.fieldofresearchTheory of computation
dc.subject.fieldofresearchArtificial intelligence
dc.subject.fieldofresearchcode4901
dc.subject.fieldofresearchcode460299
dc.subject.fieldofresearchcode4613
dc.subject.fieldofresearchcode4602
dc.titleForgetting for knowledge bases in DL-Lite
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.date.issued2010
gro.hasfulltextNo Full Text
gro.griffith.authorTopor, Rodney W.
gro.griffith.authorWang, Kewen
gro.griffith.authorWang, Zhe


Files in this item

FilesSizeFormatView

There are no files associated with 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