Automated reasoning and exhaustive search: Quasigroup existence problems

ISCAS OpenIR

	Automated reasoning and exhaustive search: Quasigroup existence problems
	J. Slaney; M. Fujita; M. Stickel
	1995
发表期刊	Computers & Mathematics with Applications
卷号	29 期号:2 页码:115-132
摘要	This is a report of research carried out during 1992 and 1993 in which three different automated reasoning programs—DDPP, FINDER, and MGTP—were applied to a series of exhaustive search problems in the theory of quasigroups. All three of the programs succeeded in solving previously open problems concerning the existence of quasigroups satisfying certain additional conditions. Using different programs has allowed us to cross-check the results, helping reliability. We find this research interesting from several points of view: first, it brings techniques from the field of automated reasoning to bear on a rather different problem domain from that which motivated their development; second, investigating such hard problems leads us to push the limits of what our systems have achieved; and finally, it involves us in serious philosophical issues concerning essentially computational proofs.
收录类别	其他
合作性质	其它
关键词	Quasigroups Exhaustive Search Consistent Labeling Automated Reasoning Programs
语种	英语
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/1314
专题	中国科学院软件研究所
推荐引用方式 GB/T 7714	J. Slaney,M. Fujita,M. Stickel. Automated reasoning and exhaustive search: Quasigroup existence problems[J]. Computers & Mathematics with Applications,1995,29(2):115-132.
APA	J. Slaney,M. Fujita,&M. Stickel.(1995).Automated reasoning and exhaustive search: Quasigroup existence problems.Computers & Mathematics with Applications,29(2),115-132.
MLA	J. Slaney,et al."Automated reasoning and exhaustive search: Quasigroup existence problems".Computers & Mathematics with Applications 29.2(1995):115-132.

条目包含的文件
文件名称/大小	文献类型	版本类型	开放类型	使用许可
BJ01133408.pdf（1323KB）			开放获取	使用许可	请求全文