Automated reasoning and exhaustive search: Quasigroup existence problems
文献类型：期刊论文
| 作者 | J. Slaney ; M. Fujita ; M. Stickel |
| 刊名 | Computers & Mathematics with Applications
 |
| 出版日期 | 1995 |
| 卷号 | 29期号:2页码:115-132 |
| 关键词 | Quasigroups Exhaustive search Consistent labeling Automated reasoning programs |
| 合作状况 | 其它 |
| 英文摘要 | 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. |
| 收录类别 | 其他 |
| 语种 | 英语 |
| 公开日期 | 2010-05-13 |
| 源URL | [http://124.16.136.157/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. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。