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.

PDF

In Proc Int Conf on Conceptual Structures - ICCS'97 (Lecture Notes in AI), D. lukose, H. Delugach, M. Keeler, L. Searle, J. Sowa (Eds.), Vol. 1257, pp. 521--535, Berlin, Germany 1997. Springer.

@inproceedings{clark:iccs97, title={Using Access Paths to Guide Inference with Conceptual Graphs}, author={Peter Clark and Bruce Porter}, booktitle={Proc Int Conf on Conceptual Structures - ICCS'97 (Lecture Notes in AI)}, volume={1257}, editor={D. lukose, H. Delugach and M. Keeler and L. Searle and J. Sowa}, address={Berlin, Germany}, publisher={Springer}, pages={521--535}, url="http://www.cs.utexas.edu/users/ai-lab?clark:iccs97", year={1997} }