Satchmore: Satchmo with Relevancy Satchmore: Satchmo with Relevancy
نویسندگان
چکیده
We introduce a relevancy detection algorithm to be used in conjunction with the SATCHMO prover. The version of SATCHMO considered here is essentially a bidi-rectional 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. A 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.
منابع مشابه
Satchmorebid: Satchmo(re) with Bidirectional Relevancy Satchmorebid: Satchmo(re) with Bidirectional Relevancy
SATCHMORE was introduced as a mechanism to integrate relevancy testing with the model-generation theorem prover SATCHMO. This made it possible to avoid invoking some clauses that appear in no refutation, which was a major drawback of the SATCHMO approach. SATCHMORE relevancy, however, is driven by the entire set of negative clauses and no distinction is accorded to the query negation. Under unf...
متن کاملOn the Relationship Between Non-Horn Magic Sets and Relevancy Testing
Model-generation based theorem provers such as SATCHMO and MGTP suffer from a combinatorial explosion of the search space caused by clauses irrelevant to the goal (negative clause) to be solved. To avoid this, two typical methods have been proposed. One is relevancy testing implemented in SATCHMORE by Loveland et al., and the other is non-Horn magic sets that are the extension of Horn magic set...
متن کاملSATCHMO-JS: a webserver for simultaneous protein multiple sequence alignment and phylogenetic tree construction
We present the jump-start simultaneous alignment and tree construction using hidden Markov models (SATCHMO-JS) web server for simultaneous estimation of protein multiple sequence alignments (MSAs) and phylogenetic trees. The server takes as input a set of sequences in FASTA format, and outputs a phylogenetic tree and MSA; these can be viewed online or downloaded from the website. SATCHMO-JS is ...
متن کاملSATCHMO: A Theorem Prover Implemented in Prolog
Satchmo is a theorem prover consisting of just a few short and simple Prolog programs. Prolog may be used for representing problem clauses as well. SATCHMO is based on a model-generation paradigm. It is refutation-complete if used in a levelsaturation manner. The paper provides a thorough report on experiences with SATCHMO. A considerable amount of problems could be solved with surprising effic...
متن کاملThe Theorem Prover Satchmo
Satchmo is an automated theorem prover for rst-order predicate logic. Its reasoning paradigm, model generation, is more powerful than the traditional refutation paradigm. Satchmo can be seen as an inference engine for expert systems capable of handling not only constructive and deenite speciications, but also normative and indeenite ones. The implementation of Satchmo in Prolog is possible in a...
متن کامل