arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2407.15510cs.AIcs.DMcs.LOcs.SC
收藏

代数反统一

Algebraic anti-unification

Vienna University of Technology(维也纳技术大学)

Christian Antić

AI总结:

本文在泛代数的一般框架下提出代数反统一理论,通过引入代数泛化序和最小泛化概念,建立基本结构性质,并利用自动机理论研究有限一元代数和有限代数中的可计算性。

摘要:

抽象是人类和人工智能的关键,因为它允许人们识别原本不同对象或情境中的共同结构。反统一(或泛化)是理论计算机科学和人工智能中研究抽象的分支,已在归纳逻辑编程、程序综合和类比推理等领域得到应用。迄今为止,反统一几乎完全从语法角度进行研究。在本文中,我们在泛代数的一般框架下开创了反统一的代数(即语义)理论,从而将反统一从基于项的表示扩展到任意代数,并超越等式理论。特别地,我们引入了代数泛化序和最小泛化泛化的概念,建立了基本结构性质,证明了与同态和同构的兼容性,并通过自动机理论方法研究了有限一元代数和有限代数中的可计算性。

英文摘要:

Abstraction is key to human and artificial intelligence as it allows one to identify common structure in otherwise distinct objects or situations. Anti-unification (or generalization) is the branch of theoretical computer science and artificial intelligence that studies abstraction and has found applications in areas such as inductive logic programming, program synthesis, and analogy-making. To date, anti-unification has been studied almost exclusively from a syntactic perspective. In this paper, we initiate an algebraic (i.e.\ semantic) theory of anti-unification in the general setting of universal algebra, thereby extending anti-unification from term-based representations to arbitrary algebras and beyond equational theories. In particular, we introduce the notions of algebraic generalization ordering and minimally general generalization, establish basic structural properties, prove compatibility with homomorphisms and isomorphisms, and investigate computability in finite unary algebras and finite algebras via automata-theoretic methods.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑