Linear strategy for boolean ring based theorem proving

CSpace

	Linear strategy for boolean ring based theorem proving
	Wu, JZ ; Liu, ZJ
	2000-05-01
发表期刊	JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
ISSN	1000-9000
卷号	15 期号:3 页码:271-279
摘要	Two inference rules are discussed in boolean ring based theorem proving, and linear strategy is developed. It is shown that both of them are complete for linear strategy. Moreover, by introducing a partial ordering on atoms, pseudo O-linear and O-linear strategies are presented. The former is complete, the latter, however, is complete for clausal theorem proving.
关键词	boolean ring linear strategy Herbrand theorem O-linear strategy
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Hardware & Architecture ; Computer Science, Software Engineering
WOS记录号	WOS:000089936700008
出版者	SCIENCE PRESS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/15572
专题	中国科学院数学与系统科学研究院
通讯作者	Wu, JZ
作者单位	1.Max Planck Inst Informat, D-66123 Saarbrucken, Germany 2.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wu, JZ,Liu, ZJ. Linear strategy for boolean ring based theorem proving[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2000,15(3):271-279.
APA	Wu, JZ,&Liu, ZJ.(2000).Linear strategy for boolean ring based theorem proving.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,15(3),271-279.
MLA	Wu, JZ,et al."Linear strategy for boolean ring based theorem proving".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 15.3(2000):271-279.