Bounded Cognitive Resources and Arbitrary Domains
Paper in proceeding, 2015

When Alice in Wonderland fell down the rabbit hole, she entered a world that was completely new to her. She gradually explored that world by observing, learning, and reasoning. This paper presents a simple system Alice in Wonderland that operates analogously. We model Alice’s Wonderland via a general notion of domain and Alice herself with a computational model including an evolving belief set along with mechanisms for observing, learning, and reasoning. The system operates autonomously, learning from arbitrary streams of facts from symbolic domains such as English grammar, propositional logic, and simple arithmetic. The main conclusion of the paper is that bounded cognitive resources can be exploited systematically in artificial general intelligence for constructing general systems that tackle the combinatorial explosion problem and operate in arbitrary symbolic domains.

Autonomous agent

Arbitrary domain

Bounded rationality


Abdul Rahim Nizamani

University of Gothenburg

Jonas Juel

University of Gothenburg

Chalmers, Mathematical Sciences

Ulf Persson

University of Gothenburg

Chalmers, Mathematical Sciences, Mathematics

Claes Strannegård

Chalmers, Applied Information Technology (Chalmers), Cognition and Communication

University of Gothenburg

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 9205 166-176
978-3-319-21365-1 (ISBN)

Subject Categories


Computer Science





More information