Semantically Guided First-Order Theorem Proving using Hyper-Linking

Chu, Heng; Plaisted, David A.

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

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

Semantically Guided First-Order Theorem Proving using Hyper-Linking

MPS-Authors

Plaisted, David A.
Max Planck Society;

External Resource

https://rdcu.be/dtofk
(Publisher version)

Fulltext (restricted access)

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

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

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.

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

Abstract

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).