An extension of explanation-based generalization to negation as failure

  • Stefan Schrödl
Knowledge Organization and Optimization
Part of the Lecture Notes in Computer Science book series (LNCS, volume 981)


Methods of Explanation-Based Generalization (EBG) within a logic-programming environment, such as McCarty and Kedar-Cabelli's PROLOG-EBG algorithm [KCMcC87], require the domain theory to be represented as a definite, i.e. Horn clause program. The same restriction holds for Siqueira and Puget's Explanation-Based Generalization of Failures [SiPu88]. However, a number of practical applications can be expressed most easily by using negations in clause bodies. Specifically, this is the case for the domain of game playing, where attempts to use traditional EBG turned out to be inadequate [Ta89]. In this paper we present an approach which extends EBG and EBGF to this more general setting. It yields a rule in first-order logic, which can be subsequently transformed into a normal program.


Explanation-Based Generalization Negation as Failure Logic Programming Game Playing 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [AptDo92]
    Apt, K.R., and Doets, H.C., A New Definition of SLDNF-resolution, ILLC Prepublication Series CT-92-03, Department of Mathematics and Computer Science, University of Amsterdam, The Netherlands, 1992.Google Scholar
  2. [BruHe88]
    Bruffaerts, A., and Henin, E., Proof Trees for Negation as Failure: Yet Another Prolog Meta-Interpreter, in: Kowalski, R.A., and Bowen, K.A. (eds), Proc. of the 5th International Conference and Symposium on Logic Programming, The MIT Press, (1988), pp 343–358Google Scholar
  3. [BruSch89]
    Bruynooghe, M., and De Schreye, D., Some Thoughts on the Role of Examples in Program Transformation and its Relevance for Explanation-Based Learning, in: Jantke, K.P. (ed.), Proc. of the International Workshop on Analogical and Inductive Inference, Springer Verlag Berlin etc., (1989), pp 60–77Google Scholar
  4. [BruRa89]
    Bruynooghe, M., De Raedt, L., and De Schreye, D., Explanation-Based Program Transformation, Proc. IJCAI-89, Detroit MI, (1989), pp 407–412Google Scholar
  5. [Cha88]
    Chan, D., Constructive Negation Based on the Completed Database, in: Kowalski, R.A., and Bowen, K.A., Proc. of the Fifth ICLP, MIT Press, (1988), pp 111–125Google Scholar
  6. [ChaWa89]
    Chan, D., and Wallace, M., A Treatment of Negation during Partial Evaluation, in: Abramson, H., and Rogers, M.H. (eds), Meta-Programming in Logic Programming, The MIT Press, Cambridge MA, (1989), pp 299–317Google Scholar
  7. [Cla78]
    Clark, K.L., Negation as Failure, in: Gallaire, H., and Minker, J. (eds), Logic and Data Bases, Plenum Press, NY, (1978), 293–322Google Scholar
  8. [FlaDi86]
    Flann, N.S., and Dietterich, T.G., Selecting Appropriate Representations for Learning from Examples, Proc. AAAI-86, (1986), pp 460–466Google Scholar
  9. [Gup87]
    Gupta, A., Explanation-Based Failure Recovery, Proc. AAAI-87, (1987), pp 606–610Google Scholar
  10. [HaBu88]
    Harmelen, F.V., and Bundy, A., Explanation-Based Generalization = Partial Evaluation, Artificial Intelligence 36, (1988), pp 401–412Google Scholar
  11. [Hi87]
    Hirsh, H., Explanation-based Generalization in a Logic Programming Environment, Proc. IJCAI-87, Milan, (1987), pp 221–227Google Scholar
  12. [KaKa88]
    Kawamura, T., and Kanamori, T., Preservation of Stronger Equivalence in Unfold/Fold Logic Program Transformation, ICOT Technical Report, Tokyo, (1988)Google Scholar
  13. [KCMcC87]
    Kedar-Cabelli, S.T., and McCarty, L.T., Explanation-Based Generalization as Theorem Proving, Proc. of the Fourth International Workshop on Machine Learning, Irvine, (1987)Google Scholar
  14. [Ll87]
    Lloyd, J.W., Foundations of Logic Programming, Second, Extended Edition, Springer-Verlag, (1987)Google Scholar
  15. [Ll91]
    Lloyd, J.W., and Shepherdson, J.C., Partial Evaluation in Logic Programming, Journal of Logic Programming 11, Elsevier, NY, (1991), pp 217–242Google Scholar
  16. [Min84]
    Minton, S., Constraint-Based Generalization: Learning Game-Playing Plans from Single Examples, Proc. AAAI-84, (1984), 251–254Google Scholar
  17. [MiCa87]
    Minton, S., and Carbonell, J.G., Strategies for Learning Search Control Rules: An Explanation-Based Approach, Proc. IJCAI-87, Milan, (1987), pp 228–235Google Scholar
  18. [MKKC86]
    Mitchell, T., Keller, R., and Kedar-Cabelli, S., Explanation-Based Generalization: A Unifying View, Machine Learning 1:1, (1986), pp 47–80Google Scholar
  19. [MoBha87]
    Mostow, J., and Bhatnagar, N., Failsafe: A Floor Planner that Uses EBG to Learn from its Failures, Proc. IJCAI-87, Milan, (1987), pp. 249–255Google Scholar
  20. [SiPu88]
    Siqueira, J.L., and Puget, J.F., Explanation-Based Generalization of Failures, Proc. ECAI-88, (1988), pp 339–344Google Scholar
  21. [Ta89]
    Tadepalli, P., Lazy Explanation-Based Learning: A Solution to The Intractable Theory Problem, Proc. IJCAI-89, Detroit MI, (1989), 694–700Google Scholar
  22. [Sa92]
    Sato, T., An Equivalence-Preserving First-Order Unfold/Fold Transformation system, Theoretical Computer Science 105, (1992), pp 57–84Google Scholar
  23. [Ur91]
    Urbano, P., Learning by Explanation of Failures, in: Kodratoff, Y. (ed.), Proc. of the European Working Session on Learning, Springer Verlag, Berlin, (1991), pp 327–343Google Scholar
  24. [YSUB90]
    Yee, R.C., Saxena, S., Utgoff, P.E., Barto, A.G., Explaining Temporal Differences to Create Useful Concepts for Evaluating States, Proc. AAAI-90, (1990), pp 882–888Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Stefan Schrödl
    • 1
  1. 1.Institut für InformatikAlbert-Ludwigs-UniversitätFreiburg

Personalised recommendations