• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Computers and Artificial Intelligence >CONTROLLING THE CONSUMPTION OF STORAGE WITH SLIDING PRIORITY SEARCH IN A HYPER-LINKING BASED THEOREM PROVER
【24h】

CONTROLLING THE CONSUMPTION OF STORAGE WITH SLIDING PRIORITY SEARCH IN A HYPER-LINKING BASED THEOREM PROVER

机译：基于超链接的定理证明中的滑动优先搜索控制存储消耗

获取原文
获取原文并翻译 | 示例
       
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

The hyper-linking strategy proposed in [17] eliminates duplication of instances of clauses during the process of inference. However, hyper-instances were generated exhaustively by breadth-first search which may cause memory-paging troubles for hard problems since all hyper-instances have to be stored and processed. We present a sliding priority search to provide control on the number of hyper-instances saved and the amount of memory consumed by discarding those instances whose priority value exceeds a priority bound. The bound is set automatically rather than by the user. A technique similar to iterative deepening is also applied to preserve completeness of the hyper-linking strategy. The sliding priority method enabled us to get a number of proofs that could not be obtained with breadth-first search.
机译：[17]中提出的超链接策略消除了在推理过程中子句实例的重复。但是，超实例是通过广度优先搜索彻底生成的，由于所有超实例都必须存储和处理，因此可能会为难以解决的问题引起内存分页的麻烦。我们提出了一种滑动优先级搜索，以控制所保存的超实例的数量以及通过丢弃优先级值超过优先级限制的那些实例而消耗的内存量。边界是自动设置的，而不是由用户设置的。还使用类似于迭代加深的技术来保留超链接策略的完整性。滑动优先级方法使我们能够获得广度优先搜索无法获得的大量证明。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号