Name
Abstract | ||
|---|---|---|
We present a new procedure, 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 those 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). |
Year | DOI | Venue |
|---|---|---|
1994 | 10.1007/3-540-58156-1_14 | CADE |
Keywords | Field | DocType |
semantically guided first-order theorem,first order,theorem prover,theorem proving | Computer-assisted proof,Discrete mathematics,Programming language,Gödel's completeness theorem,Computer science,Automated theorem proving,Algorithm,Mathematical proof,First-order logic,Fundamental theorem,Compactness theorem,Formal proof | Conference |
ISBN | Citations | PageRank |
3-540-58156-1 | 18 | 0.95 |
References | Authors | |
20 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heng Chu | 1 | 58 | 4.78 |
| David A. Plaisted | 2 | 1680 | 255.36 |