Abstract
The classification and recognition problems are fundamental to an understanding of object identification and retrieval in a CAST library or repository.
In this paper, we have attempted to provide a framework in the guise of categories of approximations and categorical shape theory, in which to consider these problems. In doing so, we have chosen to specify CAST objects in terms of well-defined mathematical entities, namely, sketches. Crucial to classification and recognition in this context is the need to match sketches. By emphasising their geometric aspects we have suggested that a graph theoretic view of matching might be fruitful.
Much more work needs to be done, of course, to exploit categorical shape theory and the theory of sketches in this area. The geometric matching algorithm, too, must be generalised to deal properly with cones and cocones, and to deal with partial matching of sketches. This is not trivial and may benefit from the generalised matching algorithm design approach of Srinivas, based on sheaf theory [32].
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M Barr, C Wells: Topos, Triples, and Theories, Springer-Verlag, New York, 1985.
M Barr: “Models of Sketches”, Cahiers de Topologie et Géométrie Difféntielle Catégoriques, XXVII, 2, 1986.
M Barr, C Wells: Category Theory for Computing Science, Prentice-Hall International Series in Computer Science, London, 1990.
F L Bauer, M Wirsing: “Crypt-Equivalent Algebraic Specifications”, Acta Informatica, 25, 1988.
K Borsuk: Theory of Shape, Monografie Matematyczne, 59, Warsaw, 1975.
J G Carbonell: “Derivational Analogy and Its Role in Problem-Solving”, Proceedings AAAI-83, Washington, 1983.
J-M Cordier, T Porter: “Pattern Recognition and Categorical Shape Theory”, UCNW Pure Maths Preprint 86.16, University of Wales, Bangor, UK, 1986.
J-M Cordier, T Porter: Shape Theory: categorical approximation methods, Ellis Horwood Ltd., 1990.
A Deleanu, P Hilton: “On the Categorical Shape of a Functor”, Fundamenta Mathematicae, XCVII, 3, 1977.
C Ehresmann: “Esquisses et Types des Structures Algébriques”, Bull. Instit. Polit., Iasi, XIV, 1968.
H Ehrig, B Mayr: Fundamentals of Algebraic Specification, Vol. I: Equations and Initial Semantics, Springer-Verlag, 1985.
H-D Ehrich, A Sernadas, C Sernadas; “Objects, Object Types, and Object Identification”, Lecture Notes in Computer Science, 393, 1989.
D Eichmann, J Atkins: “Design of a Latticed-Based Faceted Classification System”, 2nd International Conference on Software Engineering and Knowledge Engineering, Skokie, Illinois, June 21–23 1990.
W Gaube, H C Mayr, P C Lockemann: “Retrieval in a Module Library Using Formal Specifications: preliminary search using syntactic properties”, Preprint, Institut für Informatik II, Universität Karlsruhe, 1985.
R Gould: Graph Theory, Benjamin Cummings Publ., 1988.
J W Gray: “Categorical Aspects of Data Type Constructors”, Theoretical Computer Science, 50, 2, 1987.
R Guitart, C Lair: “Calcul syntaxique des modèles et formules internes”, Diagrammes, 4, 1980.
R Guitart, C Lair: “Limites et co-limites pour représenter les formules”, Diagrammes, 7, 1982.
D Kapur, H Zhang: “An overview of RRL: Rewrite Rule Laboratory”, 9th International Conference on Automated Deduction, Lecture Notes in Computer Science, 355, 1989.
C Lair: “Etude Générale de la Categorie des Esquisses”, Esquisses Math., 23, Amiens, 1975.
C Lair: “Catégories qualifiables et catégories esquissables”, Diagrammes, 17, 1987.
C Lair: “Trames et Sémantiques Catégoriques des Systèmes de Trames”, Diagrammes, 18, Paris, 1987.
S K Lellali: “Categorical Abstract Data Types (CADT)”, Digrammes, 21 1989.
S MacLane: Categories for the Working Mathematician, Springer-Verlag, New York, 1971.
M Makai, R Paré: Accessible Categories: the Foundations of Categorical Model Theory, Contemporary Mathematics, 104, American Mathematics Society Publication, 1989.
R Prieto-Diaz, P Freeman: “Classifying Software for Reusability”, IEEE Software, 1987.
C Rattray, J McInnes, A C Reeves, M Thomas: “Software Re-Usability in a Knowledge-Based Environment”, Proceedings of 3rd Annual Knowledge-Based Assistant Conference, Rome Air Development Center, Utica, 1988.
C Rattray: “Systems Factories and CAST”, in Cybernetics and Systems '90 (R Trappl: editor), World Scientific Publ. Co., 1990.
C Rattray, J McInnes, A C Reeves, M Thomas: “A Knowledge-Based Model for Software Re-Usability”, in Artificial Intelligence and Software Engineering (D Partridge: editor), Ablex Publ. Co., New York, 1990.
P Rowlinson: personal communication, 1991.
G-C Rota, D H Sharp, R Sokolowski: “Syntax, Semantics, and the Problem of the Identity of Mathematical Objects”, J Phil of Science, 55, 3, 1988.
Y V Srinivas: “Pattern Matching: a Sheaf-Theoretic Approach”, 2nd International Conference on Algebraic Methodology and Software Technology (AMAST'91), Workshops in Computing Series, Springer-Verlag, 1992.
Tanvir Ahmed: PhD thesis, Department of Computer Science, University of Strathclyde, UK, 1991.
Y S Yang: personal communication, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rattray, C., Marsden, M. (1992). Object identification and retrieval in a CAST library. In: Pichler, F., Díaz, R.M. (eds) Computer Aided Systems Theory — EUROCAST '91. EUROCAST 1991. Lecture Notes in Computer Science, vol 585. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021012
Download citation
DOI: https://doi.org/10.1007/BFb0021012
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55354-0
Online ISBN: 978-3-540-47034-2
eBook Packages: Springer Book Archive