Semantic Embeddings in Semilattices

TL;DR

This paper introduces a formal framework for semantic embeddings within semilattices, enabling the encoding and solving of complex problems like Sudoku and Hamiltonian paths using algebraic models.

Contribution

It provides a formal definition of semantic embeddings in semilattices and demonstrates their application to solving classical computational problems.

Findings

Every solution corresponds to a model atomized by irreducible atoms.

Semantic embeddings can encode problems like N-Queen, Sudoku, and Hamiltonian Path.

Finite atomized semilattices facilitate analysis of embeddings and solutions.

Abstract

To represent anything from mathematical concepts to real-world objects, we have to resort to an encoding. Encodings, such as written language, usually assume a decoder that understands a rich shared code. A semantic embedding is a form of encoding that assumes a decoder with no knowledge, or little knowledge, beyond the basic rules of a mathematical formalism such as an algebra. Here we give a formal definition of a semantic embedding in a semilattice which can be used to resolve machine learning and classic computer science problems. Specifically, a semantic embedding of a problem is here an encoding of the problem as sentences in an algebraic theory that extends the theory of semilattices. We use the recently introduced formalism of finite atomized semilattices to study the properties of the embeddings and their finite models. For a problem embedded in a semilattice, we show that every solution has a model atomized by an irreducible subset of the non-redundant atoms of the freest model of the embedding. We give examples of semantic embeddings that can be used to find solutions for the N-Queen's completion, the Sudoku, and the Hamiltonian Path problems.