Intelligent CAI course in the first-order logic
Our theorem proving system named TTP (which is short for Teaching Theorem Proving) can construct the natural deduction proofs of the first-order logic formulas with quantifiers. It is written in CLISP. It has 4 learning models. Students can use the system to do their logic homework step by step and learn the skills of proving logic theorems. If they don't know how to prove the theorems, they can ask for hints. In our university about 300 students used the system to learn logic and do homework during 3 years, they did 2000 problems in logic.
Keywordsfirst-order logic natural deduction resolution tautology theorem proving
Unable to display preview. Download preview PDF.
- Andrews, P. B., An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof, Orlando, Academic Pr., Inc., 1986.Google Scholar
- Dafa, Li, Extended Tautology, Journal of Tsinghua University, Vol. 27, No.3, 1987.Google Scholar
- Manna, Z., Mathematical Theory of Computation, New York, 1974.Google Scholar
- Pelletier, F. J., Seventy-Five problems for Testing Automatic Theorem provers, J. of Automated Reasoning, Vol. 2, No. 2, 191–216, 1986.Google Scholar
- Smullyan, R. M., First-Order Logic, Springer-Verlag, New York, 1968.Google Scholar
- Stanat, D. F. and McAlliister, D. F., Discrete Mathematics in Computer Science, Prentice-Hall, Inc., Englewood Cliffs, N.J., 1977.Google Scholar
- Suppes Patrick, University-Level Computer-Asisted Instrution At Stanford: 1968–1980.Google Scholar
- Tremblay, J. P. and Manohar, R., Discrete Mathematial Structures with Applications to Computer Science, New York, McGray-Hill, 1975.Google Scholar
- Wos, L., Automated Reasoning, American Mathematical Monthly, Vol. 92,No.2, Feb. 1985.Google Scholar