Show simple item record

dc.contributor.authorWang, Zheen_US
dc.contributor.authorWang, Kewenen_US
dc.contributor.authorTopor, Rodneyen_US
dc.contributor.authorPan, Jeffen_US
dc.date.accessioned2017-04-24T12:13:25Z
dc.date.available2017-04-24T12:13:25Z
dc.date.issued2010en_US
dc.date.modified2011-03-22T07:04:45Z
dc.identifier.issn10122443en_US
dc.identifier.doi10.1007/s10472-010-9187-9en_AU
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.en_US
dc.description.peerreviewedYesen_US
dc.description.publicationstatusYesen_AU
dc.languageEnglishen_US
dc.language.isoen_AU
dc.publisherSpringeren_US
dc.publisher.placeNetherlandsen_US
dc.relation.ispartofstudentpublicationNen_AU
dc.relation.ispartofpagefrom117en_US
dc.relation.ispartofpageto151en_US
dc.relation.ispartofissue1-2en_US
dc.relation.ispartofjournalAnnals of Mathematics and Artificial Intelligenceen_US
dc.relation.ispartofvolume58en_US
dc.rights.retentionYen_AU
dc.subject.fieldofresearchArtificial Intelligence and Image Processing not elsewhere classifieden_US
dc.subject.fieldofresearchcode080199en_US
dc.titleForgetting for knowledge bases in DL-Liteen_US
dc.typeJournal articleen_US
dc.type.descriptionC1 - Peer Reviewed (HERDC)en_US
dc.type.codeC - Journal Articlesen_US
gro.facultyGriffith Sciences, School of Information and Communication Technologyen_US
gro.date.issued2010
gro.hasfulltextNo Full Text


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