发帖
雷达卡
摘要翻译：
最近的一些论文讨论了在基于模型的方法下更新以描述逻辑表示的知识库的实例级别的问题。本文通过回顾80年代基于公式更新的一些研究工作，特别是WIDTIO（当有疑问时，抛出）方法，介绍了一种基于公式的方法来解决这个问题。我们证明了我们的运算符具有理想的性质，包括根据该运算符进行的插入和删除都可以在用于原始KB的DL中表示。对于用DL-lite族中最具表现力的描述逻辑表示的实例级知识库的演化，我们给出了多项式时间算法。
---
英文标题：
《On the evolution of the instance level of DL-lite knowledge bases》
---
作者：
Maurizio Lenzerini, Domenico Fabio Savo
---
最新提交年份：
2011
---
分类信息：
一级分类：Computer Science 计算机科学
二级分类：Artificial Intelligence 人工智能
分类描述：Covers all areas of AI except Vision, Robotics, Machine Learning, Multiagent Systems, and Computation and Language (Natural Language Processing), which have separate subject areas. In particular, includes Expert Systems, Theorem Proving (although this may overlap with Logic in Computer Science), Knowledge Representation, Planning, and Uncertainty in AI. Roughly includes material in ACM Subject Classes I.2.0, I.2.1, I.2.3, I.2.4, I.2.8, and I.2.11.
涵盖了人工智能的所有领域，除了视觉、机器人、机器学习、多智能体系统以及计算和语言（自然语言处理），这些领域有独立的学科领域。特别地，包括专家系统，定理证明（尽管这可能与计算机科学中的逻辑重叠），知识表示，规划，和人工智能中的不确定性。大致包括ACM学科类I.2.0、I.2.1、I.2.3、I.2.4、I.2.8和I.2.11中的材料。
--
---
英文摘要：
Recent papers address the issue of updating the instance level of knowledge bases expressed in Description Logic following a model-based approach. One of the outcomes of these papers is that the result of updating a knowledge base K is generally not expressible in the Description Logic used to express K. In this paper we introduce a formula-based approach to this problem, by revisiting some research work on formula-based updates developed in the '80s, in particular the WIDTIO (When In Doubt, Throw It Out) approach. We show that our operator enjoys desirable properties, including that both insertions and deletions according to such operator can be expressed in the DL used for the original KB. Also, we present polynomial time algorithms for the evolution of the instance level knowledge bases expressed in the most expressive Description Logics of the DL-lite family.
---
PDF链接：
https://arxiv.org/pdf/1104.4053
京公网安备 11010802022788号
