Unification in Boolean rings and Abelian groups
From MaRDI portal
Publication:582073
DOI10.1016/S0747-7171(89)80054-9zbMath0689.68040WikidataQ55878423 ScholiaQ55878423MaRDI QIDQ582073
Jean-Pierre Jouannaud, Alexandre Boudet, Manfred Schmidt-Schauss
Publication date: 1989
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
68W30: Symbolic computation and algebraic computation
68Q65: Abstract data types; algebraic specification
06E20: Ring-theoretic properties of Boolean algebras
Related Items
Unification in a combination of arbitrary disjoint equational theories, Unification in commutative semigroups, Abstract data type systems, On equational theories, unification, and (un)decidability, Unification algorithms cannot be combined in polynomial time.
Cites Work
- Associative-commutative unification
- Automata, languages and programming. 10th Colloquium, Barcelona, Spain, Juli 18-22, 1983
- Deciding Combinations of Theories
- A Unification Algorithm for Associative-Commutative Functions
- An Efficient Unification Algorithm
- Characterizations of unification type zero
- On the Church-Rosser property for the direct sum of term rewriting systems
- A Machine-Oriented Logic Based on the Resolution Principle
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item