Show simple item record

dc.contributor.authorJin, Yifan
dc.contributor.authorWang, Kewen
dc.contributor.authorWang, Zhe
dc.contributor.authorZhuang, Zhiqiang
dc.contributor.editorMichael, L
dc.contributor.editorKakas, A
dc.date.accessioned2018-09-11T04:52:54Z
dc.date.available2018-09-11T04:52:54Z
dc.date.issued2016
dc.identifier.issn0302-9743
dc.identifier.doi10.1007/978-3-319-48758-8_20
dc.identifier.urihttp://hdl.handle.net/10072/124135
dc.description.abstractPossibilistic logic is a weighted logic for dealing with incomplete and uncertain information by assigning weights to propositional formulas. A possibilistic knowledge base (KB) is a finite set of such formulas. The problem of revising a possibilistic KB by possibilistic formula is not new. However, existing approaches are limited in two ways. Firstly, they suffer from the so-called drowning effect. Secondly, they handle certain and uncertain formulas separately and most only handle certain inputs. In this paper, we propose a unified approach that caters for revision by both certain and uncertain inputs and relieves the drowning effect. The approach is based on a refined inconsistency degree function called compatibility degree which provides a unifying framework (called cd-revision) for defining specific revision operators for possibilistic KBs. Our definition leads to an algorithm for computing the result of the proposed revision. The revision operators defined in cd-revision possess some desirable properties including those from classic belief revision and some others that are specific to possibilistic revision. We also show that several major revision operators for possibilistic, stratified and prioritised KBs can be embedded in cd-revision.
dc.description.peerreviewedYes
dc.languageEnglish
dc.language.isoeng
dc.publisherSpringer
dc.relation.ispartofpagefrom305
dc.relation.ispartofpageto319
dc.relation.ispartofjournalLecture Notes in Computer Science
dc.relation.ispartofvolume10021
dc.subject.fieldofresearchArtificial intelligence
dc.subject.fieldofresearchInformation and computing sciences
dc.subject.fieldofresearchcode4602
dc.subject.fieldofresearchcode46
dc.titleRevising Possibilistic Knowledge Bases via Compatibility Degrees
dc.typeJournal article
dc.type.descriptionC1 - Articles
dc.type.codeC - Journal Articles
gro.facultyGriffith Sciences, School of Information and Communication Technology
gro.hasfulltextNo Full Text
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