Unification in the equational theory of one-sided distributivity and a multiplicative unit is shown to be decidable. The algorithm is a non-deterministic one that eventually uses a decision algorithm for string unification problems with constant restrictions, which was shown to be decidable by K. Sc
A unification in the added mass theory of planing
β Scribed by P.R. Payne
- Publisher
- Elsevier Science
- Year
- 1992
- Tongue
- English
- Weight
- 626 KB
- Volume
- 19
- Category
- Article
- ISSN
- 0029-8018
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
Undertaking a dynamic "nite element analysis on a tank containing a #uid either requires both the #uid and tank to be modelled or the mass of the vessel's walls and base to be adjusted to account for the presence of the #uid. The former generally requires specialized solid elements to model the #uid