Reasoning with type definitions

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

Abstract

This article presents an extension of the basic model of conceptual graphs : the introduction of type definitions. We choose to consider definitions as sufficient and necessary conditions to belong to a type. We extend the specialization/generalization relation on conceptual graphs to take advantage of these definitions. Type contractions and type expansions are clearly defined. We establish the correspondence with projection by use of the atomic form of conceptual graphs. Finally, we give a logical interpretation of type definitions and prove than the correspondence between logical deduction and generalization relation is maintained.

Cite

CITATION STYLE

APA

Leclère, M. (1997). Reasoning with type definitions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1257, pp. 401–415). Springer Verlag. https://doi.org/10.1007/bfb0027886

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