首页 / 资料库 / 文献详情

{\bf (Revision of CS-1994-16.)} SATCHMORE: SATCHMO with RElevancy

W D LovelandW D ReedSue D Wilson

1993Computer Science被引 1

出版方页面 →

摘要

We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered here is essentially a bidirectional prover, utilizing Prolog (back chaining) on Horn clauses and forward chaining on non-Horn clauses. Our extension, SATCHMORE (SATCHMO with RElevancy), addresses the major weakness of SATCHMO: the uncontrolled use of forward chaining. By marking potentially relevant clause head literals, and then requiring that all the head literals be marked relevant (be ``totally relevant'''') before a clause is used for forward chaining, SATCHMORE is able to guide the use of these rules. Furthermore, the relevancy testing is performed without extending the proof search beyond what is done in SATCHMO. In addition, a very simple implementation of the extended SATCHMO can be written in Prolog. We describe our relevancy testing approach, present the implementation, prove soundness and completeness, and provide examples which demonstrate the power of relevancy testing.

引用本文(GB/T 7714)

W D Loveland, W D Reed, Sue D Wilson. {\bf (Revision of CS-1994-16.)} SATCHMORE: SATCHMO with RElevancy[J]. 未知来源, 1993.

引文网络

参考文献与被引分析加载中…

本站仅收录题录与摘要供学习参考,全文版权归属出版方;如有侵权请联系我们删除。