Abstract
Prolog+CG is a CG-Based logic programming language which integrates Prolog, the manipulation of conceptual graphs (CGs), Java and object-oriented constructs. It provides a powerful development environment for the creation of knowledge-based applications and their integration on the web. Java provides object-oriented capabilities allowing the development of multiplatform applications. Object-oriented Prolog provides the full power of an object-oriented logic programming language and CGs provide the expressive power of an advanced knowledge representation language. This paper presents the recent extensions that have been added to Prolog+CG and illustrates some typical uses of the environment for the development of various applications.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Bee-gent Software agent environment (Toshiba): http://www2.toshiba.co.ip/beegent/index.htm
Gal A., Lapalme G., Saint-Dizier P., Somers H.(1991) Prolog for Natural Language Processing, Wiley Professional Computing editions.
Kabbaj A. (1996), Un systéme multi-paradigme pour la manipulation des connaissances utilisant la theorie des graphes conceptuels, Ph. D. Thesis, Universite de Montreal, Canada.
Kabbaj A., Janta-Polczynski M. (2000), From PROLOG++ to PROLOG+CG: A CG Object-Oriented Logic Programming Language, in Conceptual Structures: Logical, Linguistic, and Computational Issues, Ganter B. and G. W. Mineau (eds.), Springer, LNAI 1867, 540–554.
Kabbaj A., The impact of sets and co-references on CG operations in Prolog+CG 2.5, Submitted to ICCS’2001
Kolodner J. (1993) Case-Based Reasoning, Morgan Kaufmann.
Maher P.E. (1993) A similarity measure for conceptual graphs, International journal of intelligent systems, Vol 8, No. 8, 1993, 819–837.
Myaeng H., Lopez-Lopez A. (1992) Conceptual graph matching: a flexible algorithm and experiments, Journal of experimental and Theoretical Artificial Intelligence, Vol 4, April–June, 107–126.
Poole J., Campbell J.A. (1995) A novel algorithm for matching conceptual and related graphs, Conceptual structures: applications, implementation and theory, In G. Ellis et al. (eds.), Springer Verlag Lecture notes in Artificial Intelligence 954, 293–307.
Winograd T. (1972), Understanding Natural Language, Academic Press, NY.
Yang G-C, Choi Y.B. and Oh J.C. (1993) CGMA: A novel conceptual graph matching algorithm, Conceptual structures: theory and implementation, In H.D. Pfeiffer, T.E. Nagle (eds.), Springer Verlag Lecture notes in Artificial Intelligence754, 252–261.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kabbaj, A., Moulin, B., Gancef, J., Nadeau, D., Rouleau, O. (2001). Uses, Improvements, and Extensions of Prolog+CG: Case Studies. In: Delugach, H.S., Stumme, G. (eds) Conceptual Structures: Broadening the Base. ICCS 2001. Lecture Notes in Computer Science(), vol 2120. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44583-8_25
Download citation
DOI: https://doi.org/10.1007/3-540-44583-8_25
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42344-7
Online ISBN: 978-3-540-44583-8
eBook Packages: Springer Book Archive