A relevance restriction strategy for aut
✍
David A Plaisted; Adnan Yahya
📂
Article
📅
2003
🏛
Elsevier Science
🌐
English
⚖ 295 KB
Identifying relevant clauses before attempting a proof may lead to more efficient automated theorem proving. Relevance is here defined relative to a given set of clauses S and one or more distinguished sets of support T . The role of a set of support T can be played by the negation of the theorem to