transparent gif


Ej inloggad.

Göteborgs universitets publikationer

Symbolic Reasoning with Bounded Cognitive Resources

Författare och institution:
Claes Strannegård (Institutionen för filosofi, lingvistik och vetenskapsteori & Institutionen för tillämpad informationsteknologi (Chalmers), Chalmers); Abdul Rahim Nizamani (Institutionen för tillämpad informationsteknologi (GU)); Fredrik Engström (Institutionen för filosofi, lingvistik och vetenskapsteori); Olle Häggström (Institutionen för matematiska vetenskaper, Chalmers/GU)
Publicerad i:
36th Annual Conference of the Cognitive Science Society,
Konferensbidrag - refereegranskat abstract
Fulltextlänk (lokalt arkiv):
Sammanfattning (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.
Ämne (baseras på Högskoleverkets indelning av forskningsämnen):
Filosofi, etik och religion ->
Filosofi ->
Postens nummer:
Posten skapad:
2014-06-17 10:22
Posten ändrad:
2014-10-28 13:31

Visa i Endnote-format

Göteborgs universitet • Tel. 031-786 0000
© Göteborgs universitet 2007