Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
- 1 January 1972
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 19 (1) , 120-135
- https://doi.org/10.1145/321679.321689
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- Renamable paramodulation for automatic theorem proving with equalityArtificial Intelligence, 1970
- Interpolation Theorems for Resolution in Lower Predicate CalculusJournal of the ACM, 1970
- Automatic Theorem Proving With Renamable and Semantic ResolutionJournal of the ACM, 1967
- A review of automatic theorem-provingProceedings of Symposia in Applied Mathematics, 1967
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960
- A Proof Method for Quantification Theory: Its Justification and RealizationIBM Journal of Research and Development, 1960