Abstract
Conceptual graphs form the basis of a graph-based existential-conjunctive logic. In this paper, first, we illustrate the problems associated with a proof procedure for conceptual graph programs and then specify the definitions of a normal form representation for a conceptual graph program, an anti-normal form representation for a goal, and a conceptual graph unification procedure called CG unification. Next, we develop a direct proof procedure for definite conceptual graph programs, called CGF-derivation. The proof procedure takes advantage of the normal form of a definite conceptual graph program and the anti-normal form of a goal, and utilizes the CG unification procedure for matching conceptual graphs. Finally, we prove that the proposed CGF-derivation procedure is sound and complete.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. C. Ghosh and V. Wuwongse. Declarative Semantics of Conceptual Graphs Programs. In Proceedings of the Second Workshop on Peirce held in conjunction with the First International Conference on Conceptual Structures, August 1993.
B. C. Ghosh and V. Wuwongse. Conceptual Graph Programs and Their Declarative Semantics. Technical report, Asian Institute of Technology, Bangkok, Thailand, July 1994.
B. C. Ghosh and V. Wuwongse. Inference Systems for Conceptual Graph Programs. In W. M. Tepfenhart, J. P. Dick, and J. F. Sowa, editors, Conceptual Structures: Current Practices, Lecture Notes in Artificial Intelligence No. 835, pages 214–229. Springer-Verlag, 1994.
J. E. Heaton and P. Kocura. Presenting a Peirce Logic Based Inference Engine and Theorem Prover for Conceptual Graphs. In B. Moulin G. W. Mineau and J. F. Sowa, editors, Conceptual Graphs for Knowledge Representation, Lecture Notes in Artificial Intelligence No. 699, pages 381–400. Springer-Verlag, 1993.
A. Dugourd J. Faruges, M. Landau and L. Catach. Conceptual Graphs for Semantics and Knowledge Processing. IBM Journal of Research and Development, 30(1):70–79, January 1986.
S. Keronen. Natural Deduction Proof Theory for Logic Programming. In E. Lamma and P. Mello, editors, Extensions of Logic Programming — Proc. ELP'92, Lecture Notes in Artificial Intelligence No. 660, pages 265–289. Springer-Verlag, 1993.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, second, extended edition, 1987.
A. S. Rao and N. Y. Foo. CONGRES: Conceptual Graph Reasoning System. In Proceedings of the 3rd Conference on Artificial Intelligece Applications, pages 87–92. IEEE Computer Society Press, 1987.
J. F. Sowa. Conceptual Structure: Information Processing in Mind and Machine. Addison-Wesley Publishing Company, Inc., 1984.
V. Wuwongse and B. C. Ghosh. Towards Deductive Object-Oriented Databases Based on Conceptual Graphs. In H. D. Pfeiffer and T. F. Nagle, editors, Conceptual Structures: Theory and Implementation, Lecture Notes in Artificial Intelligence No. 754, pages 188–205. Springer-Verlag, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ghosh, B.C., Wuwongse, V. (1995). A direct proof procedure for definite conceptual graph programs. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_36
Download citation
DOI: https://doi.org/10.1007/3-540-60161-9_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60161-6
Online ISBN: 978-3-540-49539-0
eBook Packages: Springer Book Archive