Modeling the suppression task under weak completion and well-founded semantics
نویسندگان
چکیده
Formal approaches that aim at representing human reasoning should be evaluated based on how humans actually reason. One way in doing so, is to investigate whether psychological findings of human reasoning patterns are represented in the theoretical model. The computational logic approach discussed here is the so called weak completion semantics which is based on the three-valued Lukasiewicz logic. We explain how this approach adequately models Byrne’s suppression task, a psychological study where the experimental results show that participants’ conclusions systematically deviate from the classical logically correct answers. As weak completion semantics is a novel technique in the field of Computational Logic, it is important to examine how it corresponds to other already established non-monotonic approaches. For this purpose we investigate the relation of weak completion with respect to completion and three-valued stable model semantics. In particular, we show that well-founded semantics, a widely accepted approach in the field of non-monotonic reasoning, corresponds to weak completion semantics for a specific class of modified programs.
منابع مشابه
A Computational Logic Approach to the Abstract and the Social Case of the Selection Task
Previous results have shown that weak completion semantics based on three-valued Łukasiewicz logic can adequately represent and explain human behavior in the suppression task. Weak completion semantics corresponds to well-founded semantics for tight logic programs. In this paper we apply both semantics to the selection task – probably the most famous and best investigated research paradigm in t...
متن کاملFrom Logic Programming to Human Reasoning: How to be Artificially Human
Results of psychological experiments have shown that humans make assumptions, which are not necessarily valid, that they are influenced by their background knowledge and that they reason non-monotonically. These observations show that classical logic does not seem to be adequate for modeling human reasoning. Instead of assuming that humans do not reason logically at all, we take the view that h...
متن کاملWeak Completion Semantics and its Applications in Human Reasoning
I present a logic programming approach based on the weak completions semantics to model human reasoning tasks, and apply the approach to model the suppression task, the selection task as well as the belief-bias e↵ect, to compute preferred mental models of spatial reasoning tasks and to evaluate indicative as well as counterfactual conditionals.
متن کاملThe Weak Completion Semantics
This is a gentle introduction to the weak completion semantics, a novel cognitive theory which has been successfully applied to a number of human reasoning tasks. In this paper we do not focus on formalities but rather on principles and examples. The reader is assumed to be familiar with classical propositional logic and the suppression task.
متن کاملIntegrating the Completion and the WellFounded
The three most well-known semantics for negation in the logic programming framework are Clark's completion Cla78], the stable semantics GL88], and the well-founded semantics vGRS91]. Clark's completion (COMP) was the rst proposal to give a formal meaning to negation as failure. However, it is now accepted that COMP does not always captures the meaning of a logic program. Despite its computation...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Applied Non-Classical Logics
دوره 24 شماره
صفحات -
تاریخ انتشار 2014