Semantically Guided First-Order Theorem Proving using Hyper-Linking

Chu, Heng; Plaisted, David A.

doi:10.1007/3-540-58156-1_14

アイテム詳細

登録内容を編集ファイル形式で保存

一時保存へ追加

タグ情報を表示リリース履歴を表示詳細要約

公開

会議論文

Semantically Guided First-Order Theorem Proving using Hyper-Linking

MPS-Authors

Plaisted, David A.
Max Planck Society;

External Resource

https://rdcu.be/dtofk
(出版社版)

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

フルテキスト (公開)

公開されているフルテキストはありません

付随資料 (公開)

There is no public supplementary material available

引用

Chu, H., & Plaisted, D. A. (1994). Semantically Guided First-Order Theorem Proving using Hyper-Linking. In A., Bundy (Ed.), Proceedings of the 12th International Conference on Automated Deduction (CADE-12) (pp. 192-206). Berlin, Germany: Springer.

引用: https://hdl.handle.net/11858/00-001M-0000-0014-ADA0-2

要旨

We present a new procedure, {\em semantic hyper-linking} which uses semantics
to guide an instance-based clause-form theorem prover. Semantics for the input
clauses is given as input. During the search for the proof, ground instances of
the input clauses are generated and new semantic structures are built based on
the input semantics and a model of the ground clause set. A proof is found if
the ground clause set is unsatisfiable. We give some results in proving hard
theorems using semantic hyper-linking; no other special human guidance was
given to prove these hard problems. We also show that our method is powerful
even with a trivial semantics (that is, even with no guidance in the form of
semantic information).