History and basic features of the critical-pair/completion procedure
Journal of Symbolic Computation
SNOBOL , A String Manipulation Language
Journal of the ACM (JACM)
The Concept of Demodulation in Theorem Proving
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
Journal of the ACM (JACM)
An Algorithm for Subgraph Isomorphism
Journal of the ACM (JACM)
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
A fast string searching algorithm
Communications of the ACM
Symbolic integration: the stormy decade
Communications of the ACM
GIT—a heuristic program for testing pairs of directed line graphs for isomorphism
Communications of the ACM
Partial Unification for Graph Based Equational Reasoning
Proceedings of the 9th International Conference on Automated Deduction
Complexity of Finitely Presented Algebras
Complexity of Finitely Presented Algebras
Search methods used with transistor patent applications
IEEE Spectrum
Journal of Symbolic Computation
Unification in permutative equational theories is undecidable
Journal of Symbolic Computation
Unification in primal algebras, their powers and their varieties
Journal of the ACM (JACM)
Discriminator varieties and symbolic computation
Journal of Symbolic Computation
Fundamentals of Deductive Program Synthesis
IEEE Transactions on Software Engineering
Combining matching algorithms: The regular case
Journal of Symbolic Computation
Type inference in the presence of overloading, subtyping and recursive types
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Logic programming with typed unification and its realization on an abstract machine
IBM Journal of Research and Development
Unification for completely commutative theories
SAC '92 Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing: technological challenges of the 1990's
Verification of proofs for the B formal development process
ACM SIGPLAN Notices
A multi-theory constraint satisfaction system
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Unification in commutative theories, Hilbert's basis theorem, and Gröbner bases
Journal of the ACM (JACM)
On solving equations and disequations
Journal of the ACM (JACM)
Agent language NUML and its reduction implementation model based on HO&pgr;
ACM SIGPLAN Notices
Dimension inference under polymorphic recursion
FPCA '95 Proceedings of the seventh international conference on Functional programming languages and computer architecture
Optimal unification of bound simple set-terms
CIKM '96 Proceedings of the fifth international conference on Information and knowledge management
Sets and constraint logic programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
An Algorithm for General Set Unification and Its Complexity
Journal of Automated Reasoning
Complexity and Algorithms for the Matching of Bag and Set Terms
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Combining Pattern E-Unification Algorithms
RTA '01 Proceedings of the 12th International Conference on Rewriting Techniques and Applications
Type and behaviour reconstruction for higher-order concurrent programs
Journal of Functional Programming
Theory and Practice of Logic Programming
A uniform approach to constraint-solving for lists, multisets, compact lists, and sets
ACM Transactions on Computational Logic (TOCL)
Unification and Matching Modulo Leaf-Permutative Equational Presentations
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
A Modular Equational Generalization Algorithm
Logic-Based Program Synthesis and Transformation
Electronic Notes in Theoretical Computer Science (ENTCS)
Extending the resolution method with sorts
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Termination of narrowing revisited
Theoretical Computer Science
Building theories into instantiation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Solving planning problems by partial deduction
LPAR'00 Proceedings of the 7th international conference on Logic for programming and automated reasoning
Theory-specific automated reasoning
A 25-year perspective on logic programming
UNIFICATION MODULO ACI + 1 + 0
Fundamenta Informaticae
| Hi-index | 0.00 |
Most knowledge based systems in artificial intelligence (AI), with a commitment to asymbolic representation, support one basic operation: ''matching of descriptions''. This operation, called unification in work on deduction, is the ''addition-and-multiplication'' of AI-systems and is consequently often supported by special purpose hardware or by a fast instruction set on most AI-machines. Unification theory provides the formal framework for investigations into the properties of this operation. This article surveys what is presently known in unification theory and records its early history.