Artificial general intelligence through recursive data compression and grounded reasoning: a position paper

06/14/2015
by   Arthur Franz, et al.
0

This paper presents a tentative outline for the construction of an artificial, generally intelligent system (AGI). It is argued that building a general data compression algorithm solving all problems up to a complexity threshold should be the main thrust of research. A measure for partial progress in AGI is suggested. Although the details are far from being clear, some general properties for a general compression algorithm are fleshed out. Its inductive bias should be flexible and adapt to the input data while constantly searching for a simple, orthogonal and complete set of hypotheses explaining the data. It should recursively reduce the size of its representations thereby compressing the data increasingly at every iteration. Abstract Based on that fundamental ability, a grounded reasoning system is proposed. It is argued how grounding and flexible feature bases made of hypotheses allow for resourceful thinking. While the simulation of representation contents on the mental stage accounts for much of the power of propositional logic, compression leads to simple sets of hypotheses that allow the detection and verification of universally quantified statements. Abstract Together, it is highlighted how general compression and grounded reasoning could account for the birth and growth of first concepts about the world and the commonsense reasoning about them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/04/2012

Sciduction: Combining Induction, Deduction, and Structure for Verification and Synthesis

Even with impressive advances in automated formal methods, certain probl...
research
08/05/2023

A criterion for Artificial General Intelligence: hypothetic-deductive reasoning, tested on ChatGPT

We argue that a key reasoning skill that any advanced AI, say GPT-4, sho...
research
07/22/2021

Abstract Reasoning via Logic-guided Generation

Abstract reasoning, i.e., inferring complicated patterns from given obse...
research
05/25/2012

Measurability Aspects of the Compactness Theorem for Sample Compression Schemes

It was proved in 1998 by Ben-David and Litman that a concept space has a...
research
12/02/2019

Abstract Reasoning with Distracting Features

Abstraction reasoning is a long-standing challenge in artificial intelli...
research
01/16/2014

Grounding FO and FO(ID) with Bounds

Grounding is the task of reducing a first-order theory and finite domain...

Please sign up or login with your details

Forgot password? Click here to reset