Advertisement

Neuere Entwicklungen der deklarativen KI-Programmierung

  • Harold Boley
  • François Bry
  • Ulrich Geske
Conference paper
Part of the Informatik aktuell book series (INFORMAT)

Zusammenfassung

Deklarative Programme repräsentieren ihr Problemlösungswissen auf einer hohen Sprachebene, unabhängig vom Ausführungsmechanismus. KI-Sprachen verdichten die für Anwendungen der KI notwendigen Repräsentationsmethoden zu Programmierkonstrukten. Deklarative KI-Programmiersysteme haben einen wesentlichen softwaretechnischen Aspekt: Änderungsfreundliche Programme sollen ermöglicht und Freiheitsgrade für optimierende Compiler eröffnet werden. Geeignete Konzepte basieren auf funktionalen und logischen Formalismen und schließen Constraint- bzw. Taxonomiesysteme ein. Aktuelle Schwerpunkte bilden die Integration dieser Sprachen sowie ihre Kombination mit prozeduralen und objektorientierten Ausdrucksmitteln. Deklarative KI-Sprachen ermöglichen eine umfassendere Anwendung von Techniken der Programmtransformation und Metaprogrammierung.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literatur

  1. 1.
    Andreas Abecker, Philipp Hanschke. TaxLog: A Flexible Architecture for Logic Programming with Structured Types and Constraints. In Boley et al. [3].Google Scholar
  2. 2.
    Jochen Bedersdorfer, Karsten Konrad, Ingo Neis, Oliver Scherf, Jörg Steffen, Michael Wein. Eine Spezifikationssprache für Transformationen auf getypten Merkmalsstrukturen. In Boley et al. [3].Google Scholar
  3. 3.
    H. Boley, F. Bry, U. Geske (Hrsg.). Proc. Workshop “Neuere Entwicklungen der deklarativen KI-Programmierung” auf der KI-93, Humboldt-Univ. zu Berlin, Research Report RR-93–35, September 1993. DFKI Kaiserslautern.Google Scholar
  4. 4.
    Ulrich Geske, Hans-Joachim Goltz. Verallgemeinerte Behandlung von Constraints in einem CLP-System. In Boley et al. [3].Google Scholar
  5. 5.
    Wolfgang Goerigk, Friedemann Simon. Migration und Kompilation in Lisp: Ein Weg von Prototypen zu Anwendungen. In Boley et al. [3].Google Scholar
  6. 6.
    Knut Hinkelmann. Consequence Finding and Logic Programming. In Boley et al. [3]Google Scholar
  7. 7.
    Hans-Ulrich Krieger, Ulrich Schäfer. ’ TDL — A Type Description Language for Unification-Based Grammars. In Boley et al. [3].Google Scholar
  8. 8.
    Hendrik C.R. Lock. Residuation and Type Constraints. In Boley et al. [3].Google Scholar
  9. 9.
    Gregor Meyer, Sybilla Weigel. Polymorphe Featuretypen - Typinferenz und Typüberprüfung. In Boley et al. [3].Google Scholar
  10. 10.
    Manfred Meyer. Finite Domain Constraints: eine deklarative Wissensre- pràsentationsform mit effizienten Verarbeitungsverfahren. In Boley et al. [3].Google Scholar
  11. 11.
    Holger Wache, Panagiotis Tsarchopoulos. Ein erweitertes CLP-Schema für eine hybride Wissensverarbeitung. In Boley et al. [3].Google Scholar
  12. 12.
    Gerd Wagner. Update, Contraction and Revision in Knowledge Representation Systems. In Boley et al. [3].Google Scholar
  13. 13.
    Bancilhon, F., Maier, D., Sagiv, Y., Ullman, J.: Magic Sets and Other Stange Ways • to Implement Logic Programs. Proc. 5th ACM SIGMOD-SIGART Symp. on Principles of Database Systems (1986)Google Scholar
  14. 14.
    Bancilhon, F., Ramakrishnan, R.: An Amateur’s Introduction to Recursive Query Processing. Proc. ACM SIGMOD Conf. on the Management of Data (1986)Google Scholar
  15. 15.
    Beierle, C.: Knowledge Based PPS Applications in PROTOS-L. Proc. 2nd Logic Programming Summer School (1992)Google Scholar
  16. 16.
    Beeri, C.: Recursive Query Processing. Proc. 8th ACM SIGACT-SIGMODSIGART Symp. on Principles of Database Systems (1989) (tutorial)Google Scholar
  17. 17.
    Beeri, C., Ramakrishnan, R.: On the Power of Magic. Proc. 6th ACM SIGACTSIGMOD-SIGART Symp. on Principles of Database Systems (1987)Google Scholar
  18. 18.
    Bidoit, N.: Bases de Données Déductives. Armand Colin (1992) (in French)Google Scholar
  19. 19.
    Bocca, J.: On the Evaluation Strategy of Educe. Proc. ACM SIGMOD Conf. on the Management of Data (1986)Google Scholar
  20. 20.
    Bry, F.: Logic Programming as Constructivism: A Formalization and its Application to Databases. Proc. 8th ACM-SIGACT-SIGMOD-SIGART Symp. on Principles of Database Systems (1989)Google Scholar
  21. 21.
    Bry, F.: Query Evaluation in Recursive Databases: Bottom-up and Top-down Reconciled. Data and Knowledge Engineering 5 (1990) (Invited paper. A preliminary version of this article appeared in the proc. of the 1st Int. Conf. on Deductive and Object-Oriented Databases)Google Scholar
  22. 22.
    Bry, F., Decker, H., Manthey, R.: A Uniform Approach to Constraint Satisfaction and Constraint Satisfiability in Deductive Databases. Proc. 1st Int. Conf. on Extending Database Technology (1988)Google Scholar
  23. 23.
    Bry, F., Manthey, R.: Deductive Databases — Tutorial Notes. 6th Int. Conf. on Logic Programming (1989)Google Scholar
  24. 24.
    Bry, F., Manthey, R.: Deductive Databases — Tutorial Notes. 1st Int. Logic Programming Summer School (1992)Google Scholar
  25. 25.
    Bry, F., Manthey, R., Martens, B.: Integrity Verification in Knowledge Bases. Proc. 2nd Russian Conf. on Logic Programming (1991) (invited paper)Google Scholar
  26. 26.
    Cacace, F., Ceri, S., Crespi-Reghizzi, S., Tanca, L., Zicari, R.: Integrating Object-Oriented Data Modelling With a Rule-based Programming Paradigm. Proc. ACM SIGMOD Conf. on the Manâgement of Data (1990)Google Scholar
  27. 27.
    Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Surveys in Computer Science, Springer-Verlag (1990)Google Scholar
  28. 28.
    Chimenti, D., Gamboa, R., Krishnamurthy, R., Naqvi, S., Tsur, S., Zaniolo, C.: The LDL System Prototype. IEEE Trans. on Knowledge and Data Engineering 2(1) (1990) 76–90CrossRefGoogle Scholar
  29. 29.
    Decker, H.: Integrity Enforcement on Deductive Databases. Proc. 1st Int. Conf. Expert Database Systems (1986)Google Scholar
  30. 30.
    Freitag, B., Schütz, H., Specht, G.: LOLA — A Logic Language for Deductive Databases and its Implementation. Proc. 2nd Int. Symp. on Database System for Advanced Applications (1991)Google Scholar
  31. 31.
    Gallaire, H., Minker, J. (eds): Logic and Databases. Plenum Press (1978)Google Scholar
  32. 32.
    Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Advances in Database Theory. Vol. 1. Plenum Press (1981)Google Scholar
  33. 33.
    Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Advances in Database Theory. Vol.2. Plenum Press (1984)Google Scholar
  34. 34.
    Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Logic and Databases: A Deductive Approach. ACM Computing Surveys 16:2 (1984)Google Scholar
  35. 35.
    Haas, L. M., Chang, W., Lohman, G. M., McPherson, J., Wilms, P. F., Lpis, G., Lindsay, B., Pirahesh, H., Carey, M., Shekita, E.: Starburst Mid-Flight: As the Dust Clears. IEEE Trans. on Knowledge and Data Engineering (1990) 143–160Google Scholar
  36. 36.
    Jarke, M., Jeusfeld, M., Rose, T.: Software Process Modelling as a Strategy for KBMS Implementation. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases (1989)Google Scholar
  37. 37.
    Kiernan, G., de Maindreville, C., Simon, E.: Making Deductive Databases a Practical Technology: A Step Forward. Proc. ACM SIGMOD Conf. on the Management of Data (1990)Google Scholar
  38. 38.
    Kowalski, R. Sadri, F., Soper, P.: Integrity Checking in Deductive Databases. Proc. 13th Int. Conf. on Very Large Databases (1987)Google Scholar
  39. 39.
    Lefebvre, A., Vieille, L.: On Query Evaluation in the DedGin* System. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases (1989)Google Scholar
  40. 40.
    Lloyd, J. W., Sonenberg, E. A., Topor, R. W.: Integrity Constraint Checking in Stratified Databases. Jour. of Logic Programming 1(3) (1984)Google Scholar
  41. 41.
    Lloyd, J. W., Topor, R. W.: A Basis for Deductive Database Systems. Jour. of Logic Programming 2(2) (1985)Google Scholar
  42. 42.
    Lloyd, J. W., Topor, R. W.: A Basis for Deductive Database Systems IL Jour. of Logic Programming 3(1) (1986)Google Scholar
  43. 43.
    Martens, B., Bruynooghe, M.: Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. Proc. 2nd Int. ConL Expert Database Systems (1988)Google Scholar
  44. 44.
    Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann (1988)Google Scholar
  45. 45.
    Moerkotte, Karl, S.: Efficient Consistency Control in Deductive Databases. Proc. 2nd Int. Conf.. on Database Theory (1988)Google Scholar
  46. 46.
    Morris, K., Ullman, J. D., Van Gelder, A.: Design Overview of the NAIL! System. Proc. 3rd Int. Conf. on Logic Programming (1986)Google Scholar
  47. 47.
    Naqvi, S., Tsur, S.: A Logical Language for Data and Knowledge Bases. Computer Science Press (1989)Google Scholar
  48. 48.
    Nicolas, J.-M.: Logic for Improving Integrity Checking in Relational Databases. Acta Informatica 18(3) (1982)Google Scholar
  49. 49.
    Nicolas, J.-M., Yazdanian, K.: Implantation d’un Système Déductif sur une Base de Données Relationnelle. Research Report, ONERA-CERT, Toulouse, France (1982) (in French)Google Scholar
  50. 50.
    Ramakrishnan, R.: Magic Templates: A Spellbinding Approach to Logic Programming. Proc. 5th Int. Conf. and Symp. on Logic Programming (1988)Google Scholar
  51. 51.
    Ramakrishnan, R., Srivastava, D., Sudarshan, S.: CORAL: Control, Relation and Logic. Proc. Int. Conf. on Very Large Databases (1992)Google Scholar
  52. 52.
    Rohmer, J., Lesccêûr, R., Kerisit, J.M.: The Alexander Method. A Technique for the Processing of Recursive Axioms in Deductive Databases. New Generation Computing 4(3) (1986)Google Scholar
  53. 53.
    Schmidt, H., Kiessling, W., Günther, H., Bayer, R.: Compiling Exploratory and Goal-Directed Deduction Into Sloopy Delta-Iteration. Proc. Symp. on Logic Programming (1987)Google Scholar
  54. 54.
    Seki, H.: On the Power of Alexander Templates. Proc. 8th ACM SIGACT SIGMOD-SIGART Symp. on Principles of Database Systems (1989)Google Scholar
  55. 55.
    Tsur, S.: A (Gentle) Introduction to Deductive Databases. Proc. 2nd Int. Logic Programming Summer School (1992)Google Scholar
  56. 56.
    Ullman, J. D.:. Principles of Database and Knowledge-Base Systems. Vol. 1 and 2. Computer Science Press. (1988, 1989)..Google Scholar
  57. 57.
    Vaghani, J., Ramamohanarao, K., Kemp, D., Somogyi, Z., Stuckey, P.: The Aditi Deductive Database System. Proc. NACLP Workshop on Deductive Database Systems (1990)Google Scholar
  58. 58.
    Vieille, L.: Recursive Query Processing: The Power of Logic. Theoretical Computer Science 69(1) (1989)Google Scholar
  59. 59.
    Vieille, L., Bayer, P., Küchenhoff, V., Lefebvre, A.: EKS-Vl: A Short Overview. Proc. AAAI-90 Workshop on Knowledge Base Management Systems (1990)Google Scholar
  60. 60.
    Vieille, L.: A Deductive and Object-Oriented Database System: Why and How? Proc. ACM SIGMOD Conf. on the Management of Data (1993)Google Scholar
  61. 61.
    Hill, P.M., Lloyd, J.W.: The Gödel Programming Language. Report CSTR-92–27. Dept. CS, University of Bristol, Bristol BS8 1TR (1992)Google Scholar
  62. 62.
    Hill, P.M., Lloyd,J.W.: The Gödel Programming Language. The MIT Press. To appear (1993)Google Scholar
  63. 63.
    Harold Boley. Towards evolvable knowledge representation for industrial. applications. To appear in: K. Hinkelmann, A. Laux (Eds.), Proc. DFKI-Workshop “Wissensreprâsentations-Techniken”, DFKI Document, July 1993.Google Scholar
  64. 64.
    Andrew Bowles. Trends in applying abstract interpretation. The Knowledge Engineering Review, 7(2):157–171, 1992.CrossRefGoogle Scholar
  65. 65.
    J. Brachman, R., G. Schmolze, J. An Overview of the KL-ONE Knowledge Representation System. Cognitive Science, 9(2):171–216, 1985:Google Scholar
  66. 66.
    B. Hollunder. Hybrid Inferences in KL-ONE-Based Knowledge Representation Systems. In GWAI-90; 14th German Workshop on Artificial Intelligence, Band 251 von Informatik-Fachberichte, S. 38–47. Springer, 1990.Google Scholar
  67. 67.
    Peter Idestam-Almquist. Learning Missing Clauses by Inverse Resolution. S. 610–617.Google Scholar
  68. 68.
    Robert M. Mac Gregor. Using a Description Classifier to Enhance Deductive Inference. In 7th Conf. on AI Applications, Band 1. IEEE, 1991.Google Scholar
  69. 69.
    S. Muggleton. Inductive Logic Programming. New Generation Computing, 8:295–318, 1991.zbMATHCrossRefGoogle Scholar
  70. 70.
    Bernhard Nebel. Reasoning and Revision in Hybrid Representation Systems, Band 422 von LNAI. Springer, 1990.Google Scholar
  71. 71.
    M. Pazzani, D. Kibler. the Utility of Knowledge in Inductive Learning. Machine Learning, 5:57–94, 1992.Google Scholar
  72. 72.
    J. R. Quinlan. Learning Logical Definitions from Relations. Machine Learning, 5:239–266, 1990.Google Scholar
  73. 73.
    Bradley Richards, Raymond J. Mooney. First-order Theory Revision. Technischer Bericht AI 91–155, The University of Texas at Austin, Artificial Intelligence Laboratory, March 1991.Google Scholar
  74. 74.
    Stefan Wrobel. Demand-driven Concept Formation. In K. Morik (Hrsg.), Knowledge Representation in Machine Learning. Springer, 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Harold Boley
    • 1
    • 2
    • 3
  • François Bry
    • 1
    • 2
    • 3
  • Ulrich Geske
    • 1
    • 2
    • 3
  1. 1.DFKIKaiserslauternDeutschland
  2. 2.ECRCMünchenDeutschland
  3. 3.GMD-FIRSTDeutschland

Personalised recommendations