Reasoning with Data in a Deductively Augmented Data Management System

  • Charles Kellogg
  • Larry Travis


A system for applying the theory of logical deduction and proof procedures to the accessing of data stored in conventional data management systems is described and illustrated with several examples. The DADM (Deductively Augmented Data Management) system has been developed along several dimensions of utility and performance to provide a vehicle for research on interactive techniques for reasoning with data, answering questions, and supporting on-line decision making. After illustrating present system operation by means of several examples, new performance-enhancing features of the system are described. These features include improved user interfaces, improved visibility of processes and data structures, structure sharing, improvements in inference-planning mechanisms, methods for dealing with incomplete information, utilization of semantic advice, and means for controlling recursive premises.


Data Management System Problem Graph Concept Graph Inference Plan Advice Rule 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chang, C. L. [1978] “Deduce 2: Further Investigation of Deduction in Relational Data Bases”, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, 1978, 201–236.Google Scholar
  2. 2.
    Chang, C. L. [1981] “On Evaluation of Queries Containing Derived Relations in a Relational Data Base”, (this volume).Google Scholar
  3. 3.
    Elliott, R. W. [1965] “A Model for a Fact Retrieval System”, TNN-42, Computation Center, University of Texas, Austin, 1965.Google Scholar
  4. 4.
    Grant, J. and Minker, J. [1981] “Optimization in a Deductive Relational System”, (this volume).Google Scholar
  5. 5.
    Kellogg, C., P. Klahr, and L. Travis [1978] “Deductive Planning and Pathfinding for Relational Data Bases”. In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, 1978, 179–200.Google Scholar
  6. 6.
    Klahr, P. [1978] “Planning Techniques for Rule Selection in Deductive Question-Answering”, In Pattern-Directed Inference Systems (D. Waterman and F. Hayes-Roth, Eds.), Academic Press, 1978, 223–239.Google Scholar
  7. 7.
    Minker, J. [1978] “An Experimental Relational Data Base System Based on Logic”, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, 1978, 107–147.Google Scholar
  8. 8.
    Reiter, R. [1978] “Deductive Question-Answering in Relational Data Bases”, in Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, 1978, 149–177.Google Scholar
  9. 9.
    Sickel, S. [1976] “A Search Technique for Clause Interconnec-tivity Graphs”, IEEE Trans. Computers C-25, 8 (August 1976), 823–835.CrossRefMathSciNetGoogle Scholar
  10. 10.
    Stonebraker, M. et al. [1976] “The Design and Implementation of INGRES”, ACM Trans. on Data Base Systems 1, 3 (September 1976), 189–222.CrossRefGoogle Scholar
  11. 11.
    Warshall, S. [1962] A Theorem on Boolean Matrices, JACM 9 (January 1962), 11–12.CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Zadeh, L. A. [1965] Fuzzy Sets, Information and Control 8, (1965), 338–353.CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Plenum Press, New York 1981

Authors and Affiliations

  • Charles Kellogg
    • 1
  • Larry Travis
    • 2
  1. 1.System Development CorporationSanta MonicaUSA
  2. 2.University of WisconsinMadisonUSA

Personalised recommendations