Algebraic anti-unification
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Inductive Learning of Robot Task Knowledge from Raw Data and Online Expert Feedback
Learning Rules Explaining Interactive Theorem Proving Tactic Prediction
Learning Robust Reward Machines from Noisy Labels
Relational decomposition for program synthesis
AutoCoder: Enhancing Code Large Language Model with \textsc{AIEV-Instruct}
Learning big logical rules by joining small rules
토론
이 논문과 연결된 포럼 글이 아직 없습니다.