Kedian Mu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Kedian Mu has a total of 25 co-authors. Here are the top co-authors by number of shared publications:
Zhi Jin
Key Laboratory of High Confidence Software Technologies (Peking University), Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, PR China
4 shared publications- Pengxiang Wang
Peking University
3 shared publications Weiru Liu
School of Electronics, Electrical Engineering and Computer Science, Queen’s University Belfast, BT7 1NN, UK
3 shared publications- Weiru Liu
Queen’s University Belfast
3 shared publications - Zhi Jin
Peking University
3 shared publications - Kewen Wang
School of Information and Communication Technology Griffith University Australia
2 shared publications
Latest Publications
- 7 September 2026
- Published by Springer Nature
- p. 468-485
Fine-Grained Neuron Importance Guided Architecture-Based Continual Learning
- 7 September 2026
- Published by Springer Nature
- p. 468-485
Fine-Grained Neuron Importance Guided Architecture-Based Continual Learning
- 5 September 2026
- Published by Springer Nature
- p. 294-312
Unlearn to Learn Better: Continual Unlearning via Capacity Recycling
- 5 September 2026
- Published by Springer Nature
- p. 294-312
Unlearn to Learn Better: Continual Unlearning via Capacity Recycling
- 22 August 2024
- Published by Springer Nature
- p. 143-160
AdaHAT: Adaptive Hard Attention to the Task in Task-Incremental Learning
- 22 August 2024
- Published by Springer Nature
- p. 143-160
AdaHAT: Adaptive Hard Attention to the Task in Task-Incremental Learning
- 17 September 2023
- Published by Springer Nature
- p. 471-487
Meta-HRNet: A High Resolution Network for Coarse-to-Fine Few-Shot Classification
- 17 September 2023
- Published by Springer Nature
- p. 471-487
Meta-HRNet: A High Resolution Network for Coarse-to-Fine Few-Shot Classification
- 14 April 2023
- Published by Springer Nature
- p. 74-83
Enlarge the Hidden Distance: A More Distinctive Embedding to Tell Apart Unknowns for Few-Shot Learning
- 14 April 2023
- Published by Springer Nature
- p. 74-83
Enlarge the Hidden Distance: A More Distinctive Embedding to Tell Apart Unknowns for Few-Shot Learning
- 19 September 2021
- Published by Springer Nature
- p. 499-510
The Degree of Conflict Between Formulas in an Inconsistent Knowledge Base
- 19 September 2021
- Published by Springer Nature
- p. 499-510
The Degree of Conflict Between Formulas in an Inconsistent Knowledge Base
- 7 August 2021
- Published by Springer Nature
- p. 319-332
The Modularity of Inconsistent Knowledge Bases with Application to Measuring Inconsistency
- 7 August 2021
- Published by Springer Nature
- p. 319-332
The Modularity of Inconsistent Knowledge Bases with Application to Measuring Inconsistency
- 1 December 2020
- Published by Elsevier in Artificial Intelligence
- Vol. 289
Intrinsic approaches to prioritizing diagnoses in multi-context systems
- 1 December 2020
- Published by Elsevier in Artificial Intelligence
- Vol. 289
Intrinsic approaches to prioritizing diagnoses in multi-context systems
- Open Access
- 20 September 2019
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 66, 279-296
Formulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
As one of fundamental properties to characterize inconsistency measures for knowledge bases, the property of free formula independence well captures the intuition that free formulas are independent of the amount of inconsistency in a knowledge base for cases where inconsistency is characterized in terms of minimal inconsistent subsets. But it has been argued that not all the free formulas are independent of inconsistency in some other contexts of inconsistency characterization. In this paper, we propose a characterization of formulas independent of inconsistency in the framework of Priest's minimally inconsistent LP. Based on an atom-based counterpart of the notion of free formula, we propose a notion of Bi-free formula to describe formulas that are free from inconsistency in both syntax and paraconsistent models in this logic. Then we propose the property of Bi-free formula independence, which is more suitable for characterizing the role of formulas free from inconsistency in measuring inconsistency from both syntactic and semantic perspectives.
- 20 September 2019
- Published by AI Access Foundation in Journal of Artificial Intelligence Research
- Vol. 66, 279-296
Open AccessFormulas Free From Inconsistency: An Atom-Centric Characterization in Priest's Minimally Inconsistent LP
As one of fundamental properties to characterize inconsistency measures for knowledge bases, the property of free formula independence well captures the intuition that free formulas are independent of the amount of inconsistency in a knowledge base for cases where inconsistency is characterized in terms of minimal inconsistent subsets. But it has been argued that not all the free formulas are independent of inconsistency in some other contexts of inconsistency characterization. In this paper, we propose a characterization of formulas independent of inconsistency in the framework of Priest's minimally inconsistent LP. Based on an atom-based counterpart of the notion of free formula, we propose a notion of Bi-free formula to describe formulas that are free from inconsistency in both syntax and paraconsistent models in this logic. Then we propose the property of Bi-free formula independence, which is more suitable for characterizing the role of formulas free from inconsistency in measuring inconsistency from both syntactic and semantic perspectives.
- 21 August 2019
- Published by Springer Nature
- p. 84-95
Multi-attention Item Recommendation Model Based on Social Relations
- 21 August 2019
- Published by Springer Nature
- p. 84-95
Multi-attention Item Recommendation Model Based on Social Relations