Designing Examples for Semantically Guided Hierarchical Deduction
Proceedings of the Ninth International Joint Conference on Artificial Intelligence. Theorem Proving. Pages 1201-1206.
Abstract
Sema.ntically guided hierarchical deduction prover is a resolution-based theorem-proving procedure which is capable of using the domain dependent knowledge presented in weil designed examples. This paper gives a.n overview of the basic deduction components of the prover, investigates some rules for human design of examples, and demonstrates their usage in proving several non-trivial theorems.
Tie-Cheng Wang. 1985. Designing Examples for Semantically Guided Hierarchical Deduction. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85. IJCAI, 1201–1206. https://ijcai.org/proceedings/1985/243
Wang, T. (1985). Designing Examples for Semantically Guided Hierarchical Deduction. In Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 (pp. 1201–1206). IJCAI. https://ijcai.org/proceedings/1985/243
@inproceedings{ijcai1985p243,
title = {Designing Examples for Semantically Guided Hierarchical Deduction},
author = {Wang, Tie-Cheng},
booktitle = {Proceedings of the Ninth International Joint Conference on
Artificial Intelligence, {IJCAI-85}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Aravind Joshi},
pages = {1201--1206},
year = {1985},
note = {Theorem Proving},
url = {https://ijcai.org/proceedings/1985/243},
}
TY - CPAPER TI - Designing Examples for Semantically Guided Hierarchical Deduction AU - Wang, Tie-Cheng T2 - Proceedings of the Ninth International Joint Conference on Artificial Intelligence, IJCAI-85 PB - International Joint Conferences on Artificial Intelligence PY - 1985 SP - 1201 EP - 1206 UR - https://ijcai.org/proceedings/1985/243 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
