Algebraic anti-unification

• URL: http://arxiv.org/abs/2407.15510v1
• Date: Mon, 22 Jul 2024 09:49:46 GMT
• Title: Algebraic anti-unification
• Authors: Christian Antić,
• Abstract summary: Abstraction is key to human and artificial intelligence as it allows one to see common structure in otherwise distinct objects or situations. Anti-unification (or generalization) is textitthe part of theoretical computer science and AI studying abstraction.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Abstraction is key to human and artificial intelligence as it allows one to see common structure in otherwise distinct objects or situations and as such it is a key element for generality in AI. Anti-unification (or generalization) is \textit{the} part of theoretical computer science and AI studying abstraction. It has been successfully applied to various AI-related problems, most importantly inductive logic programming. Up to this date, anti-unification is studied only from a syntactic perspective in the literature. The purpose of this paper is to initiate an algebraic (i.e. semantic) theory of anti-unification within general algebras. This is motivated by recent applications to similarity and analogical proportions.

Related papers

• Analogical proportions II [0.0]
  Analogical reasoning is the ability to detect parallels between two seemingly distant objects or situations. Analogical proportions are expressions of the form $a$ is to $b$ what $c$ is to $d$'' at the core of analogical reasoning.
  arXiv  Detail & Related papers  (2024-05-22T09:02:12Z)
• An Encoding of Abstract Dialectical Frameworks into Higher-Order Logic [57.24311218570012]
  This approach allows for the computer-assisted analysis of abstract dialectical frameworks. Exemplary applications include the formal analysis and verification of meta-theoretical properties.
  arXiv  Detail & Related papers  (2023-12-08T09:32:26Z)
• Equational Anti-Unification over Absorption Theories [1.124958340749622]
  Anti-unification techniques have found uses within clone detection and automatic program repair methods. This paper considers anti-unification modulo pure absorption theories, i.e., some operators are associated with a special constant satisfying the axiom $f(x,varepsilon_f) approx f(varepsilon_f,x) approx varepsilon_f$. We provide a sound and complete rule-based algorithm for such theories. Furthermore, we show that anti-unification modulo absorption is infinitary.
  arXiv  Detail & Related papers  (2023-10-17T10:38:06Z)
• A Hybrid System for Systematic Generalization in Simple Arithmetic Problems [70.91780996370326]
  We propose a hybrid system capable of solving arithmetic problems that require compositional and systematic reasoning over sequences of symbols. We show that the proposed system can accurately solve nested arithmetical expressions even when trained only on a subset including the simplest cases.
  arXiv  Detail & Related papers  (2023-06-29T18:35:41Z)
• Generalization-baed similarity [0.0]
  We develop an abstract 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.
  arXiv  Detail & Related papers  (2023-02-13T14:48:59Z)
• Core and Periphery as Closed-System Precepts for Engineering General Intelligence [62.997667081978825]
  It is unclear if an AI system's inputs will be independent of its outputs, and, therefore, if AI systems can be treated as traditional components. This paper posits that engineering general intelligence requires new general systems precepts, termed the core and periphery.
  arXiv  Detail & Related papers  (2022-08-04T18:20:25Z)
• Learning Algebraic Representation for Systematic Generalization in Abstract Reasoning [109.21780441933164]
  We propose a hybrid approach to improve systematic generalization in reasoning. We showcase a prototype with algebraic representation for the abstract spatial-temporal task of Raven's Progressive Matrices (RPM) We show that the algebraic representation learned can be decoded by isomorphism to generate an answer.
  arXiv  Detail & Related papers  (2021-11-25T09:56:30Z)
• On syntactically similar logic programs and sequential decompositions [0.0]
  Rule-based reasoning is an essential part of human intelligence prominently formalized in artificial intelligence research via logic programs. Describing complex objects as the composition of elementary ones is a common strategy in computer science and science in general. We show how similarity can be used to answer queries across different domains via a one-step reduction.
  arXiv  Detail & Related papers  (2021-09-11T15:22:17Z)
• Learning Algebraic Recombination for Compositional Generalization [71.78771157219428]
  We propose LeAR, an end-to-end neural model to learn algebraic recombination for compositional generalization. Key insight is to model the semantic parsing task as a homomorphism between a latent syntactic algebra and a semantic algebra. Experiments on two realistic and comprehensive compositional generalization demonstrate the effectiveness of our model.
  arXiv  Detail & Related papers  (2021-07-14T07:23:46Z)
• Relational reasoning and generalization using non-symbolic neural networks [66.07793171648161]
  Previous work suggested that neural networks were not suitable models of human relational reasoning because they could not represent mathematically identity, the most basic form of equality. We find neural networks are able to learn basic equality (mathematical identity), (2) sequential equality problems (learning ABA-patterned sequences) with only positive training instances, and (3) a complex, hierarchical equality problem with only basic equality training instances. These results suggest that essential aspects of symbolic reasoning can emerge from data-driven, non-symbolic learning processes.
  arXiv  Detail & Related papers  (2020-06-14T18:25:42Z)
• Analogical Proportions [0.0]
  This paper introduces an abstract framework of analogical proportions of the form $a$ is to $b$ what $c$ is to $d$' in the general setting of universal algebra. It turns out that our notion of analogical proportions has appealing mathematical properties. This paper is a first step towards a theory of analogical reasoning and learning systems with potential applications to fundamental AI-problems.
  arXiv  Detail & Related papers  (2020-06-04T13:44:36Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.