Abstract. Generalization problems arise in many branches of artificial intelli-gence: machine learning, analogical and case-based reasoning, cognitive mod-eling, knowledge discovery, etc. Anti-unification is a technique used often to solve generalization problems. In this paper we describe an open-source library of some newly developed anti-unification algorithms in various theories: for first-and second-order unranked terms, higher-order patterns, and nominal terms.
We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which...
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. T...
A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitu...
Abstract. Generalization problems arise in many branches of artificial intelli-gence: machine learni...
We study nominal anti-unification, which is concerned with computing least general generalizations f...
We study nominal anti-unification, which is concerned with computing least general generaliza-tions ...
The anti-unification problem is concerned with finding a generalization for two input examples. The ...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. T...
AbstractGeneralization, also called anti-unification, is the dual of unification. Given terms t and ...
We present a rule-based Huet\u27s style anti-unification algorithm for simply-typed lambda-terms in ...
In this paper some improvements for the basic algorithm for anti-unification are presented. The stan...
We study nominal anti-unification, which is concerned with computing least general generalizations f...
We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which...
We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which...
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. T...
A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitu...
Abstract. Generalization problems arise in many branches of artificial intelli-gence: machine learni...
We study nominal anti-unification, which is concerned with computing least general generalizations f...
We study nominal anti-unification, which is concerned with computing least general generaliza-tions ...
The anti-unification problem is concerned with finding a generalization for two input examples. The ...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
209 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1993.Unification is central to aut...
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. T...
AbstractGeneralization, also called anti-unification, is the dual of unification. Given terms t and ...
We present a rule-based Huet\u27s style anti-unification algorithm for simply-typed lambda-terms in ...
In this paper some improvements for the basic algorithm for anti-unification are presented. The stan...
We study nominal anti-unification, which is concerned with computing least general generalizations f...
We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which...
We present a rule-based Huet’s style anti-unification algorithm for simply typed lambda-terms, which...
We study anti-unification for unranked terms and hedges that may contain term and hedge variables. T...
A term t is called a template of terms t 1 and t 2 iff t 1∈=∈tη 1 and t 2∈= ∈tη 2, for some substitu...