Unification in a combination of arbitrary disjoint equational theories

Journal of Symbolic Computation

Volumn 8, Issue 1-2, 1989, Pages 51-99

  Schmidt Schauß, Manfred ^a  

^a UNIVERSITY OF KAISERSLAUTERN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84937708748     PISSN: 07477171     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0747-7171(89)80022-7     Document Type: Article

References (75)

1. The Theory of Idempotent Semigroups is of Unification Type Zero
2. Orderings for equational proofs
3. A Rehabilitation of Robinson's Unification Algorithm
4. On the Structure of Abstract Algebras
5. Unification in Boolean Rings and Abelian Groups
6. On Equational Theories, Unification and Decidability
7. Some relationships between unification, restrited unification and matching
8. Matching—A special case of unification?
9. Unification algorithms for Boolean rings
10. Proving termination with multiset orderings
11. Properties of substitutions and unifications
12. Associative-Commutative Unification
13. Complete sets of unifiers and matchers in equational theories
14. Complete sets of unifiers and matchers in equational theories
15. A general complete E-unification procedure
16. Untersuchungen über das logische Schließen I
17. Recherches sur la théory de la démonstration
18. Combination of Unification Algorithms
19. Combination of Unification Algorithms in Equational Theories
20. Rewrite Methods for Clausal and Nonclausal Theorem Proving
21. Equations and Rewrite Rules
22. Résolution d'Équations dans des langages d'ordre 1,2,…,ω
23. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
24. Canonical Forms and Unification
25. Incremental Construction of Unification Algorithms in Equational Theories
26. Completion of a Set of Rules Modulo a Set of Equations
27. Completion of a Set of Rules Modulo a Set of Equations
28. A New Equational Unification Method: A Generalization of Martelli-Montanari's Algorithm
29. Méthodes et outlis de conception systématique d'algorithmes d'unification dans les théories équationelles
30. Computing Unification Algorithms
31. Methods and Tools for Equational Unification
32. First workshop on Unification
33. Simple Word Problems in Universal Algebras
34. Decision Procedures for Simple Equational Theories with Permutative Axioms: Complete Sets of Reductions
35. Abelian group unification algorithms for elementary terms
36. A progress report on new decision algorithms for finitely presented abelian groups
37. Unification of Sets and Multisets
38. The decision problem for equational bases of algebras
39. An Efficient Unification Algorithm
40. Unification in Boolean Rings
41. Simplification by cooperating decision procedures
42. Combining matching algorithms: The regular case, draft
43. Basic Narrowing Revisited
44. Linear Unification
45. Building in equational theories
46. A Machine-Oriented Logic Based on the Resolution Principle
47. Unification under Associativity and Idempotence is of Type Nullary
48. Unification in a combination of arbitrary disjoint equational theories
49. Computational aspects of an order-sorted logic with term declarations
50. Stringunification, Essex university
51. A Complete Unification Algorithm for Associative-Commutative Functions
52. A unification algorithm for associative-commutative functions
53. A comparison of the variable-abstraction and the constant-abstraction method for associative-commutative unification
54. Theory of first order unification (in German)
55. Equational Logic and Equational Theories of Algebra
56. Unification algorithms for combinations of arbitrary equational theories
57. First-Order Unification in Combinations of Equational Theories
58. Unification in Combination of Collapse Free Theories with Disjoint Sets of Function Symbols
59. On the Church-Rosser property for the direct sum of term rewriting systems
60. The Concept of Demodulation in Theorem Proving
61. Unification in Combinations of Collapse-Free Regular Theories