Abstract
Conceptual Graphs (CGs) are a natural and intuitive notation for expressing first-order logic statements. However, the task of performing inference with a large-scale CG knowledge base remains largely unexplored. Although basic inference operators are defined for CGs, few methods are available for guiding their application during automated reasoning. Given the expressive power of CGs, this can result in inference being intractable.
In this paper we show how a method used elsewhere for achieving tractability — namely the use of access paths — can be applied to conceptual graphs. Access paths add to CGs domain-specific information that guides inference by specifying preferred chains of subgoals for each inference goal (and hence, other chains will not be tried). This approach trades logical completeness for focussed inference, and allows incompleteness to be introduced in a controlled way (through the knowledge engineer's choice of which access paths to attach to CGs). The result of this work is an inference algorithm for CGs that significantly improves the efficiency of reasoning.
Preview
Unable to display preview. Download preview PDF.
References
James Crawford. Access-limited logic: A language for knowledge representation. Technical Report AI90-141, Dept CS, Univ Texas at Austin, Austin, TX, Oct 1990.
B. W. Porter, J. Lester, K. Murray, K. Pittman, A. Souther, L. Acker, and T. Jones. The botany knowledge base project. Tech Report AI-88-88, Dept CS, Univ Texas at Austin, Sept 1988.
Peter Clark and Bruce Porter. The dce help-desk project. (http://www.cs.utexas.edu/users/mfkb/dce.html), 1996.
Peter Clark. KM/KQL: Syntax and semantics. (Internal document, AI Lab, Univ Texas at Austin. http://www.cs.utexas.edu/users/mfkb/manuals/kql.ps), 1996.
J. F. Sowa. Conceptual structures Addison Wesley, 1984.
R. J. Brachman, D. L. McGuinness, P. F. Patel-Schneider, L. A. Resnick, and A. Borgida. Living with CLASSIC: When and how to use a KL-ONE like language. In J. Sowa, editor, Principles of Semantic Networks. Kaufmann, CA, 1991.
Adil Kabbaj. Prolog cg-object-oriented programming with PROLOG+CG. Master's thesis, Univ Montreal, Canada, May 1995.
Jon Doyle and Ramesh S. Patil. Two theses of knowledge representation: Language restrictions, taxonomic classification, and the utility of representation services. Artificial Intelligence, pages 261–297, 1991.
J. M. Crawford and B. J. Kuipers. Algernon — a tractable system for knowledge-representation. SIGART Bulletin, 2(3):35–44, June 1991.
R. MacGregor. Loom users guide (version 1.4). Tech report, ISI, CA, 1991.
Ronald J. Brachman, Richard E. Fikes, and Hector J. Levesque. KRYPTON: A functional approach to knowledge representation. In Ronald J. Brachman and Hector J. Levesque, editors, Readings in Knowledge Representation, pages 412–429. Kaufmann, CA, 1985.
William A. Woods. Understanding subsumption and taxonomy. In John F. Sowa, editor, Principles of Semantic Networks, pages 45–94. Kaufmann, CA, 1991.
Hassan Ait-Kaci and Andreas Podelski. Towards a meaning of LIFE. Logic Programming, 16:195–234, 1993.
Stefano Ceri, Georg Gottlob, and Letizia Tanca. What you always wanted to know about datalog (and never dared to ask). IEEE Transactions on Knowledge and Data Engineering, 1(1):146–166, Mar 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clark, P., Porter, B. (1997). Using access paths to guide inference with conceptual graphs. In: Lukose, D., Delugach, H., Keeler, M., Searle, L., Sowa, J. (eds) Conceptual Structures: Fulfilling Peirce's Dream. ICCS 1997. Lecture Notes in Computer Science, vol 1257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027895
Download citation
DOI: https://doi.org/10.1007/BFb0027895
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63308-2
Online ISBN: 978-3-540-69424-3
eBook Packages: Springer Book Archive