首页 正文

Journal of automated reasoning. 1993;11(1):83-113. doi: 10.1007/bf00881901 Q40.72025

Bounded-overhead caching for definite-clause theorem proving

确定性子句定理证明的开销受限缓存

Alberto Segre; Daniel Scharstein

DOI: 10.1007/bf00881901

摘要 查看摘要

Copyright © . 中文内容为AI机器翻译,仅供参考!

期刊名:Journal of automated reasoning

缩写:J AUTOM REASONING

ISSN:0168-7433

e-ISSN:1573-0670

IF/分区:0.7/Q4

文章目录 更多期刊信息

全文链接
引文链接
复制
已复制!
推荐内容
Bounded-overhead caching for definite-clause theorem proving