偏好逻辑中的单调性和持久性
Monotonicity and Persistence in Preferential Logics
摘要：
人工智能的许多逻辑的一个重要特征是它们的非单调性。这意味着在前提中加入一个公式可以使某些结果无效。然而，可能存在这样一些公式，它们总是可以安全地加到前提上而不破坏任何结果：我们说它们尊重单调性。同样，可能有一些公式，当它们是一个结果时，当把任何公式加到前提上时，它们不会失效：我们称它们为保守的。我们研究这两类公式的优惠逻辑，并表明，他们是密切相关的公式，其真值沿（优惠）有序保存。我们将考虑一些偏好逻辑作为例证，并证明它们的句法特征结果。本文的结果可以提高优先逻辑定理证明器的效率。
英文摘要：
An important characteristic of many logics for Artificial Intelligence is their nonmonotonicity. This means that adding a formula to the premises can invalidate some of the consequences. There may, however, exist formulae that can always be safely added to the premises without destroying any of the consequences: we say they respect monotonicity. Also, there may be formulae that, when they are a consequence, can not be invalidated when adding any formula to the premises: we call them conservative. We study these two classes of formulae for preferential logics, and show that they are closely linked to the formulae whose truth-value is preserved along the (preferential) ordering. We will consider some preferential logics for illustration, and prove syntactic characterization results for them. The results in this paper may improve the efficiency of theorem provers for preferential logics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
