Fuzzy unification and resolution proof procedure for fuzzy conceptual graph programs

11Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Fuzzy conceptual graph programs are order-sorted fuzzy Iogic programs based on fuzzy conceptual graphs (FCGs). In this paper, we develop fuzzy unification and resolution proof procedure, taking into account fuzziness of FCGs and properties of fuzzy reasoning, for FCG programs. General issues of both CG and FCG unifications and resolution procedures are also analysed and solutions to them are proposed. The resolution procedure is proved to be sound with respect to the declarative semantics of FCG programs.

Cite

CITATION STYLE

APA

Cao, T. H., Creasy, P. N., & Wuwongse, V. (1997). Fuzzy unification and resolution proof procedure for fuzzy conceptual graph programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1257, pp. 386–400). Springer Verlag. https://doi.org/10.1007/bfb0027885

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free