Abstract
The relation between generalized resolution and NC-resolution is discussed. The proof of the completeness of NC linear resolution is then given. The incompleteness of NC lock resolution is also presented, thus the conclusion in [3] of “a simple completeness-preserving restriction” is shown to be wrong.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Liu Xuhua and Jiang Yunfei. Theorem Mechanical Proving (in Chinese). Beijing: Science Press, 1987.
Wang Xianghao and Liu Xuhua. Generalized resolution (in Chinese).Chinese Journal of Computers, 1982, 5(2), pp. 81–92.
Murray, N.V..Completely Non-linear Theorem Proving.Artificial Intelligence, 1982, 18(1), pp. 67–85.
Zeng Yunfeng. Automated deduction with abstraction (in Chinese). Ph. D. Thesis, Institute of Software, Chinese Academy of Sciences, Beijing, China, 1990.
Toni Bollinger. A model elimination calculus for generalized clauses. Proc. 12th IJCAI, Sydney, Australia, Aug. 1991, pp. 126–131.
Sun Jigui and Liu Xuhua. Generalized linear semi-lock resolution (in Chinese). Science Bulletin, 1992, 37(19), pp. 1812–1814.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Liu, X., Sun, J. Generalized resolution and NC-resolution. J. of Compt. Sci. & Technol. 9, 160–167 (1994). https://doi.org/10.1007/BF02939497
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02939497