Data structures and control architecture for implementation of theorem-proving programs
Ross Overbeek, Ewing L. Lusk · Lecture notes in computer science · 1980
Cited by 15 works. doi:10.1007/3-540-10009-1_19
Authors
References
- Complexity and related enhancements for automated theorem-proving programs
- Problems and Experiments for and with Automated Theorem-Proving Programs
- An implementation of hyper-resolution
- Generation and Verification of Finite Models and Counterexamples Using an Automated Theorem Prover Answering Two Open Questions
- A New Class of Automated Theorem-Proving Algorithms
- Automated generation of models and counterexamples and its application to open questions in Ternary Boolean algebra
- Semigroups, antiautomorphisms, and involutions: a computer solution to an open problem. I
- Hyperparamodulation: A refinement of paramodulation