dc.contributor.author | Jin, Yifan | |
dc.contributor.author | Wang, Kewen | |
dc.contributor.author | Wang, Zhe | |
dc.contributor.author | Zhuang, Zhiqiang | |
dc.contributor.editor | Michael, L | |
dc.contributor.editor | Kakas, A | |
dc.date.accessioned | 2018-09-11T04:52:54Z | |
dc.date.available | 2018-09-11T04:52:54Z | |
dc.date.issued | 2016 | |
dc.identifier.issn | 0302-9743 | |
dc.identifier.doi | 10.1007/978-3-319-48758-8_20 | |
dc.identifier.uri | http://hdl.handle.net/10072/124135 | |
dc.description.abstract | Possibilistic 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.peerreviewed | Yes | |
dc.language | English | |
dc.language.iso | eng | |
dc.publisher | Springer | |
dc.relation.ispartofpagefrom | 305 | |
dc.relation.ispartofpageto | 319 | |
dc.relation.ispartofjournal | Lecture Notes in Computer Science | |
dc.relation.ispartofvolume | 10021 | |
dc.subject.fieldofresearch | Artificial intelligence | |
dc.subject.fieldofresearch | Information and computing sciences | |
dc.subject.fieldofresearchcode | 4602 | |
dc.subject.fieldofresearchcode | 46 | |
dc.title | Revising Possibilistic Knowledge Bases via Compatibility Degrees | |
dc.type | Journal article | |
dc.type.description | C1 - Articles | |
dc.type.code | C - Journal Articles | |
gro.faculty | Griffith Sciences, School of Information and Communication Technology | |
gro.hasfulltext | No Full Text | |
gro.griffith.author | Wang, Kewen | |
gro.griffith.author | Wang, Zhe | |