Advertisement

A Tool for Validating PROLOG Programs

  • R. Kiel
  • M. Schader
Part of the Studies in Classification, Data Analysis, and Knowledge Organization book series (STUDIES CLASS)

Abstract

We analyze program data of a knowledge base encoded in Prolog. The aim is to classify the program clauses into rules and facts that are inconsistent, unfireable or unnecessary and those that pass without objections. Three complementary analysis steps are described and illustrated by small examples. We also discuss aspects of implementation and show how the original clauses have to be normalized in order to simplify processing. In the outlook it is indicated how the scope of the existing version will be expanded in the future.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. Appelrath, H.J. (1987): Das Eureka-Projekt PROTOS. In: Brauer, W., Wahlster, W. (eds.): Wissensbasierte Systeme. Proc. 2. Intl. GI-Kongress. Springer-Verlag, Heidelberg, 1–11.Google Scholar
  2. Barachini, F., Adlassnig, K.-P. (1985): Überlegungen zur Konsistenztestproblematik von Wissensbasen am Beispiel des medizinischen Expertensystems CADIAG-1. In Trost, H., Retti, J. (eds.): Österreichische AI-Tagung, Springer-Verlag, Heidelberg, 1–8.Google Scholar
  3. Brna, P., Bundy, A., Pain, H., Lynch, L. (1987): Programming Tools for Prolog Environments. In: Hallam, J., Mellish, C. (eds.): Advances in Artificial Intelligence. Proc. 1987 AISB Conference, Edinburgh, 251–264.Google Scholar
  4. Clocksin, W.F., Mellish, C.S. (1987): Programming in Prolog (3rd ed.). Springer-Verlag, Heidelberg.zbMATHGoogle Scholar
  5. Debray, S.K., Warren, D.S. (1986): Detection and Optimization of Functional Computations in Prolog. In: Shapiro, E. (ed.): Third Intl. Conf. on Logic Programming. Springer-Verlag, Heidelberg, 490–504.Google Scholar
  6. Geissman, J.R., Schultz, R.D. (1988): Verification & Validation of Expert Systems. AI Expert 2 26–33Google Scholar
  7. Green, C.J.R., Keyes, M.M. (1987): Verification and Validation of Expert Systems. IEEE-Western Conference on Expert Systems, 38–43.Google Scholar
  8. Hopcroft, J.E., Ullman, J.D. (1979): Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading MA.Google Scholar
  9. Kanamori, T., Seki, H. (1986): Verification of Prolog Programs Using An Extension of Execution. In: Shapiro, E. (ed.): Third Intl. Conf. on Logic Programming. Springer-Verlag, Heidelberg, 475–489.Google Scholar
  10. Kleine Büning, H., Löwen, U., Schmitgen, S. (1988): Loop Detection in Propositional Prolog Programs. In: Börger, E., Kleine Büning, H., Richter, M.M. (eds.): CSL ′88. 2nd Workshop on Computer Science Logic, Springer-Verlag, Heidelberg, 148–165.Google Scholar
  11. Knaus, R. (1988): Tracing Prolog. AI Expert, 11 17–23.Google Scholar
  12. Knaus, R. (1989a): Expert Debugging Help. AI Expert, 7 19–24.Google Scholar
  13. Knaus, R. (1989b): Debugging Help, Part Two. AI Expert, 9 27–31.Google Scholar
  14. Lane, A. (1989): An End to Dueling Rules. Byte, June 1989, 303–308.MathSciNetGoogle Scholar
  15. Nguyen, T.A. (1987): Verifying Consistency of Production Systems. In: IEEE Third Conference on Artificial Intelligence, 4–8.Google Scholar
  16. Nilson, N.J. (1982): Principles of Artificial Intelligence. Springer-Verlag, Heidelberg.Google Scholar
  17. Plumer, L. (1988): Predicate Inequalities as a Basis for Automated Termination Proofs for Prolog Programs. In: Börger, E., Kleine Büning, H., Richter, M.M. (eds.): CSL ′88. 2nd Workshop on Computer Science Logic, Springer-Verlag, Heidelberg, 254–271.Google Scholar
  18. de Schreye, D., Bruynooghe, M., Verschaetse, K. (1989): On the Existence of Nonterminating Queries for a Restricted Class of PROLOG-Clauses. Artifical Intelligence, 41 237–248.CrossRefzbMATHGoogle Scholar
  19. Takahashi, H., Shibayama, E. (1985): PRESET — A Debugging Environment for Prolog. In: Wada, E. (ed.): Logic Programming ′85. Proc. 4th Conference on Logic Programming, Springer-Verlag, Heidelberg, 90–100.Google Scholar
  20. Ullman, J.D., van Geldern, A. (1988): Efficient Tests for Top-Down Termination of Logical Rules. J.ACM, 35 345–373.Google Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1991

Authors and Affiliations

  • R. Kiel
    • 1
  • M. Schader
    • 1
  1. 1.Institut für InformatikUniversität der Budeswehr HamburgHamburg 70Germany

Personalised recommendations