R-calculus for Pseudo-subconcept-ninimal Change in Description Logic ALC

doi:10.13328/j.cnki.jos.005596

微信服务号

微信订阅号

2025-4-24- 17

Home > Archive>Volume 30, Issue 12, 2019 >3683-3693. DOI:10.13328/j.cnki.jos.005596

PDF HTML XML Export Cite reminder

R-calculus for Pseudo-subconcept-ninimal Change in Description Logic ALC
DOI:
                        10.13328/j.cnki.jos.005596
                    
Author:
                        WANG Yu-HuiWANG Yu-Hui
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100049, China;Information Technology Center, China Reinsurance(Group) Corporation, Beijing 100033, China
Find this author on CNKI
Find this author on BaiDu
Search for this author on this site
SUI Yue-FeiSUI Yue-Fei
Key Laboratory of Intelligent Information Processing, Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100190, China;School of Computer and Control Engineering, University of Chinese Academy of Sciences, Beijing 100049, China
Find this author on CNKI
Find this author on BaiDu
Search for this author on this site

                    
Affiliation:
Clc Number:TP18
Fund Project:National Program on Key Basic Research Project (973)(2005CB321901); Open Fund of the State Key Laboratory of Software Development Environment (SKLSDE-2010KF-06)

Article

Figures

Metrics

Reference

Cited by

Materials

Comments

Abstract:

The AGM postulates are for the belief revision (revision by a single belief), and the DP postulates are for the iterated revision (revision by a finite sequence of beliefs). Li gave an R-calculus for R-configurations △|Γ, where △ is a set of atomic formulas or the negations of atomic formulas, and Γ is a finite set of formulas. With an idea to preserve as much as possible information of statements to be revised, another definition of the minimal change is considered:pseudo-subconcept-minimal (≤-minimal) change, where ≤ is the pseudo-subconcept relation, and then give a new R-calculus T^DL which is sound and complete with respect to ≤-minimal change such that △|Γ is reduced to a theory △∪Θ in T^DL (denoted by ├_T^DL △|Γ⇒△,Θ) if and only if Θ is a ≤-minimal change of Γ by △.

Key words:description logics;belief revision;R-calculus;pseudo-subconcepts;≤-minimal change

Get Citation

王雨晖,眭跃飞.描述逻辑ALC中关于伪子概念极小改变的R-演算.软件学报,2019,30(12):3683-3693

Copy

Article Metrics

Abstract:
PDF:
HTML:
Cited by:

History

Received:December 26,2017
Revised:March 17,2018
Adopted:
Online: December 05,2019
Published:

You are the first2038162Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address：4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code：100190
Phone：010-62562563 Fax：010-62562533 Email：jos@iscas.ac.cn
Technical Support：Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063

微信服务号

微信订阅号

Get Citation

Share

微信扫一扫：分享

Article Metrics

History