Choice logics constitute a family of propositional logics and are used for the representation of preferences, with especially qualitative choice logic (QCL) being an established formalism with numerous applications in artificial intelligence. While computational properties and applications of choice logics have been studied in the literature, only few results are known about the proof-theoretic aspects of their use. We propose a sound and complete sequent calculus for preferred model entailment in QCL, where a formula F is entailed by a QCL-theory T if F is true in all preferred models of T. The calculus is based on labeled sequent and refutation calculi, and can be easily adapted for different purposes. For instance, using the calculus as a cornerstone, calculi for other choice logics such as conjunctive choice logic (CCL) and lexicographic choice logic (LCL) can be obtained in a straightforward way.

选择逻辑构成了一系列命题逻辑，用于表示偏好，特别是定性选择逻辑（QCL）是一种既定的形式主义，在人工智能中有许多应用。虽然文献中已经研究了选择逻辑的计算特性和应用，但关于其使用的证明理论方面的结果却很少。我们为 QCL 中的首选模型蕴涵提出了一种健全且完整的序列演算，其中如果 F在T的所有首选模型中都为真，则 公式 F由 QCL 理论 T蕴涵。该演算基于标记的顺序演算和反驳演算，并且可以轻松地适应不同的目的。例如，使用微积分作为基石，可以以简单的方式获得其他选择逻辑（例如合取选择逻辑（CCL）和词典选择逻辑（LCL））的演算。