✦ LIBER ✦

Deciding the Word Problem in the Union of Equational Theories

✍ Scribed by Franz Baader; Cesare Tinelli

Book ID: 112252685
Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 368 KB
Volume: 178
Category: Article
ISSN: 0890-5401
DOI: 10.1006/inco.2001.3118

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On connection between the word problem a

On connection between the word problem and decidability of the equational theory

✍ V. Yu. Popov 📂 Article 📅 2000 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 246 KB

Unification in the Union of Disjoint Equ

Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures

✍ FRANZ BAADER; KLAUS U. SCHULZ 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 756 KB

Most of the work on the combination of unification algorithms for the union of disjoint equational theories has been restricted to algorithms that compute finite complete sets of unifiers. Thus the developed combination methods usually cannot be used to combine decision procedures, i.e., algorithms

Deciding the word problem in pure double

Deciding the word problem in pure double Boolean algebras

✍ Philippe Balbiani 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 275 KB

Combining Decision Algorithms for Matchi

Combining Decision Algorithms for Matching in the Union of Disjoint Equational Theories

✍ Christophe Ringeissen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 1016 KB

On the decidability of the word problem

On the decidability of the word problem for

✍ M. Mazzucchelli; A. Cherubini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 506 KB

Structural diversity in the lattice of e

Structural diversity in the lattice of equational theories

✍ George F. McNulty 📂 Article 📅 1981 🏛 Springer 🌐 English ⚖ 1009 KB