A new method for first-order theorem proving based on the Boolean ring approach is proposed. The method is an extension of Hsiang's N-Strategy in two aspects: (1) When the input polynomials are derived from clauses, our method is reduced to a more restricted (but still complete) version of \(\mathrm
Linear strategy for boolean ring based theorem proving
โ Scribed by Jinzhao Wu; Zhuojun Liu
- Publisher
- Springer
- Year
- 2000
- Tongue
- English
- Weight
- 560 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1000-9000
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
## SOME RECENT DEVELOPMENTS IN COMPLETE STRATEGIES FOR THEOREM-PROVING BY COMPUTER1) by BERNARD MELTZER in Edinburgh, Scotland
Two command governors (CG) are described for solving set-point tracking problems for nonlinear systems when pointwise-in-time input and/or state related inequality constraints have to be ful"lled. A CG is a nonlinear device which is added to a primal compensated system. The CG action, based on the c
Proposed in this paper is a new approach of design using a monovariable generalized predictive control law, with multiple reference model (GPC/MRM) to control, "rstly, rotor speed and rotor #ux amplitude of an induction machine. The control law will be extended and applied, secondly, to answer a sec