Cognitive Science, Computational Logic, and Connectionism

Professor Steffen Hoeldobler (Technische Universitaet Dresden, Germany)

COMPUTER SCIENCE SEMINAR Logic and Computation

DATE: 2010-03-23
TIME: 15:30:00 - 16:30:00
LOCATION: NICTA - 7 London Circuit
CONTACT: JavaScript must be enabled to display this email address.

ABSTRACT:
There is certain evidence that three-valued logic programs under completion semantics can adequately capture human reasoning. In particular, the immediate consequence operator of such a logic program can be iterated until a fixed point is reached. This fixed point is the least model for the program and reasoning can be performed with respect to this model. I will present such programs, the operator, the computation of the fixed point / least model, will give a connectionist realization thereof, discuss various human reasoning episodes and show that they are adequately captured in this setting.

BIO:
See http://www.computational-logic.org/~sh/