Unification is one of the basic concepts of automated theorem proving. It concerns such questions as finding solutions of finite sets of equations, determining if every solution comes from a most general solution, and if so, determining how many most general solutions are needed to generate all solu
✦ LIBER ✦
Unification in commutative idempotent monoids
✍ Scribed by Franz Baader; Wolfram Büttner
- Publisher
- Elsevier Science
- Year
- 1988
- Tongue
- English
- Weight
- 891 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
Unification in Commutative Semigroups
✍
Andrzej Kisielewicz
📂
Article
📅
1998
🏛
Elsevier Science
🌐
English
⚖ 161 KB
Overlaps in free partially commutative m
✍
Friedrich Otto; Celia Wrathall
📂
Article
📅
1991
🏛
Elsevier Science
🌐
English
⚖ 832 KB
On some equations in free partially comm
✍
Christine Duboc
📂
Article
📅
1986
🏛
Elsevier Science
🌐
English
⚖ 902 KB
Hopf algebras and identities in free par
✍
William Schmitt
📂
Article
📅
1990
🏛
Elsevier Science
🌐
English
⚖ 658 KB
Lyndon heaps: An analogue of Lyndon word
✍
Pierre Lalonde
📂
Article
📅
1995
🏛
Elsevier Science
🌐
English
⚖ 974 KB
Holomorphic Idempotents and Retracts in
✍
Jerry R. Muir Jr.
📂
Article
📅
2000
🏛
Elsevier Science
🌐
English
⚖ 189 KB
Let A be a commutative C U -algebra with identity and open unit ball B. We study holomorphic functions F: B ª B that are idempotent under composition and establish necessary and sufficient conditions for a set R : B to be the image Ž of B under such an idempotent function. In other words, R is a hol