Unification theory

Journal of Symbolic Computation

Volumn 7, Issue 3-4, 1989, Pages 207-274

  Siekmann, Jörg H ^a  

^a UNIVERSITY OF KAISERSLAUTERN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84990727549     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(89)80012-4     Document Type: Article

References (91)

1. Resolution in Type Theory
2. Automating Higher Order Logic
3. Some techniques for recognizing Structures in Pictures
4. Entwurf und Implementierung von CSSA, vol. A-E
5. On the Structure of Abstract Algebras
6. Partial Unification for Graph based Equational Reasoning
7. SCRATCHPAD/1: An interactive Facility for Symbolic Mathematics
8. An Overview of KRL
9. History and Basic Features of the Critical-Pair Completion Procedure
10. Thue Systems as Rewriting Systems
11. A Fast String Searching Algorithm
12. An Overview of KL-ONE
13. Search Methods used with Transistor Patent Applications
14. History and Basic Features of the Critical-Pair Completion Procedure
15. A Semantics of Multiple Inheritance
16. A Formulation of the Simple Theory of Types
17. Eliminating the Irrelevant from Mechanical Proofs
18. Finiteness of the Odd Perfect and Primitive Abundant Numbers
19. SNOBOL as String Manipulation Language
20. The User-Level Semantic Matching Capability in MACSYMA
21. OPS5 User Manual
22. Rete: A Fast Algorithm for the Many Pattern/Object Match Problem
23. A Tutorial on the Warren Abstract Machine
24. Initial Algebra Semantics and Continuous Algebras
25. Order sorted algebra
26. Eqlog: Equality, Types and Generic Modules for Logic Programming
27. Über die Auflösung linearer Gleichungen mit reellen Coefficienten
28. Automated Logic for Semi-Automated Mathematics
29. Semi-Automated Mathematics
30. REDUCE2, A System and Language for Algebraic Manipulation
31. Description and Theoretical Analysis of PLANNER, a Language for Proving Theorems and Manipulation Models in a Robot
32. Equations and Rewirte Rules
33. A Theory of Truth and Semantic Representation
34. Complexity of finitely presented algebras
35. How to clear a block: Plan formation in situational logic
36. Rational Functions in MATHLAB
37. The Decision Problem of Equational Bases of Algebras
38. A Framework for Representing Knowledge
39. Computational Logic: Structure Sharing
40. Symbolic Integration: The Stormy Decade
41. MACSYMA-the fifth Year
42. Fast Decision Procedures based on Congruence Closure
43. A Human Oriented Logic for ATP
44. Untersuchungen zur mehrsortigen Quantorenlogik
45. A Resolution Calculus for Modal Logics
46. An Improved Proof Procedure
47. PESA, A Parallel Architecture for OPS5 Production Systems
48. Graph Family Matching
49. Mechanizing Higher Order Logic
50. A Complete Logical Calculus for Record Structures Representing Linguistic Information
51. Deciding Combinations of Theories
52. A Noetherian and Complete Rewirte System for Idempotent Semigroups
53. ATP with built-in Theories including Equality, Partial Ordering and Sets
54. A Graph-theoretical Algorithm for Matching Chemical Structures
55. Equational Logic and Equational Theories of Algebra
56. Equational Logic
57. Natural Language Processing
58. The mathematics of Inheritance Systems
59. An Algorithm for Subgraph Isomorphism
60. GIT-Heuristic program for Testing Pairs of Directed Line Graphs for Isomorphism
61. Classified Algebras
62. Matrix Proof Methods for Modal Logics
63. An Abstract Prolog Instruction Set
64. The Concept of Demodulation in Theorem Proving
65. Maximal Models and Refutation Completeness: Semidecision Procedures in Automatic Theorem Proving