To the top

Page Manager: Webmaster
Last update: 9/11/2012 3:13 PM

Tell a friend about this page
Print version

Symbolic Reasoning with B… - University of Gothenburg, Sweden Till startsida
Sitemap
To content Read more about how we use cookies on gu.se

Symbolic Reasoning with Bounded Cognitive Resources

Conference contribution
Authors Claes Strannegård
Abdul Rahim Nizamani
Fredrik Engström
Olle Häggström
Published in 36th Annual Conference of the Cognitive Science Society
Publication year 2014
Published at Department of Mathematical Sciences
Department of Applied Information Technology (GU)
Department of Philosophy, Linguistics and Theory of Science
Language en
Links https://gup.ub.gu.se/file/138471
Subject categories Logic

Abstract

We present a multi-domain computational model for symbolic reasoning that was designed with the aim of matching human performance. The computational model is able to reason by deduction, induction, and abduction. It begins with an arbitrary theory in a given domain and gradually extends this theory as new regularities are learned from positive and negative examples. At the core of the computational model is a cognitive model with bounded cognitive resources. The combinatorial explosion problem, which frequently arises in inductive learning, is tackled by searching for solutions inside this cognitive model only. By way of example, we show that the computational model can learn elements of two different domains, namely arithmetic and English grammar.

Page Manager: Webmaster|Last update: 9/11/2012
Share:

The University of Gothenburg uses cookies to provide you with the best possible user experience. By continuing on this website, you approve of our use of cookies.  What are cookies?