Abstract
Computational efficiency is a central concern in the design of knowledge representation systems. In order to obtain efficient systems it has been suggested that one should limit the form of the statements in the knowledge base or use an incomplete inference mechanism. The former approach is often too restrictive for practical applications, whereas the latter leads to uncertainty about exactly what can and cannot be inferred from the knowledge base. We present a third alternative, in which knowledge given in a general representation language is translated (compiled) into a tractable form — allowing for efficient subsequent query answering.
We show how propositional logical theories can be compiled into Horn theories that approximate the original information. The approximations bound the original theory from below and above in terms of logical strength. The procedures are extended to other tractable languages (for example, binary clauses) and to the first-order case. Finally, we demonstrate the generality of our approach by compiling concept descriptions in a general frame-based language into a tractable form.
Preview
Unable to display preview. Download preview PDF.
References
Mark Boddy and Thomas Dean. Solving time dependent planning problems. Technical report, Department of Computer Science, Brown University, 1988.
Ronald J. Brachman, Deborah L. McGuinness, Peter F. Patel-Schneider, Lori Alperin Resnick, and Alexander Borgida. Living with classic: When and how to use a klone-like language. In J. Sowa, editor, Formal Aspects of Semantic Networks. Morgan Kaufmann, 1990.
S. A. Cook. The complexity of theorem-proving procedures. In Proceedings of the 3rd Annual ACM Symposium on the Theory of Computing, pages 151–158, 1971.
W. Craig. Three uses of the herbrand-gentzen theorem in relating model theory and proof theory. Journal of Symbolic Logic, 22, 1955.
William F. Dowling and Jean H. Gallier. Linear time algorithms for testing the satisfiability of propositional horn formula. Journal of Logic Programming, 3:267–284, 1984.
J. Doyle and R. Patil. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence, 48(3):261–298, 1991.
K.D. Forbus. Qualitative process theory. Artificial Intelligence, 24:85–168, 1984.
Kenneth D. Forbus. The qualitative process engine. In Deaniel S. Weld and Johan de Kleer, editors, Readings in Qualitative Reasoning About Physical Systems, pages 220–235. Morgan Kaufmann, Los Altos, CA, 1990.
Nevin Heintze and Joxan Jaffar. A finite presentation theorem for approximating logic programs. In Proceedings of POPL-90, page 197, 1990.
R. C. T. Lee. A Completeness Theorem and a Computer Program for Finding Theorems Derivable From Given Axioms. PhD thesis, University of California at Berkeley, Berkeley, CA, 1967.
Hector J. Levesque. Logic and the complexity of reasoning. Technical Report KRR-TR-89-2, Department of Computer Science, University of Toronto, Toronto, Ontario, Canada, Jan 1989.
H.J. Levesque and R.J. Brachman. A fundamental tradeoff in knowledge representation and reasoning (revised version). In R.J. Brachman and H.J. Levesque, editors, Readings in Knowledge Representation, pages 41–70. Morgan Kaufmann, Los Altos, CA, 1985.
P. Patel-Schneider, B. Owsnicki-Klewe, A. Kobsa, N. Guarino, R. MacGregor, W.S. Mark, D.L. McGuinness, B. Nebel, A. Schmiedel, and J. Yen. Term subsumption languages in knowledge representation. AI Magazine, 11 (2): 16–23, 1990.
Bart Selman and Henry Kautz. Knowledge compilation using horn approximations. In Proceedings of AAAI-91, Anaheim, CA, 1991.
Bart Selman and Henry Kautz. Methods of knowledge compilation. In Preparation, 1991.
Devika Subramanian and Michael R. Genesereth. The relevance of irrelevance. In Proceedings of IJCAI-87, volume 1, page 416, 1987.
Jeffrey D. Ullman. Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press, Rockville, MD, 88.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kautz, H., Selman, B. (1991). A general framework for knowledge compilation. In: Boley, H., Richter, M.M. (eds) Processing Declarative Knowledge. PDK 1991. Lecture Notes in Computer Science, vol 567. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013538
Download citation
DOI: https://doi.org/10.1007/BFb0013538
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55033-4
Online ISBN: 978-3-540-46667-3
eBook Packages: Springer Book Archive