Zetetic Agent的可废止演算
A Defeasible Calculus for Zetetic Agents
摘要：
对可废止推理的研究将认识论者与人工智能领域的工作者联系在一起，部分原因是两者都对认识理性感兴趣。虽然传统上认为认知理性支配着信念的形成和持有，但认知理性也可能适用于与我们的核心认知探究实践相关的疑问态度，例如疑惑，调查和好奇。由于一般的智能系统应该能够进行理性的询问，人工智能研究人员对管理疑问态度的规范自然感兴趣。在最近的讨论之后，我们使用“探究性”一词来指与探究能力相关的属性和规范。在本文中，我们认为，zetetic规范可以通过可废止的推理和问题-a.k.一个色情推理-以类似的方式规范的认识理性表示的可废止的推理规则建模。我们提供了一个可容纳的独特功能的“erotetic失败”，并表现出所需的计算属性，通知设计的zetetic代理商的计算演算。这里提出的演算是Millson（2019）中提出的演算的改进版本，扩展到涵盖一类新的可废止的色情推理。
英文摘要：
The study of defeasible reasoning unites epistemologists with those working in AI, in part, because both are interested in epistemic rationality. While it is traditionally thought to govern the formation and (with)holding of beliefs, epistemic rationality may also apply to the interrogative attitudes associated with our core epistemic practice of inquiry, such as wondering, investigating, and curiosity. Since generally intelligent systems should be capable of rational inquiry, AI researchers have a natural interest in the norms that govern interrogative attitudes. Following its recent coinage, we use the term "zetetic" to refer to the properties and norms associated with the capacity to inquire. In this paper, we argue that zetetic norms can be modeled via defeasible inferences to and from questions---a.k.a erotetic inferences---in a manner similar to the way norms of epistemic rationality are represented by defeasible inference rules. We offer a sequent calculus that accommodates the unique features of "erotetic defeat" and that exhibits the computational properties needed to inform the design of zetetic agents. The calculus presented here is an improved version of the one presented in Millson (2019), extended to cover a new class of defeasible erotetic inferences.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
