Revising Possibilistic Knowledge Bases via Compatibility Degrees
From MaRDI portal
Publication:2835879
DOI10.1007/978-3-319-48758-8_20zbMath1483.68395DBLPconf/jelia/JinWWZ16OpenAlexW2545228848WikidataQ62045648 ScholiaQ62045648MaRDI QIDQ2835879
Zhiqiang Zhuang, Yifan Jin, Zhe Wang, Kewen Wang
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48758-8_20
Knowledge representation (68T30) Reasoning under uncertainty in the context of artificial intelligence (68T37)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A framework for managing uncertain inputs: an axiomization of rewarding
- Propositional knowledge base revision and minimal change
- A practical approach to revising prioritized knowledge bases
- A synthetic view of belief revision with uncertain inputs in the framework of possibility theory
- Semantics for possibilistic answer set programs: uncertain rules versus rules with uncertain conclusions
- A Framework for Iterated Belief Revision Using Possibilistic Counterparts to Jeffrey's Rule
- On the logic of theory change: Partial meet contraction and revision functions
This page was built for publication: Revising Possibilistic Knowledge Bases via Compatibility Degrees
