首页 | 本学科首页   官方微博 | 高级检索  
     


The problem of determining the size of a complete set of reductions
Authors:Larry Wos
Affiliation:(1) Argonne National Laboratory, 9700 South Cass Ave., 60439-4801 Argonne, IL, USA
Abstract:This article is the tenth of a series of articles discussing various open research problems in automated reasoning. Here we focus on finding criteria for accurately predicting the size of a complete set of reductions when such a set exists. We include a suggestion for evaluating a proposed solution to this research problem.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38.
Keywords:Automated reasoning  complete set of reductions  demodulators  unsolved research problem
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号