Skip to main content

Inference systems for conceptual graph programs

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 835))

Abstract

Conceptual graph programs are a kind of order-sorted logic programs based on conceptual graphs. In this paper, we investigate various approaches towards formal inference systems for conceptual graph programs and propose two different deduction procedures. The first one, called the CG-resolution, is a refutation-based resolution procedure that is somewhat analogous in approach to the SLD-resolution of first-order predicate logic. The second one, called the CGF-derivaton, is a forward derivation based deduction procedure. Both procedures are sound with respect to the declarative semantics of conceptual graph programs.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Beierle, C., Hedtstuck, U., Pletat, U. and Siekmann, J., An Order-sorted Predicate Logic With Closely Coupled Taxonomic Information, Many-sorted Logic and its Applications, Meinke, K. and Tucker, J. V. (eds.) John Wiley and Sons Ltd., 1993 pp. 179–211.

    Google Scholar 

  2. ELLIS, G., Compiling Conceptual Graphs, Proc. of International Workshop on Processing Declarative Knowledge, (PDK '91) BOLEY, H. & RICHTER, M.M. (eds.), Springer-Verlag, 1991, pp. 41–55.

    Google Scholar 

  3. ELLIS, G. & LEVISON, R., The Birth of PEIRCE: A Conceptual Graph Workbench, Proc. of The Seventh Annual workshop on Conceptual Graphs July, 1992, pp. 243–252.

    Google Scholar 

  4. FARGUES, J. et al., Conceptual Graphs for Semantics and Knowledge Processing, IBM J. Res. Dev., Vol 30 No. 1, January 1986, pp. 70–79.

    Google Scholar 

  5. GHOSH, B.C. & WUWONGSE, V. Declarative Semantics of Conceptual Graph Programs, Proc. of the Second Workshop on Peirce held in conjunction with the First International Conference on Conceprual Graphs, August, 1993.

    Google Scholar 

  6. HEATON, J.E. & KOCURA, P., Presenting a Peirce Logic Based Inference Engine and Theorem Prover for Conceprual Graphs, Proc. of the First International Conference on Conceptual Graphs, August, 1993, pp. 1–35.

    Google Scholar 

  7. LLOYD, J.W. Foundations of Logic Programming, second extended edition, Springer-Verlag 1987.

    Google Scholar 

  8. Manzano, M., Introduction to Many-sorted Logic, Many-sorted Logic and its Applications, Meinke K. and Tucker, J. V. (eds.) John Wiley and Sons Ltd., 1993, PP. 3–86.

    Google Scholar 

  9. SOWA, J.F., Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley Publishing Company in Inc. 1984.

    Google Scholar 

  10. SOWA, J.F., Relating Diagrams to Logic, Proc. of the First International Conference on Conceptual Graphs. August, 1993, pp. 1–35.

    Google Scholar 

  11. WUWONGSE, V. & GHOSH, B.C. Towards Deductive Object-Oriented Databases Based on Conceptual Graphs, extended abstract, Proc. of the Seventh Annual workshop on Conceptual Graphs, July, 1992, pp. 177–181.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

William M. Tepfenhart Judith P. Dick John F. Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ghosh, B.C., Wuwongse, V. (1994). Inference systems for conceptual graph programs. In: Tepfenhart, W.M., Dick, J.P., Sowa, J.F. (eds) Conceptual Structures: Current Practices. ICCS 1994. Lecture Notes in Computer Science, vol 835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58328-9_15

Download citation

  • DOI: https://doi.org/10.1007/3-540-58328-9_15

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58328-8

  • Online ISBN: 978-3-540-38675-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics