Unification in Boolean rings and Abelian groups

DOI10.1016/S0747-7171(89)80054-9zbMATH Open0689.68040WikidataQ55878423 ScholiaQ55878423MaRDI QIDQ582073FDOQ582073

Authors: Alexandre Boudet, Jean-Pierre Jouannaud, Manfred Schmidt-Schauß 

Publication date: 1989

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Recommendations

• Unification in Boolean rings
• scientific article; zbMATH DE number 4080961
• scientific article; zbMATH DE number 4049133
• On the complexity of Boolean unification
• Unification algorithms cannot be combined in polynomial time.

zbMATH Keywords

arbitrary equational theoriescomplete unification algorithmVLSI verification

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Abstract data types; algebraic specification (68Q65) Ring-theoretic properties of Boolean algebras (06E20)

Cites Work

• An Efficient Unification Algorithm
• A Machine-Oriented Logic Based on the Resolution Principle
• A Unification Algorithm for Associative-Commutative Functions
• Deciding Combinations of Theories
• Title not available (Why is that?)
• On the Church-Rosser property for the direct sum of term rewriting systems
• Associative-commutative unification
• Automata, languages and programming. 10th Colloquium, Barcelona, Spain, Juli 18-22, 1983
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizations of unification type zero
• Title not available (Why is that?)

Cited In (14)

• Unification algorithms cannot be combined in polynomial time.
• Boolean functional synthesis: hardness and practical algorithms
• Towards Parallel Boolean Functional Synthesis
• On equational theories, unification, and (un)decidability
• Unification in commutative semigroups
• Unification algorithms cannot be combined in polynomial time
• Title not available (Why is that?)
• On the complexity of Boolean unification
• Abstract data type systems
• Unification in a combination of arbitrary disjoint equational theories
• Efficient general AGH-unification
• Unification in Boolean rings
• Tactics for Reasoning Modulo AC in Coq
• Unification in a combination of equational theories: an efficient algorithm

This page was built for publication: Unification in Boolean rings and Abelian groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q582073)