Generalization-baed similarity
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915290279837696 |
|---|---|
| author | Antić, Christian |
| author_facet | Antić, Christian |
| contents | Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the observation that sets of generalizations encode important properties of elements. We show that similarity defined in this way has appealing mathematical properties. As we construct our notion of similarity from first principles using only elementary concepts of universal algebra, to convince the reader of its plausibility, we show that it can model fundamental relations occurring in mathematics and be naturally embedded into first-order logic via model-theoretic types. Finally, we sketch some potential applications to theoretical computer science and artificial intelligence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_10096 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Generalization-baed similarity Antić, Christian Artificial Intelligence Logic in Computer Science Detecting and exploiting similarities between seemingly distant objects is without doubt an important human ability. This paper develops \textit{from the ground up} an abstract algebraic and qualitative notion of similarity based on the observation that sets of generalizations encode important properties of elements. We show that similarity defined in this way has appealing mathematical properties. As we construct our notion of similarity from first principles using only elementary concepts of universal algebra, to convince the reader of its plausibility, we show that it can model fundamental relations occurring in mathematics and be naturally embedded into first-order logic via model-theoretic types. Finally, we sketch some potential applications to theoretical computer science and artificial intelligence. |
| title | Generalization-baed similarity |
| topic | Artificial Intelligence Logic in Computer Science |
| url | https://arxiv.org/abs/2302.10096 |