Semantically Guided First-Order Theorem Proving using Hyper-Linking

Chu, Heng; Plaisted, David A.

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

Datensatz

DATENSATZ AKTIONENEXPORT

Zur Ablage hinzufügen

Lokale TagsFreigabegeschichteDetailsÜbersicht

Freigegeben

Konferenzbeitrag

Semantically Guided First-Order Theorem Proving using Hyper-Linking

MPG-Autoren

Plaisted, David A.
Max Planck Society;

Externe Ressourcen

https://rdcu.be/dtofk
(Verlagsversion)

Volltexte (beschränkter Zugriff)

Für Ihren IP-Bereich sind aktuell keine Volltexte freigegeben.

Volltexte (frei zugänglich)

Es sind keine frei zugänglichen Volltexte in PuRe verfügbar

Ergänzendes Material (frei zugänglich)

Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar

Zitation

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.

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

Zusammenfassung

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