Iterated Belief Revision Under Resource Constraints: Logic as Geometry

by   Dan P. Guralnik, et al.

We propose a variant of iterated belief revision designed for settings with limited computational resources, such as mobile autonomous robots. The proposed memory architecture---called the universal memory architecture (UMA)---maintains an epistemic state in the form of a system of default rules similar to those studied by Pearl and by Goldszmidt and Pearl (systems Z and Z^+). A duality between the category of UMA representations and the category of the corresponding model spaces, extending the Sageev-Roller duality between discrete poc sets and discrete median algebras provides a two-way dictionary from inference to geometry, leading to immense savings in computation, at a cost in the quality of representation that can be quantified in terms of topological invariants. Moreover, the same framework naturally enables comparisons between different model spaces, making it possible to analyze the deficiencies of one model space in comparison to others. This paper develops the formalism underlying UMA, analyzes the complexity of maintenance and inference operations in UMA, and presents some learning guarantees for different UMA-based learners. Finally, we present simulation results to illustrate the viability of the approach, and close with a discussion of the strengths, weaknesses, and potential development of UMA-based learners.


page 1

page 2

page 3

page 4


Rules, Belief Functions and Default Logic

This paper describes a natural framework for rules, based on belief func...

Choice-free Topological Duality for Implicative Lattices and Heyting Algebras

We develop a common semantic framework for the interpretation both of 𝐈𝐏...

Universal Memory Architectures for Autonomous Machines

We propose a self-organizing memory architecture for perceptual experien...

An elementary belief function logic

Non-additive uncertainty theories, typically possibility theory, belief ...

Linear Time Recognition Algorithms for Topological Invariants in 3D

In this paper, we design linear time algorithms to recognize and determi...

Difference-restriction algebras of partial functions with operators: discrete duality and completion

We exhibit an adjunction between a category of abstract algebras of part...

Please sign up or login with your details

Forgot password? Click here to reset