Logics and Networks for Human Reasoning

We propose to model human reasoning tasks using completed logic programs interpreted under the three-valued ***ukasiewicz semantics. Given an appropriate immediate consequence operator, completed logic programs admit a least model, which can be computed by iterating the consequence operator. Reasoning is then performed with respect to the least model. The approach is realized in a connectionist setting.