Well-behaved inference rules for first-order theorem proving

CSpace

	Well-behaved inference rules for first-order theorem proving
	Wu, JZ ; Liu, ZJ
	1998-12-01
发表期刊	JOURNAL OF AUTOMATED REASONING
ISSN	0168-7433
卷号	21 期号:3 页码:381-400
摘要	The concept of well-behaved inference rules is developed in first-order polynomial-based theorem proving. It is shown that well-behaved inference rules are complete for both the set of support strategy and the linear strategy. Furthermore, two concrete inference rules that are well behaved are presented, and two other strategies for them are described.
关键词	inference rule first-order polynomial set-of-support deduction linear deduction
语种	英语
WOS研究方向	Computer Science
WOS类目	Computer Science, Artificial Intelligence
WOS记录号	WOS:000076951100006
出版者	KLUWER ACADEMIC PUBL
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/13416
专题	中国科学院数学与系统科学研究院
作者单位	1.Peking Univ, Dept Math, Beijing 100871, Peoples R China 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wu, JZ,Liu, ZJ. Well-behaved inference rules for first-order theorem proving[J]. JOURNAL OF AUTOMATED REASONING,1998,21(3):381-400.
APA	Wu, JZ,&Liu, ZJ.(1998).Well-behaved inference rules for first-order theorem proving.JOURNAL OF AUTOMATED REASONING,21(3),381-400.
MLA	Wu, JZ,et al."Well-behaved inference rules for first-order theorem proving".JOURNAL OF AUTOMATED REASONING 21.3(1998):381-400.