Abstract
Inference planning techniques have been implemented and incorporated within a prototype deductive processor designed to support the extraction of information implied by, but not explicitly included in, the contents of a relationally structured data base, Deductive pathfinding and inference planning are used to select small sets of relevant premises and to construct skeletal derivations. When these “skeletons” are verified, the system uses them as plans to create data-base access strategies that guide the retrieval of data values, to assemble answers to user requests, and to produce proofs supporting those answers. Several examples are presented to illustrate the current capability of the prototype Deductively Augmented Data Management (DADM) system.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Davis, R. and King, J. [1975] An Overview of Production Systems, AIM-271, Artificial Intelligence Laboratory, Stanford University, 1975.
Elliott, R. W. [1965] A Model for a Fact Retrieval System, TNN-42, Computation Center, University of Texas, Austin, 1965.
Kellogg, C. H., Burger, J., Diller, T. and Fogt, K. [1971] The CONVERSE Natural Language Data Management System: Current Status and Plans, Proceedings Symposium on Information Storage and Retrieval, ACM, New York, 1971, 33–46.
Kellogg, C., Klahr, P. and Travis, L. [1976] A Deductive Capability for Data Management, In Systems for Large Data Bases (P.C. Lockemann and E. J. Neuhold, Eds.), North Holland, Amsterdam, 1976, 181–196.
Kellogg, C., Klahr, P. and Travis, L. [1977] Deductive Methods for Large Data Bases, Fifth International Joint Conference on Artificial Intelligence, MIT, Cambridge, Mass., 1977, 203–209.
Klahr, P. [1975] “The Deductive Pathfinder: Creating Derivation’ Plans for Inferential Question-Answering,” Ph.D. Dissertation, Computer Science Dept., University of Wisconsin, Madison, Wisconsin, 1975.
Klahr, P. [1978] Planning Techniques for Rule Selection in Deductive Question-Answering, In Pattern-Directed Inference Systems (D. Waterman and F. Hayes-Roth, Eds.), Adademic Press, New York, 1978.
Kowalski, R. [1975] A Proof Procedure Using Connection Graphs, JACM 22 3 4 (October 1975), 572–595.
McSkimin, J. and Minker, J. [1978] A Predicate Calculus Based Semantic Network for Question-Answering Systems, In Associative Networks — The Representation and Use of Knowledge in Computers (N. Findler, Ed.), Academic Press, New York, 1978.
McSkimin, J. and Minker J. [1977] The Use of a Semantic Network in a Deduction Question-Answering System, Fifth International Joint Conference on Artificial Intelligence, MIT, Cambridge, Mass., 1977, 50–58.
Reiter, R. [1978] Deductive Question-Answering in Relational Data Bases, In Logic and Data Bases (H. Gallaire and J. Minker, Eds.), Plenum Press, New York, New York, 1978, 149–177.
Robinson, J. A. [1965] A Machine-Oriented Logic Based on the Resolution Principle, JACM12, 1 (January 1965), 23–41.
Sickel, S. [1976] A Search Technique for Clause Interconnec-tivity Graphs, IEEE Trans. Computers, C-25, 8 (August 1976), 823–835.
Travis, L., Kellogg, C. and Klahr, P. [1973] Inferential Question-Answering: Extending CONVERSE, SP-3679, System Development Corporation, Santa Monica, Calif., 1973.
Wos, L., Robinson, G. A. and Carson, D. A. [1965] Efficiency and Completeness of the Set of Support Strategy in Theorem Proving, JACM12, 4 (October 1965), 536–541.
Zadeh, L. A. [1965] Fuzzy Sets, Information and Control8, (1965), 338–353.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1978 Plenum Press, New York
About this chapter
Cite this chapter
Kellogg, C., Klahr, P., Travis, L. (1978). Deductive Planning and Pathfinding for Relational Data Bases. In: Gallaire, H., Minker, J. (eds) Logic and Data Bases. Springer, Boston, MA. https://doi.org/10.1007/978-1-4684-3384-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-3384-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4684-3386-9
Online ISBN: 978-1-4684-3384-5
eBook Packages: Springer Book Archive