A short survey on the state of the art in matching and unification problems
- 1 May 1979
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGSAM Bulletin
- Vol. 13 (2), 14-20
- https://doi.org/10.1145/1089208.1089210
Abstract
1. Motivations There is a wide variety of areas where matching and unification problems arise: (1.1) Databases The user of a (relational) database [22] may logically AND the properties she wants to retrieve or else she may be interested in the NATURAL JOIN [17] of two stored relations. In neither case, she would appreciate if she constantly had to take into account that AND is an associative and commutative operation, or that NATURAL JOIN obeys an associative axiom, which may distribute over some other operation [68].Keywords
This publication has 20 references indexed in Scilit:
- An Algorithm for Subgraph IsomorphismJournal of the ACM, 1976
- Bounds for the String Editing ProblemJournal of the ACM, 1976
- MACSYMA - the fifth yearACM SIGSAM Bulletin, 1974
- A theory of discrete patterns and their implementation in SNOBOL4Communications of the ACM, 1973
- Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and SetsJournal of the ACM, 1972
- Symbolic integrationCommunications of the ACM, 1971
- Introduction to “feature analysis of generalized data base management systems”Communications of the ACM, 1971
- On Canonical Forms and SimplificationJournal of the ACM, 1970
- GIT—a heuristic program for testing pairs of directed line graphs for isomorphismCommunications of the ACM, 1964
- SNOBOL , A String Manipulation LanguageJournal of the ACM, 1964