Human Conditional Reasoning in Answer Set Programming
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Logical FallaciesSentencevalidMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
A framework for Conditional Reasoning in Answer Set Programming
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 ty…
Human Robot Collaborative Assembly Planning: An Answer Set Programming Approach
For planning an assembly of a product from a given set of parts, robots necessitate certain cognitive skills: high-level planning is needed to decide the order of actuation actions, while geometric reasoning is needed to…
Many-valued Argumentation, Conditionals and a Probabilistic Semantics for Gradual Argumentation
In this paper we propose a general approach to define a many-valued preferential interpretation of gradual argumentation semantics. The approach allows for conditional reasoning over arguments and boolean combination of …
P2S: Probabilistic Process Supervision for General-Domain Reasoning Question Answering
While reinforcement learning with verifiable rewards (RLVR) has advanced LLM reasoning in structured domains like mathematics and programming, its application to general-domain reasoning tasks remains challenging due to …
Reinforcement LearningReading ComprehensionQuestion AnsweringScalable Neural-Probabilistic Answer Set Programming
The goal of combining the robustness of neural networks and the expressiveness of symbolic methods has rekindled the interest in Neuro-Symbolic AI. Deep Probabilistic Programming Languages (DPPLs) have been developed for…
Probabilistic ProgrammingQuestion AnsweringVisual Question AnsweringVisual Question Answering (VQA)