Database reasoning — A deductive framework for solving large and complex problems by means of subsumption

  • Werner Kießling
  • Ulrich Güntzer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 777)


After two decades of experience with relational databases and almost one decade with deductive databases a substantial amount of knowledge for efficient query processing methods and query optimizer technology is broadly available. So far, however, these research and development efforts have not paid too much attention to optimizations based on semantic or heuristic information as it is often demanded in AI.

This paper coins the notion of database reasoning as an approach to open deductive databases for more user-supplied semantic knowledge, both on the object level and meta-control level. We describe how application-specific semantic knowledge in the form of subsumption information can be combined with logic programming and fixpoint semantics, proposing the Datalog-S language extension. We experiment also with declarative meta-programming, specifying intelligent search procedures known from AI and executing them in a deductive database system. Thus database reasoning has the potential to amalgamate the power of deductive databases and of heuristic search, hence it can be applied for solving large and complex problems in a database environment.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Fur94]
    U. Furbach. Theory Reasoning — Extending First Order Calculi to Handle Theories. In this volume.Google Scholar
  2. [GGZ91]
    Sumit Ganguly, Sergio Greco, and Carlo Zaniolo. Minimum and maximum predicates in logic programming. In Proc. ACM SIGACT-SIGMOD Symp. on Principles of Database Systems, pages 154–163, Denver, CO, May 1991. ACM Press.Google Scholar
  3. [GKB87]
    Ulrich Güntzer, Werner Kießling, and Rudolf Bayer. On the evaluation of recursion in (deductive) database systems by efficient differential fixpoint iteration. In Int'l. Proc. IEEE Conf. on Data Engineering, pages 120–129, Los Angeles, CA, Feb. 1987.Google Scholar
  4. [GKT91]
    Ulrich Güntzer, Werner Kießling, and Helmut Thöne. New directions for uncertainty reasoning in deductive databases. In Proc. ACM SIGMOD Conf. on Management of Data, pages 178–187, Denver, CO, May 1991.Google Scholar
  5. [GSZ93]
    Sergio Greco, Domenico Sacca, Carlo Zaniolo. Dynamic Programming Optimization for Logic Queries with Aggregates. In Int'l. Conference on Logic Programming, Vancouver, Nov. 1993, pp. 575–589.Google Scholar
  6. [GZG93]
    S. Greco, C. Zaniolo, S. Ganguly: Greedy by Choice. In Proc. of the 11th ACM Symposium on Principles of Database Systems, 1992, pp. 105–113.Google Scholar
  7. [KKG93]
    Werner Kießling, Gerhard Köstler, and Ulrich Güntzer. Fixpoint evaluation with subsumption for probabilistic uncertainty. In GI-Conference Datenbanksysteme in Büro, Technik und Wissenschaft (BTW'93), pages 316–333, Braunschweig, Germany, Mar. 1993. Springer-Verlag.Google Scholar
  8. [KKTG93]
    Gerhard Köstler, Werner Kießling, Helmut Thöne, and Ulrich Güntzer. The differential fixpoint operator with subsumption. In Proc. of the 3 rd Int'l. Conf. on Deductive and Object-Oriented Databases, Scottsdale, AR, Dec. 1993, pp. 35–48.Google Scholar
  9. [Kwa89]
    James B. H. Kwa. BS*: An admissible bidirectional staged heuristic search algorithm. Artificial Intelligence, 38:95–109, 1989.Google Scholar
  10. [NT89]
    S. Naqvi, S. Tsur. A Logic Language for Data and Knowledge Bases. Computer Science Press, 1989.Google Scholar
  11. [Pea84]
    Judea Pearl. Heuristics, Addison Wesley, 1984.Google Scholar
  12. [RSS92]
    Raghu Ramakrishnan, Divesh Srivastava, and S. Sudarshan. CORAL—Control, Relations and Logic. In Proc. Int'l. Conf. on Very Large Data Bases, pages 238–250, Vancouver, BC, Canada, 1992.Google Scholar
  13. [PLD93]
    International Workshop on Programming with Logic Databases, R. Ramakrishnan (ed), Vanvouver, Nov. 1993.Google Scholar
  14. [SKGB87]
    Helmut Schmidt, Werner Kießling, Ulrich Güntzer, and Rudolf Bayer. Compiling exploratory and goal-directed deduction into sloppy delta-iteration. In Proceedings of the Symposium on Logic Programming, pages 233–243, San Francisco, CA, Sep. 1987.Google Scholar
  15. [SKGB89]
    Helmut Schmidt, Werner Kießling, Ulrich Güntzer, and Rudolf Bayer. DBA*: Solving combinatorial problems with deductive databases. In Proc. GI/SI-Conference on Datenbanksysteme in Büro, Technik und Wissenschaft (BTW'89), pages 196–215, Zürich, Switzerland, 1989.Google Scholar
  16. [SZ90]
    D. Sacca, C. Zaniolo. Stable Models and Non-Determinism in Logic Programs with Negation. In Proc. of the 9th ACM Symposium on Principles of Database Systems, 1990, pp. 205–217.Google Scholar
  17. [SSG*90]
    H. Schmidt, N. Steger, U. Güntzer, W. Kießling, R. Azone, R. Bayer. Combining Deduction by Certainty with the Power of Magic. In Deductive and Object-Oriented Databases, Kim, Nicolas and Nishio (eds.), Elsevier Science Publishers, North-Holland, 1990, pp. 103–122.Google Scholar
  18. [VLJ94]
    Special Issue on Prototypes of Deductive Databases, VLDB Journal, K. Ramamohanarao (ed), to appear 1994.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Werner Kießling
    • 1
  • Ulrich Güntzer
    • 2
  1. 1.Lehrstuhl für Informatik 2Universität AugsburgAugsburg
  2. 2.Wilhelm-Schickard-InstitutUniversität TübingenTübingen

Personalised recommendations