Circumscription is one of the main approaches for defining non-monotonic
description logics (DLs). While the decidability and complexity of traditional
reasoning tasks such as satisfiability of circumscribed DL knowledge bases
(KBs) is well understood, for evaluating conjunctive queries (CQs) and unions
thereof (UCQs), not even decidability had been established. In this paper, we
prove decidability of (U)CQ evaluation on circumscribed DL KBs and obtain a
rather complete picture of both the combined complexity and the data
complexity, for DLs ranging from ALCHIO via EL to various versions of DL-Lite.
We also study the much simpler atomic queries (AQs).

本文证明了在围绕述及 DL 知识库上进行的 (U) CQ 评估的可决定性，并获得了从 ALCHIO 通过 EL 到各种版本的 DL-Lite 等各种 DL 的组合复杂性和数据复杂性的相当完整的图片。

查询约简描述逻辑知识库

Querying Circumscribed Description Logic Knowledge Bases

Circumscription and logic programs under the stable model semantics are two
well-known nonmonotonic formalisms. The former has served as a basis of
classical logic based action formalisms, such as the situation calculus, the
event calculus and temporal action logics; the latter has served as a basis of
a family of action languages, such as language A and several of its
descendants. Based on the discovery that circumscription and the stable model
semantics coincide on a class of canonical formulas, we reformulate the
situation calculus and the event calculus in the general theory of stable
models. We also present a translation that turns the reformulations further
into answer set programs, so that efficient answer set solvers can be applied
to compute the situation calculus and the event calculus.

通过发现究竟为何 circumscription 和 stable model semantics 在某些情况下意义相同，本文利用普通稳定模型理论重新阐述了 situation calculus 和 event calculus，并完成了进一步的翻译，将其转化为应用高效答案集求解器来计算

在稳定模型和答案集规划中重构情境演算和事件演算

Reformulating the Situation Calculus and the Event Calculus in the  General Theory of Stable Models and in Answer Set Programming

As fragments of first-order logic, Description logics (DLs) do not provide
nonmonotonic features such as defeasible inheritance and default rules. Since
many applications would benefit from the availability of such features, several
families of nonmonotonic DLs have been developed that are mostly based on
default logic and autoepistemic logic. In this paper, we consider
circumscription as an interesting alternative approach to nonmonotonic DLs
that, in particular, supports defeasible inheritance in a natural way. We study
DLs extended with circumscription under different language restrictions and
under different constraints on the sets of minimized, fixed, and varying
predicates, and pinpoint the exact computational complexity of reasoning for
DLs ranging from ALC to ALCIO and ALCQO. When the minimized and fixed
predicates include only concept names but no role names, then reasoning is
complete for NExpTime^NP. It becomes complete for NP^NExpTime when the number
of minimized and fixed predicates is bounded by a constant. If roles can be
minimized or fixed, then complexity ranges from NExpTime^NP to undecidability.

本文中，我们将关注于异常演绎的一种替代方法：减缩并研究经过限制的 DLs，在 ALC 到 ALCIO 和 ALCQO 之间寻找出推理的确切计算复杂度，范围从 NExpTime^NP 到不可判定。

描述逻辑中限缩的复杂性

The Complexity of Circumscription in DLs

NP-SPEC is a language for specifying problems in NP in a declarative way.
Despite the fact that the semantics of the language was given by referring to
Datalog with circumscription, which is very close to ASP, so far the only
existing implementations are by means of ECLiPSe Prolog and via Boolean
satisfiability solvers. In this paper, we present translations from NP-SPEC
into various forms of ASP and analyze them. We also argue that it might be
useful to incorporate certain language constructs of NP-SPEC into mainstream
ASP.

本文提出了 NP-SPEC 语言，它是一种用于以声明方式指定 NP 问题的语言。我们将 NP-SPEC 翻译成各种形式的 ASP 并进行分析。此外，我们认为将 NP-SPEC 的某些语言内部结构合并到主流 ASP 中可能会很有用。