A Structure-preserving Clause Form Translation
Journal of Symbolic Computation
Seventy-five problems for testing automatic theorem provers
Journal of Automated Reasoning
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
Automated Reasoning: Introduction and Applications
Automated Reasoning: Introduction and Applications
Model Finding Strategies in Semantically Guided Instance-based Theorem Proving
ISMIS '93 Proceedings of the 7th International Symposium on Methodologies for Intelligent Systems
SATCHMO: A Theorem Prover Implemented in Prolog
Proceedings of the 9th International Conference on Automated Deduction
Conditional Term Rewriting and First-Order Theorem Proving
CTRS '92 Proceedings of the Third International Workshop on Conditional Term Rewriting Systems
Clin: an automated reasoning system using clause linking
Clin: an automated reasoning system using clause linking
The unit preference strategy in theorem proving
AFIPS '64 (Fall, part I) Proceedings of the October 27-29, 1964, fall joint computer conference, part I
Using examples to generate instantiations of set variables
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 2
A proof method for quantification theory: its justification and realization
IBM Journal of Research and Development
Rough resolution: a refinement of resolution to remove large literals
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Hi-index | 0.00 |
Semantic hyper-linking has recently been proposed as a way to use semantics in an instance-based theorem prover. The basic procedure is to use semantics to help generate ground instances of the input clauses until the ground clause set is unsatisfiable. If the ground set is satisfiable, models are constructed periodically to guide generation of new ground instances and change the models, until no model can be constructed and a proof is found. In this paper we discuss some model finding strategies that can generate useful ground instances, without using semantics, to change the ground models. We show that such strategies are helpful and will not increase the search space of semantic hyper-linking. They also retain the completeness of semantic hyper-linking. In addition, since using semantics is often expensive and semantics is not used in those model finding strategies, they help to find proofs earlier and faster.