R-calculus for Pseudo-subconcept-ninimal Change in Description Logic ALC
Author:
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
  • |
  • Related
  • |
  • 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 TDL which is sound and complete with respect to ≤-minimal change such that |Γ is reduced to a theory Θ in TDL (denoted by ├TDL |Γ,Θ) if and only if Θ is a ≤-minimal change of Γ by .

    Reference
    Related
    Cited by
Get Citation

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

Copy
Share
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 firstVisitors
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