<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T21:29:31Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/24052" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/24052</identifier><datestamp>2026-08-26T13:54:09Z</datestamp><setSpec>com_10012_9924</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9930</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author">Joffe, Isaac</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2026-08-26T13:54:09Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2026-08-26</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2026-08-17</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">https://hdl.handle.net/10012/24052</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract">The Abstraction and Reasoning Corpus for Artificial General Intelligence (ARC-AGI) is a popular artificial intelligence (AI) benchmark comprising abstract reasoning tasks that test fluid intelligence in a generative, few-shot setting. Although humans solve ARC-AGI with ease, it remains extremely difficult for all but the most advanced AI systems.

Inspired by methods for modelling biological intelligence spanning psychology to neuroscience, we present a general framework for automated solving of ARC-AGI tasks as well as two specific ARC-AGI solvers that implement our framework. Our cognitive inspiration draws on dual process theory (System 1 and System 2) and vector symbolic algebras (VSAs), and our solvers apply neurosymbolic, object-centric program synthesis.

The first of our two ARC-AGI solvers, Solver 1, uses VSAs to represent objects. Solver 1 structures its solutions to ARC-AGI tasks as sets of conditional neurosymbolic rules implemented in a flexible domain-specific language (DSL), and synthesizes its solutions using System 1, VSA-enabled sample-efficient neural learning within System 2, VSA-powered heuristic search. Overall, Solver 1 scores 10.8% on ARC-AGI-1-Train and 3.0% on ARC-AGI-1-Eval. Additionally, Solver 1 scores 94.5% and 83.1% on the simpler Sort-of-ARC and 1D-ARC benchmarks—the latter of which outperforms GPT-4 without any computationally expensive pre-training.

The second of our two ARC-AGI solvers, Solver 2, uses VSAs to represent programs. Solver 2 structures its solutions to ARC-AGI tasks as sequential compositions of primitives implemented in a bespoke DSL, and synthesizes its solutions using System 1, VSA-powered neural guidance for System 2, VSA-mediated procedural reasoning. Overall, Solver 2 scores 13.5% on ARC-AGI-1-Train and 3.5% on ARC-AGI-1-Eval. Additionally, our best version of Solver 2 is 7 times more efficient than a naive version of Solver 2, and 235 times more efficient than brute-force search.

When combined into an ensemble, our two solvers score 21.0% on ARC-AGI-1-Train and 6.3% on ARC-AGI-1-Eval. Importantly, we believe that we are the first to apply VSAs to ARC-AGI and, in doing so, have developed two of the most efficient, interpretable, and cognitively plausible ARC-AGI solvers yet.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="title">Abstract Reasoning with Vector Symbolic Algebras</dim:field>
   <dim:field mdschema="dc" element="type">Master Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department">David R. Cheriton School of Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="discipline">Computer Science</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree">Master of Mathematics</dim:field>
   <dim:field mdschema="uws-etd" element="embargo" qualifier="terms">0</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Eliasmith, Chris</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1">Faculty of Mathematics</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>