关于不可靠行为的推理
Reasoning about Unreliable Actions
摘要：
我们分析了哲学家戴维森的语义的行动，使用强类型的逻辑与上下文之间的行动结果的偏方程组。这提供了一个清晰和优雅的处理推理的行动，类似于赖特的工作人工智能。我们定义了一个演算的逻辑，证明削减消除，并给出了一个语义的基础上纤维化的部分carbohydrate类别：我们给这样的纤维化的结构理论。对于割消的证明，必须证明lax逗号对象的存在性，并给出了部分范畴的域纤维化条件。
英文摘要：
We analyse the philosopher Davidson's semantics of actions, using a strongly typed logic with contexts given by sets of partial equations between the outcomes of actions. This provides a perspicuous and elegant treatment of reasoning about action, analogous to Reiter's work on artificial intelligence. We define a sequent calculus for this logic, prove cut elimination, and give a semantics based on fibrations over partial cartesian categories: we give a structure theory for such fibrations. The existence of lax comma objects is necessary for the proof of cut elimination, and we give conditions on the domain fibration of a partial cartesian category for such comma objects to exist.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
