论文信息 - Hyper-Chaining and Knowledge-Based Theorem Proving

Hyper-Chaining and Knowledge-Based Theorem Proving

Many programs have built-in axioms and lemmas of various theories [2,3,4,5,6,8,9,11]. These programs gain their efficiency by restricting and guiding the use of their axioms and lemmas; however, they do not hold their axioms or lemmas in a declarative form. Control and representation issues were intertwined with the encoding of the axioms and lemmas. As a result, the programs can not be simply combined to form more prowerful programs.

Larry M. Hines

[1] J. A. Robinson,et al. Automatic Deduction with Hyper-Resolution , 1983 .

[2] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[3] W. W. Bledsoe,et al. Variable Elimination and Chaining in a Resolution-based Prover for Inequalities , 1980, CADE.

[4] Larry Wos,et al. The Linked Inference Principle, II: The User's Viewpoint , 1984, CADE.

[5] James R. Slagle. Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets , 1972, JACM.

[6] L. Wos,et al. Paramodulation and Theorem-Proving in First-Order Theories with Equality , 1983 .

[7] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.