为ASP添加条件推理能力，支持基于典型性的逻辑推断。
A framework for Conditional Reasoning in Answer Set Programming
- 结合条件逻辑与ASP程序，用多优先级语义实现条件推理
- 将条件蕴含关系编码为ASP，提供计算复杂度上界
- 适合研究非单调逻辑与智能推理的学者
本文提出一种条件答案集编程框架（Conditional ASP），用于定义答案集编程（ASP）的条件扩展。该方法基于带有典型性的条件逻辑，将条件知识库与ASP程序结合，实现对程序答案集的条件推理。形式化基于多优先级语义，以KLM优先语义为特例。条件蕴含关系被编码为ASP形式，同时给出了计算复杂度的上界。
原文摘要 · Abstract (English)
In this paper we introduce a Conditional Answer Set Programming framework (Conditional ASP) for the definition of conditional extensions of Answer Set Programming (ASP). The approach builds on a conditional logic with typicality, and on the combination of a conditional knowledge base with an ASP program, and allows for conditional reasoning over the answer sets of the program. The formalism relies on a multi-preferential semantics, and on the KLM preferential semantics, as a special case. Conditional entailment is encoded in ASP and a complexity upper-bound is provided.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。