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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Literatur
Andreas Abecker, Philipp Hanschke. TaxLog: A Flexible Architecture for Logic Programming with Structured Types and Constraints. In Boley et al. [3].
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].
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.
Ulrich Geske, Hans-Joachim Goltz. Verallgemeinerte Behandlung von Constraints in einem CLP-System. In Boley et al. [3].
Wolfgang Goerigk, Friedemann Simon. Migration und Kompilation in Lisp: Ein Weg von Prototypen zu Anwendungen. In Boley et al. [3].
Knut Hinkelmann. Consequence Finding and Logic Programming. In Boley et al. [3]
Hans-Ulrich Krieger, Ulrich Schäfer. ’ TDL — A Type Description Language for Unification-Based Grammars. In Boley et al. [3].
Hendrik C.R. Lock. Residuation and Type Constraints. In Boley et al. [3].
Gregor Meyer, Sybilla Weigel. Polymorphe Featuretypen - Typinferenz und Typüberprüfung. In Boley et al. [3].
Manfred Meyer. Finite Domain Constraints: eine deklarative Wissensre- pràsentationsform mit effizienten Verarbeitungsverfahren. In Boley et al. [3].
Holger Wache, Panagiotis Tsarchopoulos. Ein erweitertes CLP-Schema für eine hybride Wissensverarbeitung. In Boley et al. [3].
Gerd Wagner. Update, Contraction and Revision in Knowledge Representation Systems. In Boley et al. [3].
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)
Bancilhon, F., Ramakrishnan, R.: An Amateur’s Introduction to Recursive Query Processing. Proc. ACM SIGMOD Conf. on the Management of Data (1986)
Beierle, C.: Knowledge Based PPS Applications in PROTOS-L. Proc. 2nd Logic Programming Summer School (1992)
Beeri, C.: Recursive Query Processing. Proc. 8th ACM SIGACT-SIGMODSIGART Symp. on Principles of Database Systems (1989) (tutorial)
Beeri, C., Ramakrishnan, R.: On the Power of Magic. Proc. 6th ACM SIGACTSIGMOD-SIGART Symp. on Principles of Database Systems (1987)
Bidoit, N.: Bases de Données Déductives. Armand Colin (1992) (in French)
Bocca, J.: On the Evaluation Strategy of Educe. Proc. ACM SIGMOD Conf. on the Management of Data (1986)
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)
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)
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)
Bry, F., Manthey, R.: Deductive Databases — Tutorial Notes. 6th Int. Conf. on Logic Programming (1989)
Bry, F., Manthey, R.: Deductive Databases — Tutorial Notes. 1st Int. Logic Programming Summer School (1992)
Bry, F., Manthey, R., Martens, B.: Integrity Verification in Knowledge Bases. Proc. 2nd Russian Conf. on Logic Programming (1991) (invited paper)
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)
Ceri, S., Gottlob, G., Tanca, L.: Logic Programming and Databases. Surveys in Computer Science, Springer-Verlag (1990)
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–90
Decker, H.: Integrity Enforcement on Deductive Databases. Proc. 1st Int. Conf. Expert Database Systems (1986)
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)
Gallaire, H., Minker, J. (eds): Logic and Databases. Plenum Press (1978)
Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Advances in Database Theory. Vol. 1. Plenum Press (1981)
Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Advances in Database Theory. Vol.2. Plenum Press (1984)
Gallaire, H., Minker, J., Nicolas, J.-M. (eds): Logic and Databases: A Deductive Approach. ACM Computing Surveys 16:2 (1984)
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–160
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)
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)
Kowalski, R. Sadri, F., Soper, P.: Integrity Checking in Deductive Databases. Proc. 13th Int. Conf. on Very Large Databases (1987)
Lefebvre, A., Vieille, L.: On Query Evaluation in the DedGin* System. Proc. 1st Int. Conf. on Deductive and Object-Oriented Databases (1989)
Lloyd, J. W., Sonenberg, E. A., Topor, R. W.: Integrity Constraint Checking in Stratified Databases. Jour. of Logic Programming 1(3) (1984)
Lloyd, J. W., Topor, R. W.: A Basis for Deductive Database Systems. Jour. of Logic Programming 2(2) (1985)
Lloyd, J. W., Topor, R. W.: A Basis for Deductive Database Systems IL Jour. of Logic Programming 3(1) (1986)
Martens, B., Bruynooghe, M.: Integrity Constraint Checking in Deductive Databases Using a Rule/Goal Graph. Proc. 2nd Int. ConL Expert Database Systems (1988)
Minker, J. (ed.): Foundations of Deductive Databases and Logic Programming. Morgan Kaufmann (1988)
Moerkotte, Karl, S.: Efficient Consistency Control in Deductive Databases. Proc. 2nd Int. Conf.. on Database Theory (1988)
Morris, K., Ullman, J. D., Van Gelder, A.: Design Overview of the NAIL! System. Proc. 3rd Int. Conf. on Logic Programming (1986)
Naqvi, S., Tsur, S.: A Logical Language for Data and Knowledge Bases. Computer Science Press (1989)
Nicolas, J.-M.: Logic for Improving Integrity Checking in Relational Databases. Acta Informatica 18(3) (1982)
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)
Ramakrishnan, R.: Magic Templates: A Spellbinding Approach to Logic Programming. Proc. 5th Int. Conf. and Symp. on Logic Programming (1988)
Ramakrishnan, R., Srivastava, D., Sudarshan, S.: CORAL: Control, Relation and Logic. Proc. Int. Conf. on Very Large Databases (1992)
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)
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)
Seki, H.: On the Power of Alexander Templates. Proc. 8th ACM SIGACT SIGMOD-SIGART Symp. on Principles of Database Systems (1989)
Tsur, S.: A (Gentle) Introduction to Deductive Databases. Proc. 2nd Int. Logic Programming Summer School (1992)
Ullman, J. D.:. Principles of Database and Knowledge-Base Systems. Vol. 1 and 2. Computer Science Press. (1988, 1989)..
Vaghani, J., Ramamohanarao, K., Kemp, D., Somogyi, Z., Stuckey, P.: The Aditi Deductive Database System. Proc. NACLP Workshop on Deductive Database Systems (1990)
Vieille, L.: Recursive Query Processing: The Power of Logic. Theoretical Computer Science 69(1) (1989)
Vieille, L., Bayer, P., Küchenhoff, V., Lefebvre, A.: EKS-Vl: A Short Overview. Proc. AAAI-90 Workshop on Knowledge Base Management Systems (1990)
Vieille, L.: A Deductive and Object-Oriented Database System: Why and How? Proc. ACM SIGMOD Conf. on the Management of Data (1993)
Hill, P.M., Lloyd, J.W.: The Gödel Programming Language. Report CSTR-92–27. Dept. CS, University of Bristol, Bristol BS8 1TR (1992)
Hill, P.M., Lloyd,J.W.: The Gödel Programming Language. The MIT Press. To appear (1993)
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.
Andrew Bowles. Trends in applying abstract interpretation. The Knowledge Engineering Review, 7(2):157–171, 1992.
J. Brachman, R., G. Schmolze, J. An Overview of the KL-ONE Knowledge Representation System. Cognitive Science, 9(2):171–216, 1985:
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.
Peter Idestam-Almquist. Learning Missing Clauses by Inverse Resolution. S. 610–617.
Robert M. Mac Gregor. Using a Description Classifier to Enhance Deductive Inference. In 7th Conf. on AI Applications, Band 1. IEEE, 1991.
S. Muggleton. Inductive Logic Programming. New Generation Computing, 8:295–318, 1991.
Bernhard Nebel. Reasoning and Revision in Hybrid Representation Systems, Band 422 von LNAI. Springer, 1990.
M. Pazzani, D. Kibler. the Utility of Knowledge in Inductive Learning. Machine Learning, 5:57–94, 1992.
J. R. Quinlan. Learning Logical Definitions from Relations. Machine Learning, 5:239–266, 1990.
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.
Stefan Wrobel. Demand-driven Concept Formation. In K. Morik (Hrsg.), Knowledge Representation in Machine Learning. Springer, 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Boley, H., Bry, F., Geske, U. (1993). Neuere Entwicklungen der deklarativen KI-Programmierung. In: Herzog, O., Christaller, T., Schütt, D. (eds) Grundlagen und Anwendungen der Künstlichen Intelligenz. Informatik aktuell. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-78545-0_19
Download citation
DOI: https://doi.org/10.1007/978-3-642-78545-0_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57278-7
Online ISBN: 978-3-642-78545-0
eBook Packages: Springer Book Archive