Abstract
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.
Research performed while visiting from the: Dept. of Computer Science, University of Melbourne, Parkville 3052, Australia.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
K. Clark, Negation as Failure, Logic & Databases (Ed. H. Gallaire & J. Minker), Plenum Press, New York, 1978, 293–322.
A. Colmerauer, Equations and Inequations on Finite and Infinite Trees, FGCS'84 Proceedings, Nov. 1984.
G. Huet, Resolution d'Equations Dans Des Langages D'Ordre 1,2, ..., ω (These d'Etat), Universite de Paris VII, Dec. 1976.
G. Huet, Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM, Vol. 27, No. 4, Oct. 1980, 797–821.
J. Jaffar, J-L. Lassez & J. Lloyd, Completeness of the Negation-As-Failure Rule, IJCAI-83, 1983, pp 500–506.
J-L. Lassez & K. Marriott, Explicit Representation of Terms Defined by Counter Examples, Tech. Report, IBM Thomas J. Watson Lab.
J-L. Lassez, M.J. Maher & K. Marriott, Unification Revisited, Tech. Report, IBM Thomas J. Watson Lab., Forthcoming.
R.S. Michalski, A Theory and Methodology of Inductive Learning, Artificial Intelligence 20, 1983, 111–161.
T.M. Mitchell, Version Spaces: An Approach to Concept Learning, (Ph.D Thesis), STAN-CS-78-711, Comp. Science Dept., Stanford University, Dec. 1978.
L. Naish, The MU-Prolog 3.2 Reference Manual, Tech. Rpt. 85/11, Comp. Science Dept., Melbourne University, 1985.
L. Naish, Negation & Quantifiers in NU-Prolog, Proc. 3rd Conf. on Logic Programming, July 1986.
G.D. Plotkin, A Note on Inductive Generalization, Machine Intelligence 5, (B. Meltzer & D. Michie Eds.), 1970, 153–163.
G.D. Plotkin, A Further Note on Inductive Generalization, Machine Intelligence 6, (B. Meltzer & D. Michie Eds.), 1971, 101–124.
J.C. Reynolds, Transformational Systems and the Algebraic Structure of Atomic Formulas, Machine Intelligence 5, (B. Meltzer & D. Michie Eds.), 1970, 135–152.
J.A. Robinson, A Machine-Oriented Logic Based on the Resolution Principle, JACM, Vol. 12, No. 1, Jan. 1965, pp 23–41.
S.A. Vere, Multilevel Counterfactuals for Generalization of Relational Concepts and Productions, Artificial Intelligence 14, 1980, 139–164.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lassez, J.L., Marriott, K. (1986). Explicit representation of terms defined by counter examples. In: Nori, K.V. (eds) Foundations of Software Technology and Theoretical Computer Science. FSTTCS 1986. Lecture Notes in Computer Science, vol 241. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17179-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-17179-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-17179-9
Online ISBN: 978-3-540-47239-1
eBook Packages: Springer Book Archive