The bionic DBMS is coming, but what will it look like?
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Anti-unification guarantees the existence of a term which is an explicit representation of the most specific generalization of a collection of terms. This provides a formal basis for learning from examples. Here we address the dual problem of computing a generalization given a set of counter examples. Unlike learning from examples an explicit, finite representation for the generalization does not always exist. We show that the problem is decidable by providing an algorithm which, given an implicit representation will return a finite explicit representation or report that none exists. Applications of this result to the problem of negation as failure and to the representation of solutions to systems of equations and inequations are also mentioned. © 1987 D. Reidel Publishing Company.
Ryan Johnson, Ippokratis Pandis
CIDR 2013
Robert Farrell, Rajarshi Das, et al.
AAAI-SS 2010
George Saon
SLT 2014
Rei Odaira, Jose G. Castanos, et al.
IISWC 2013