Abstract
We present a learning method called Negative Explanation Based Generalization (NEBG) that performs automatic changes of representation by computing the negation of an already known concept. NEBG is similar to EBG as a deductive and valid learning method using a single example. It is based on new logic programming techniques based on example-guided transformation of the completed database. We also introduce a very powerful heuristic based on functional properties of the application domain. The implemented algorithms are described and several examples are given.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Brown (1987). The frame problem in artificial intelligence. Proceedings of the 87 Workshop. Morgan Kaufmann.
Clark, K.L. (1978). Negation as failure. In H. Gallaire & J. Minker (Eds.), Logic and data bases. New York: Plenum Press, pp. 293–322.
Comon, H. (1988). Unification et disunification: théorie et applications. Doctoral thesis, INPG, Grenoble.
Dawson, Siklossy. (1977). The role of preprocessing in problem solving. Proceedings of IJCAI 5 (pp. 465–471). Morgan Kaufmann.
Dejong, J., & Mooney, R. (1986). Explanation-based learning: An alternative view. Machine Learning, 2.
de Siqueira, J. & Puget, J.-F. (1988). Explanation based generalization of failures. Proceedings of ECAI 88, Pisa, Italy. New York: Pitman, pp. 339–344.
Emde, W. (1987). Non cumulative learning in Metaxa. Proceedings of the Tenth International Conference on Artificial Intelligence. Milan, Italy. Morgan Kaufmann.
Fikes, Nilsson. (1971). Acquiring and executing generalized robot plans. In Weber & Nilsson (Eds.) (1980). Readings in A.I. Morgan Kaufmann.
Gupta, A. (1987). Explanation based failure recovery. Proceedings of AAAI 87. Seattle, WA: Morgan Kaufmann.
Hirsh (1987). In P. Brazdil (Ed.), Proceedings of the Workshop on Metalevel Reasoning and Learning.
Jaffar, J., Lassez, J.L., & Lloyd, J.W. (1983). Completeness of the negation as failure rule. Proceedings of 8th IJCAI. Karlsruhe, Germany. Morgan Kaufmann.
Lloyd, J.W. (1987). Foundations of logic programming, 2nd edition. Berlin: Springer Verlag.
Lugiez (1989). A deduction procedure for first order programs. Proceedings of International Conference on Logic Programming, ICLP89.
Minton, S., & Carbonell, J.G. (1987). Strategies for learning search control rules: An explanation based approach. Proceedings of the Tenth International Conference on Artificial Intelligence (pp. 228–235) Milan Italy: Morgan Kaufmann.
Mitchell, T., Keller, R., & Kedar-Cabelli, S. (1986). Explanation-based generalization: A unifying view. Machine Learning, 1.
Mostow, Bhatnagar. (1987). Failsafe. In Proceedings of IJCA187 (pp. 249–256). Morgan Kaufmann.
Puget, J.-F. (1989a). (In French). Evaluation partielle d'echecs en prolog. In Actes du séminaire de programmation en logique de Trégastel, SPLT'89 Lannion, 24–26 mai. Université Paris Sud, 91405 Orsay, France. Also available as report no475, LRI, April.
Puget, J.-F. (1989b). Learning invariant from explanations. In Proceedings of the Sixth International Machine Learning Workshop. Ithaca, NY. Morgan Kaufmann.
Puget, J.-F. (1990). Apprentissage par explications d'echecs. Ph.D. dissertation, Université Paris Sud, 91405 Orsay, France.
Shepherdson, J.C. (1988). Negation in logic programming. In J. Minker (Ed.), Foundation of deductive databases and logic programming. Morgan Kaufmann, pp. 19–87.
Wrobel, Stefan. (1993). Concept formation during interactive theory revision. Machine Learning (this issue).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Puget, JF. Explicit Representation of Concept Negation. Machine Learning 14, 233–247 (1994). https://doi.org/10.1023/A:1022630301359
Issue Date:
DOI: https://doi.org/10.1023/A:1022630301359