A short survey on the state of the art in matching and unification problems

Authors:
P. Raulefs;J. Siekmann;P. Szabó;E. Unvericht
Affiliations:
Universität Bonn, Kurfürstenstr, Bonn;Universität Karlsruhe, Postfach, Karlsruhe;Universität Karlsruhe, Postfach, Karlsruhe;Universität Karlsruhe, Postfach, Karlsruhe
Venue:
ACM SIGSAM Bulletin
Year:
1979

Citing 22
Cited 9

SNOBOL , A String Manipulation Language

Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle

Journal of the ACM (JACM)
On Canonical Forms and Simplification

Journal of the ACM (JACM)
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets

Journal of the ACM (JACM)
Automated Theorem-Proving for Theories with Simplifiers Commutativity, and Associativity

Journal of the ACM (JACM)
Bounds for the String Editing Problem

Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
A theory of discrete patterns and their implementation in SNOBOL4

Communications of the ACM
Symbolic integration: the stormy decade

Communications of the ACM
A relational model of data for large shared data banks

Communications of the ACM
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism

Communications of the ACM
An Introduction to Database Systems

An Introduction to Database Systems
unification in typed lambda calculus

Proceedings of the Symposium on Lambda-Calculus and Computer Science Theory
Rapid identification of repeated patterns in strings, trees and arrays

STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
SCRATCHPAD/1: An interactive facility for symbolic mathematics

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
IAM, a system for interactive algebraic manipulation

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
REDUCE 2: A system and language for algebraic manipulation

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
The user-level semantic matching capability in MACSYMA

SYMSAC '71 Proceedings of the second ACM symposium on Symbolic and algebraic manipulation
CSSA: Language concepts and programming methodology

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
STRING-MATCHING AND OTHER PRODUCTS

STRING-MATCHING AND OTHER PRODUCTS
Language-qa4: a procedural calculus for intuitive reasoning.

Language-qa4: a procedural calculus for intuitive reasoning.
Report on the algorithmic language ALGOL 68

Report on the algorithmic language ALGOL 68

On unification: Equational theories are not bounded

Journal of Symbolic Computation
Associative-commutative unification

Journal of Symbolic Computation
History and basic features of the critical-pair/completion procedure

Journal of Symbolic Computation
Knuth-Bendix procedure and Buchberger algorithm: a synthesis

ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Unification in Boolean Rings and Abelian Groups

Journal of Symbolic Computation
Rewriting of rules containing set terms in a logic data language LDL

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complete Sets of Reductions for Some Equational Theories

Journal of the ACM (JACM)
A Unification Algorithm for Associative-Commutative Functions

Journal of the ACM (JACM)
The Markgraf Karl refutation procedure

IJCAI'81 Proceedings of the 7th international joint conference on Artificial intelligence - Volume 1

Quantified Score

Hi-index	0.00

Visualization

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].