Seventy-five problems for testing automatic theorem provers
Journal of Automated Reasoning
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Efficiency and Completeness of the Set of Support Strategy in Theorem Proving
Journal of the ACM (JACM)
Solution of the Robbins Problem
Journal of Automated Reasoning
MGTP: A Model Generation Theorem Prover - Its Advanced Features and Applications
TABLEAUX '97 Proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
The Markgraf Karl Refutation Procedure (MKRP)
Proceedings of the 8th International Conference on Automated Deduction
SCOTT: Semantically Constrained Otter System Description
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Semantically Guided First-Order Theorem Proving using Hyper-Linking
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
KEIM: A Toolkit for Automated Deduction
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
System Description: PTTP+GLiDes: Semantically Guided PTTP
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
Vampire 1.1 (System Description)
IJCAR '01 Proceedings of the First International Joint Conference on Automated Reasoning
SCOTT: a model-guided theorem prover
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Semantic Selection for Resolution in Clause Graphs
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Hi-index | 0.00 |
Semantic goal-directed forward reasoning is a three stage procedure. In the first stage a reference set of models is generated from the negated theorem. In the second stage the assumption clause set is refined to a set which has an as small set of models as possible in common with the negated theorem with respect to the reference set of models. In the last stage a refutation is generated in the space consisting of the original problem along with the refined assumption. In order to form a refined assumption, unlike traditional approaches like set of support, only clauses from assumptions are resolved with each other.