arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2311.04412cs.AIcs.LO
收藏

Answer Set Programming 中的人类条件推理

Human Conditional Reasoning in Answer Set Programming

Wakayama University(和歌山大学)

Chiaki Sakama

AI总结:

本文在 Answer Set Programming 中实现 AC、DA 和 DC 等人类条件推理,引入八种 completion 并给出其语义,研究形式属性并应用于认知心理学刻画及 AI 常识推理。

摘要:

给定条件句“P=>Q”(如果 P 则 Q)及相应事实,在人类推理中可观察到四种不同类型的推理。肯定前件(AA)(或 modus ponens)由 P 推出 Q;肯定后件(AC)由 Q 推出 P;否定前件(DA)由 -P 推出 -Q;否定后件(DC)(或 modus tollens)由 -Q 推出 -P。其中,AA 和 DC 在逻辑上有效,而 AC 和 DA 在逻辑上无效,常被称为逻辑谬误。尽管如此,人类在日常生活中常将 AC 或 DA 作为语用推理执行。本文在 answer set programming 中实现 AC、DA 和 DC 推理。引入八种不同类型的 completion,其语义由 answer sets 给出。我们研究形式属性并刻画认知心理学中的人类推理任务。这些 completion 也应用于 AI 中的常识推理。

英文摘要:

Given a conditional sentence "P=>Q" (if P then Q) and respective facts, four different types of inferences are observed in human reasoning. Affirming the antecedent (AA) (or modus ponens) reasons Q from P; affirming the consequent (AC) reasons P from Q; denying the antecedent (DA) reasons -Q from -P; and denying the consequent (DC) (or modus tollens) reasons -P from -Q. Among them, AA and DC are logically valid, while AC and DA are logically invalid and often called logical fallacies. Nevertheless, humans often perform AC or DA as pragmatic inference in daily life. In this paper, we realize AC, DA and DC inferences in answer set programming. Eight different types of completion are introduced and their semantics are given by answer sets. We investigate formal properties and characterize human reasoning tasks in cognitive psychology. Those completions are also applied to commonsense reasoning in AI.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑